2007
DOI: 10.1016/j.automatica.2006.07.022
|View full text |Cite
|
Sign up to set email alerts
|

Improving off-line approach to robust MPC based-on nominal performance cost

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
51
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 95 publications
(51 citation statements)
references
References 6 publications
0
51
0
Order By: Relevance
“…Using Lemma 3, it can be proved that the convex combination (γ,Q Q Q 0 ,Q Q Q 1 , · · · ,Q Q Q N−1 ) would also be the solution of conditions (8a), (8b), (10), and (11). Remark 2.…”
Section: Reduction Of Computation Burdenmentioning
confidence: 97%
See 3 more Smart Citations
“…Using Lemma 3, it can be proved that the convex combination (γ,Q Q Q 0 ,Q Q Q 1 , · · · ,Q Q Q N−1 ) would also be the solution of conditions (8a), (8b), (10), and (11). Remark 2.…”
Section: Reduction Of Computation Burdenmentioning
confidence: 97%
“…For the uncertain system (1)-(4), suppose that the two groups (γ1, Q Q Q 1,0 , Q Q Q 1,1 , · · · , Q Q Q 1,N−1 ) and (γ2, Q Q Q 2,0 , Q Q Q 2,1 , · · · , Q Q Q 2,N−1 ) satisfy conditions (8a), (8b), (10), and (11), respectively, and that the convex combination (γ,Q Q Q 0 ,Q Q Q 1 , · · · ,Q Q Q N−1 ) would also satisfy the conditions (8a), (8b), (10), and (11)…”
Section: Reduction Of Computation Burdenmentioning
confidence: 99%
See 2 more Smart Citations
“…This is due to the fact that the algorithm directly solves off-line the optimization problem presented in [1]. In [6], an ellipsoidal off-line MPC algorithm based on nominal performance cost was presented. The algorithm directly extends the algorithm presented in [5] by choosing the nominal performance cost to substitute the worst-case performance cost.…”
Section: Introductionmentioning
confidence: 99%