arXiv · 2611.23017
On the recursive feasibility and stability of MPC without terminal constraints
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mara Perez, Ignacio Sanchez, Filiberto Fele, Daniel Limon. 2026-11-17. On the recursive feasibility and stability of MPC without terminal constraints. https://searcharxiv.com/abs/2611.23017
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.