Cited by 340Advanced Control Systems OptimizationStability and Control of Uncertain SystemsFormal Methods in Verification

Input-to-state stable MPC for constrained discrete-time nonlinear systems with bounded additive uncertainties

Marruedo, D.L., Alamo, T., Camacho, E.F.·2004·Proceedings of the 41st IEEE Conference on Decision and Control, 2002.

Abstract

In this paper a robust model predictive control (MPC) for constrained discrete-time nonlinear system with additive uncertainties is presented. This controller uses a terminal cost, terminal constraint and nominal predictions. The terminal region and constraints on the states are computed to get robust feasibility of the closed loop system for a given bound on the admissible uncertainties. Furthermore, it is proved that the closed-loop system is input-to-state stable with relation to the uncertainties. Therefore, the closed-loop system evolves towards a compact set where it is ultimately bounded. In case of decaying uncertainties, the closed-loop system is asymptotically stable. The convergence of the closed loop system is guaranteed despite the suboptimality of the solution.

Integrity signals

Registry

Crossref · 10.1109/cdc.2002.1185106

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • In [30] and [31], ISS of MPC with terminal ingredients was analyzed using a feasible control sequence, but the derived cumulative error bound increases with increasing prediction horizon, resulting in an overconservative cumulative error bound.

    “In [30] and [31], ISS of MPC with terminal ingredients was analyzed where a feasible control sequence, which guarantees that input and state constraints are not violated, was employed. However, the derived cumulative error bound increases with increasing the prediction horizon. It results in an overconservative cumulative error bound”
  • The cumulative error bound in this article does not increase as N increases.

    “Different from the cumulative error bound ( Ls ( L f N -1 -1 / L f -1 ) + Lt L f N -1 ) d (where L f , Ls , and Lt are Lipschitz constants and d is the upper bound of the disturbance) derived in [30] and [31], the cumulative error bound in this article N := ( K ( 1 + K 0 P )/ 1 - √ ρ) √ (λ max ( P )λ max ( Q )/λ min ( Q )) ¯ ∗”
  • In contrast to ISS analyses in [30] and [31], feasible control sequences are not required in this article.

    “In contrast to ISS analyses in [30] and [31], feasible control sequences are not required in this article.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Marruedo, D. L., Alamo, T., & Camacho, E. F.
Affiliations
Universidad de Sevilla (ES)
Venue
Proceedings of the 41st IEEE Conference on Decision and Control, 2002.
Publisher
IEEE
Published
2004-01-23
Volume
4
Pages
4619-4624
ISSN
0191-2216 (ISSN-L)
OpenAlex
W2115562234
Cited by
340
References
13
Citations by year
2026: 4 · 2025: 14 · 2024: 22 · 2023: 14 · 2022: 17 · 2021: 13 · 2020: 20 · 2019: 24 · 2018: 17 · 2017: 20 · 2016: 13 · 2015: 15 · 2014: 23 · 2013: 18 · 2012: 18
FWCI
18.01
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Conference on Decision and Control (CDC) (publishedVersion)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
  • Physical Sciences › Engineering › Control and Systems Engineering › Stability and Control of Uncertain Systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
Keywords
robust model predictive control, input-to-state stability, discrete-time nonlinear systems, terminal cost, terminal constraints, terminal region, robust feasibility, ultimate boundedness, asymptotic stability, suboptimal control

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