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

Robust MPC with recursive model update

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
267
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 154 publications
(280 citation statements)
references
References 30 publications
1
267
0
Order By: Relevance
“…and (24) for the same random initial condition x 0 ∈ CS 12 and disturbance realization. As reported in Table II, on average it takes ∼ 5ms to evaluate the safe policy (21) and ∼ 4.6s to evaluate the LMPC policy (24). This result is expected as the safe policy (21) is evaluated solving a LP and the LMPC policy (24) solving N + 1 = 4 QPs.…”
Section: Exploiting the Safe Policymentioning
confidence: 77%
See 3 more Smart Citations
“…and (24) for the same random initial condition x 0 ∈ CS 12 and disturbance realization. As reported in Table II, on average it takes ∼ 5ms to evaluate the safe policy (21) and ∼ 4.6s to evaluate the LMPC policy (24). This result is expected as the safe policy (21) is evaluated solving a LP and the LMPC policy (24) solving N + 1 = 4 QPs.…”
Section: Exploiting the Safe Policymentioning
confidence: 77%
“…where κ j, * (·) is the safe policy defined in (21). Proof 2: The proof can be found in the Appendix.…”
Section: Set Of Safe Policiesmentioning
confidence: 99%
See 2 more Smart Citations
“…In general, RAMPC schemes [5], [6], [7], [8], [9], [10], [11], [12] use set membership estimation to provide a set of non falsified parameters, which is utilized in a robust tubebased MPC approach to provide robustness w.r.t. uncertain parameters and disturbances.…”
Section: Related Workmentioning
confidence: 99%