Title :
On the complexity of explicit MPC laws
Author :
Borrelli, Francesco ; Baotic, Mato ; Pekar, Jaroslav ; Stewart, Greg
Author_Institution :
Dept. of Mech. Eng., Univ. of California, Berkeley, Berkeley, CA, USA
Abstract :
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive Control requires the online solution of such QPs. This can be obtained by using a QP solver or evaluating the associated explicit solution. Objective of this note is to shed some light on the complexity of the two approaches.
Keywords :
linear systems; optimal control; performance index; predictive control; quadratic programming; QP solver; explicit MPC laws; finite-time optimal control problems; linear constraints; linear systems; model predictive control; quadratic performance index; quadratic programs; Complexity theory; Equations; Europe; Indexes; Optimal control; Predictive control; Vectors;
Conference_Titel :
Control Conference (ECC), 2009 European
Conference_Location :
Budapest
Print_ISBN :
978-3-9524173-9-3
