2006
DOI: 10.1109/tac.2006.875014
|View full text |Cite
|
Sign up to set email alerts
|

On the stability of constrained MPC without terminal constraint

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
137
0
3

Year Published

2008
2008
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 183 publications
(141 citation statements)
references
References 7 publications
1
137
0
3
Order By: Relevance
“…The discrete-time case was investigated in Limon et al (2006). The following two lemmas generalize these results to continuous-time systems as considered in this chapter.…”
Section: Appendix a -Reachability Of Clf Region (Theorem 1)mentioning
confidence: 78%
See 2 more Smart Citations
“…The discrete-time case was investigated in Limon et al (2006). The following two lemmas generalize these results to continuous-time systems as considered in this chapter.…”
Section: Appendix a -Reachability Of Clf Region (Theorem 1)mentioning
confidence: 78%
“…The sublevel set Γ α defines the domain of attraction for the MPC scheme without terminal constraints Limon et al, 2006). The proof of this statement is given in Appendix A.…”
Section: The Optimal Cost Satisfiesmentioning
confidence: 98%
See 1 more Smart Citation
“…Moreover, the implementation of the terminal constraint can increase the computational burden of the optimization problem, possibly demanding longer computational times for a given tolerance than the sampling period (Allgöwer et al, 2004). Limon et al (2006) showed that weighting the terminal cost enlarges the domain of attraction of the MPC, proving also that, for any state of the system that can reach , there is a weight so that the state will go inside the attraction region of the controller.…”
Section: Formulation and Different Approaches For The Resolution Of Tmentioning
confidence: 95%
“…Receding horizon formulations in model predictive control often use terminal set or equality constraints to achieve stability. In the case of a free end point formulation as it is the case in (12), stability can be shown, e. g., if the terminal cost function ||Δθ(t i,f )|| 2 P represents a (local) control Lyapunov function [1,11,8] or if the horizon length t f is sufficiently large [5]. For the error dynamics (12b), which is time-dependent due to the feedforward trajectories, the rigorous proof of stability [3] as well as the consistency of this finite-dimensional control with the original infinite-dimensional system is subject of current research.…”
Section: δU Fb (T) = δū(T; δθmentioning
confidence: 99%