Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

A Condensed and Sparse QP Formulation for Predictive Control

Author(s):

J.L. Jerez, E.C. Kerrigan, G. Constantinides
Conference/Journal:

Conference on Decision and Control (CDC), Orlando, FL, USA, pp. 5217-5222
Abstract:

The computational burden that model predictive control (MPC) imposes depends to a large extent on the way the optimal control problem is formulated as an optimization problem. In this paper, we present a new formulation that results in a compact and sparse optimization problem to be solved at each sampling interval. The approach is based on a change of variables that leads to a block banded Hessian when the horizon length is bigger than the controllability index of the plant. In this case the problem can be solved with an interior-point method in time linear in the horizon length. Existing dense approaches grow cubically with the horizon length, whereas existing sparse approaches grow at a significantly greater rate than with the method presented here.

Year:

2011
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { JerKer:2011:IFA_4695,
    author={J.L. Jerez and E.C. Kerrigan and G. Constantinides},
    title={{A Condensed and Sparse QP Formulation for Predictive
	  Control}},
    booktitle={Conference on Decision and Control (CDC)},
    pages={5217--5222},
    year={2011},
    address={Orlando, FL, USA},
    month=dec,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=4695}
}
Permanent link