On the recursive feasibility and stability of MPC without terminal constraints
In this paper, we analyze stability and recursive feasibility of a model predictive control (MPC) scheme that does not rely on terminal ingredients -- such as terminal constraints or a terminal cost based on a terminal controller. In the proposed formulation, we augment the cost function by a weighted finite tail which is optimized online, and we show it plays the role of a stabilizing terminal cost. Under a relaxed, local dynamic programming condition on the tail, we certify a family of regions -- parameterized by the tail's weight coefficient -- on which the problem is recursively feasible and the origin is asymptotically stable. These regions are larger as the weight increases: in particular, we show that any state that can be steered within the control horizon to a predefined neighborhood of the origin is contained in a certified region for a sufficiently large weight. Finally, we characterize the closed-loop performance over the certified region, bounding the suboptimality of the closed loop with respect to the infinite-horizon optimal cost. We conclude the discussion by illustrating these results on a simple numerical example.
Authors
- Filiberto Fele (ORCID: https://orcid.org/0000-0002-2081-0014)
- Daniel Limón (ORCID: https://orcid.org/0000-0001-9334-7289)
- Ignacio Sánchez (ORCID: https://orcid.org/0009-0003-9916-8806)
- Mara Pérez (ORCID: https://orcid.org/0009-0004-4518-7742)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-17
- DOI
- https://doi.org/10.48550/arxiv.2611.23017
- Primary Topic
- Advanced Control Systems Optimization
- Type
- preprint