On relaxing the N-Reachability Implicit Requirement in NMPC Design
On relaxing the N-Reachability Implicit Requirement in NMPC Design
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.
Mazen Alamir
自动化基础理论
Mazen Alamir.On relaxing the N-Reachability Implicit Requirement in NMPC Design[EB/OL].(2025-04-22)[2025-07-16].https://arxiv.org/abs/2504.15704.点此复制
评论