The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the stability of constrained MPC without terminal constraint
Abstract
The usual way to guarantee stability of model predictive control (MPC) strategies is based on a terminal cost function and a terminal constraint region. This note analyzes the stability of MPC when the terminal constraint is removed. This is particularly interesting when the system is unconstrained on the state. In this case, the computational burden of the optimization problem does not have to be increased by introducing terminal state constraints due to stabilizing reasons. A region in which the terminal constraint can be removed from the optimization problem is characterized depending on some of the design parameters of MPC. This region is a domain of attraction of the MPC without terminal constraint. Based on this result, it is proved that weighting the terminal cost, this domain of attraction of the MPC controller without terminal constraint is enlarged reaching (practically) the same domain of attraction of the MPC with terminal constraint; moreover, a practical procedure to calculate the stabilizing weighting factor for a given initial state is shown. Finally, these results are extended to the case of suboptimal solutions and an asymptotically stabilizing suboptimal controller without terminal constraint is presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Constrained model predictive control: Stability and optimality
Mayne, D. Q., Rawlings, J. B., Rao, C. V., & Scokaert, P. O. M. (2000) · Automatica · doi:10.1016/s0005-1098(99)00214-9 · Cited by 8,736
Cited by
Model predictive control: Recent developments and future promise
Mayne, D. Q. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.128 · Cited by 1,975
Taheri, S., Hosseini, P., & Razban, A. (2022) · Journal of Building Engineering · doi:10.1016/j.jobe.2022.105067 · Cited by 263
Nonlinear Reference Tracking: An Economic Model Predictive Control Perspective
Kohler, J., Muller, M. A., & Allgower, F. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2800789 · Cited by 115
“Most of the existing theoretical results for MPC are available for the objective of setpoint stabilization and can be classified into schemes with terminal constraints [2], [3] and without terminal constraints [4]–[6].”
BackgroundRobust learning-based MPC for nonlinear constrained systems
Manzano, J. M., Limon, D., Muñoz de la Peña, D., & Calliess, J.-P. (2020) · Automatica · doi:10.1016/j.automatica.2020.108948 · Cited by 87
Self-citation
Metadata
- Authors
- Limon, D., Alamo, T., Salas, F., & Camacho, E. F.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2006-05
- Volume
- 51
- Issue
- 5
- Pages
- 832-836
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2151088727
- Cited by
- 228
- References
- 1
- FWCI
- 9.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the stability of constrained MPC without terminal constraint. https://app.cochat.ai/papers/10.1109/tac.2006.875014
- The paper
- Limon, D., Alamo, T., Salas, F., & Camacho, E. F. (2006). On the stability of constrained MPC without terminal constraint. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2006.875014
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.