On relaxing the N-Reachability Implicit Requirement in NMPC Design

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Alamir, Mazen
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913880353013760
author Alamir, Mazen
author_facet Alamir, Mazen
contents This paper proposes a proof of stability for Model Predictive Control formulations involving a prediction horizon that might be too short to meet the reachability condition generally invoked as a sufficient condition for closed-loop stability. This condition is replaced by a contraction condition on the stage cost. But unlike the contraction based existing formulations where the prediction horizon becomes a decision variable, the formulation proposed in this paper remains standard in that it uses constant and short prediction horizon. An illustrative example is provided to assess the relevance of the proposed formulation.
format Preprint
id arxiv_https___arxiv_org_abs_2504_15704
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On relaxing the N-Reachability Implicit Requirement in NMPC Design
Alamir, Mazen
Systems and Control
This paper proposes a proof of stability for Model Predictive Control formulations involving a prediction horizon that might be too short to meet the reachability condition generally invoked as a sufficient condition for closed-loop stability. This condition is replaced by a contraction condition on the stage cost. But unlike the contraction based existing formulations where the prediction horizon becomes a decision variable, the formulation proposed in this paper remains standard in that it uses constant and short prediction horizon. An illustrative example is provided to assess the relevance of the proposed formulation.
title On relaxing the N-Reachability Implicit Requirement in NMPC Design
topic Systems and Control
url https://arxiv.org/abs/2504.15704