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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

On the recursive feasibility and stability of MPC without terminal constraints

Filiberto Fele, Daniel Limón, Ignacio Sánchez, Mara Pérez
arXiv (Cornell University)
Advanced Control Systems Optimization
preprint

On the recursive feasibility and stability of MPC without terminal constraints

Filiberto Fele, Daniel Limón, Ignacio Sánchez, Mara Pérez
preprint en

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.

arXiv (Cornell University)
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon