TR2014-087
Nearly Optimal Simple Explicit MPC Controllers with Stability and Feasibility Guarantees
-
- "Nearly Optimal Simple Explicit MPC Controllers with Stability and Feasibility Guarantees", Optimal Control Applications and Methods, DOI: 10.1002/oca.2131, Vol. 32, No. 2, July 2014.BibTeX TR2014-087 PDF
- @article{Holaza2014jul,
- author = {Holaza, J. and Takacs, B. and Kvasnica, M. and {Di Cairano}, S.},
- title = {Nearly Optimal Simple Explicit MPC Controllers with Stability and Feasibility Guarantees},
- journal = {Optimal Control Applications and Methods},
- year = 2014,
- volume = 32,
- number = 2,
- month = jul,
- publisher = {John Wiley \& Sons, Ltd.},
- doi = {10.1002/oca.2131},
- issn = {1099-1514},
- url = {https://www.merl.com/publications/TR2014-087}
- }
,
- "Nearly Optimal Simple Explicit MPC Controllers with Stability and Feasibility Guarantees", Optimal Control Applications and Methods, DOI: 10.1002/oca.2131, Vol. 32, No. 2, July 2014.
-
MERL Contact:
-
Research Area:
Abstract:
We consider the problem of synthesizing simple explicit model predictive control feedback laws that provide closed-loop stability and recursive satisfaction of state and input constraints. The approach is based on replacing a complex optimal feedback law by a simpler controller whose parameters are tuned, off-line, to minimize the reduction of the performance. The tuning consists of two steps. In the first step, we devise a simpler polyhedral partition by solving a parametric optimization problem. In the second step, we then optimize parameters of local affine feedbacks by minimizing the integrated squared error between the original controller and its simpler counterpart. We show that such a problem can be formulated as a convex optimization problem. Moreover, we illustrate that conditions of closed-loop stability and recursive satisfaction of constraints can be included as a set of linear constraints. Efficiency of the method is demonstrated on two examples.