Robust and stochastic linear MPC for systems subject to multiplicative uncertainty
A robust Model Predictive Control (MPC) strategy is proposed for linear systems with multiplicative uncertainty. The uncertainty in the prediction horizon is bounded by sequences of polytopic sets of fixed but arbitrary complexity. A method of computing polytopic terminal sets of arbitrary complexit...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2012
|
| _version_ | 1826299789369671680 |
|---|---|
| author | Evans, M Cannon, M Kouvaritakis, B |
| author_facet | Evans, M Cannon, M Kouvaritakis, B |
| author_sort | Evans, M |
| collection | OXFORD |
| description | A robust Model Predictive Control (MPC) strategy is proposed for linear systems with multiplicative uncertainty. The uncertainty in the prediction horizon is bounded by sequences of polytopic sets of fixed but arbitrary complexity. A method of computing polytopic terminal sets of arbitrary complexity is also described. An MPC law based on the minimisation of an expected quadratic cost is formulated as a quadratic program. An extension to the case of probabilistic constraints requiring the solution of a mixed-integer program is described, which exhibits low conservatism with respect to constraint violations. © 2012 IFAC. |
| first_indexed | 2024-03-07T05:07:17Z |
| format | Journal article |
| id | oxford-uuid:da5b8975-4e26-4c83-b9c1-11551d964a4e |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T05:07:17Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | oxford-uuid:da5b8975-4e26-4c83-b9c1-11551d964a4e2022-03-27T09:02:39ZRobust and stochastic linear MPC for systems subject to multiplicative uncertaintyJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:da5b8975-4e26-4c83-b9c1-11551d964a4eEnglishSymplectic Elements at Oxford2012Evans, MCannon, MKouvaritakis, BA robust Model Predictive Control (MPC) strategy is proposed for linear systems with multiplicative uncertainty. The uncertainty in the prediction horizon is bounded by sequences of polytopic sets of fixed but arbitrary complexity. A method of computing polytopic terminal sets of arbitrary complexity is also described. An MPC law based on the minimisation of an expected quadratic cost is formulated as a quadratic program. An extension to the case of probabilistic constraints requiring the solution of a mixed-integer program is described, which exhibits low conservatism with respect to constraint violations. © 2012 IFAC. |
| spellingShingle | Evans, M Cannon, M Kouvaritakis, B Robust and stochastic linear MPC for systems subject to multiplicative uncertainty |
| title | Robust and stochastic linear MPC for systems subject to multiplicative uncertainty |
| title_full | Robust and stochastic linear MPC for systems subject to multiplicative uncertainty |
| title_fullStr | Robust and stochastic linear MPC for systems subject to multiplicative uncertainty |
| title_full_unstemmed | Robust and stochastic linear MPC for systems subject to multiplicative uncertainty |
| title_short | Robust and stochastic linear MPC for systems subject to multiplicative uncertainty |
| title_sort | robust and stochastic linear mpc for systems subject to multiplicative uncertainty |
| work_keys_str_mv | AT evansm robustandstochasticlinearmpcforsystemssubjecttomultiplicativeuncertainty AT cannonm robustandstochasticlinearmpcforsystemssubjecttomultiplicativeuncertainty AT kouvaritakisb robustandstochasticlinearmpcforsystemssubjecttomultiplicativeuncertainty |