2019 18th European Control Conference (ECC) 2019
DOI: 10.23919/ecc.2019.8796265
|View full text |Cite
|
Sign up to set email alerts
|

Efficient computation of RPI sets for tube-based robust MPC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
16
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(17 citation statements)
references
References 14 publications
1
16
0
Order By: Relevance
“…A. Darup and Teichrib, [9] This work combines the advantages of both [10] and [11] to yield an algorithm that is more efficient than [11] and can generate RPI sets that are less conservative than [10]. This is accomplished by first using the techniques presented in [11] to compute, for the user defined ≥ 0, the value k * such that…”
Section: Proposed Rpi Set Computation Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…A. Darup and Teichrib, [9] This work combines the advantages of both [10] and [11] to yield an algorithm that is more efficient than [11] and can generate RPI sets that are less conservative than [10]. This is accomplished by first using the techniques presented in [11] to compute, for the user defined ≥ 0, the value k * such that…”
Section: Proposed Rpi Set Computation Methodsmentioning
confidence: 99%
“…In (9) the symmetric, positive definite cost matrices Q and R are chosen to be the same as in (4). Additional design variables for the problem include the terminal cost matrix P , the terminal set X N , and the constraint sets Z and Ū.…”
Section: Online Optimization Problemmentioning
confidence: 99%
See 3 more Smart Citations