Robust MPC for linear systems with bounded multiplicative uncertainty
A robust tube-based Model Predictive Control (MPC) strategy is proposed for linear systems with multiplicative parametric uncertainty. The tubes are defined by sequences of polytopic sets for which we propose two methods of construction, respectively employing low-complexity parallelotopes and polyt...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
2012
|
| _version_ | 1826274791368163328 |
|---|---|
| author | Evans, M Cannon, M Kouvaritakis, B IEEE |
| author_facet | Evans, M Cannon, M Kouvaritakis, B IEEE |
| author_sort | Evans, M |
| collection | OXFORD |
| description | A robust tube-based Model Predictive Control (MPC) strategy is proposed for linear systems with multiplicative parametric uncertainty. The tubes are defined by sequences of polytopic sets for which we propose two methods of construction, respectively employing low-complexity parallelotopes and polytopes of fixed but arbitrary complexity. A method of computing polytopic terminal sets of arbitrary complexity is also described. An MPC law based on the minimization of an expected quadratic cost is formulated as a quadratic program. An extension to the case of probabilistic constraints requiring the online solution of a mixed-integer program is described. © 2012 IEEE. |
| first_indexed | 2024-03-06T22:48:48Z |
| format | Conference item |
| id | oxford-uuid:5e1b5102-5d17-4297-af91-77011db2269d |
| institution | University of Oxford |
| last_indexed | 2024-03-06T22:48:48Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | oxford-uuid:5e1b5102-5d17-4297-af91-77011db2269d2022-03-26T17:38:29ZRobust MPC for linear systems with bounded multiplicative uncertaintyConference itemhttp://purl.org/coar/resource_type/c_5794uuid:5e1b5102-5d17-4297-af91-77011db2269dSymplectic Elements at Oxford2012Evans, MCannon, MKouvaritakis, BIEEEA robust tube-based Model Predictive Control (MPC) strategy is proposed for linear systems with multiplicative parametric uncertainty. The tubes are defined by sequences of polytopic sets for which we propose two methods of construction, respectively employing low-complexity parallelotopes and polytopes of fixed but arbitrary complexity. A method of computing polytopic terminal sets of arbitrary complexity is also described. An MPC law based on the minimization of an expected quadratic cost is formulated as a quadratic program. An extension to the case of probabilistic constraints requiring the online solution of a mixed-integer program is described. © 2012 IEEE. |
| spellingShingle | Evans, M Cannon, M Kouvaritakis, B IEEE Robust MPC for linear systems with bounded multiplicative uncertainty |
| title | Robust MPC for linear systems with bounded multiplicative uncertainty |
| title_full | Robust MPC for linear systems with bounded multiplicative uncertainty |
| title_fullStr | Robust MPC for linear systems with bounded multiplicative uncertainty |
| title_full_unstemmed | Robust MPC for linear systems with bounded multiplicative uncertainty |
| title_short | Robust MPC for linear systems with bounded multiplicative uncertainty |
| title_sort | robust mpc for linear systems with bounded multiplicative uncertainty |
| work_keys_str_mv | AT evansm robustmpcforlinearsystemswithboundedmultiplicativeuncertainty AT cannonm robustmpcforlinearsystemswithboundedmultiplicativeuncertainty AT kouvaritakisb robustmpcforlinearsystemswithboundedmultiplicativeuncertainty AT ieee robustmpcforlinearsystemswithboundedmultiplicativeuncertainty |