Francesco Borrelli, Mato Baotiæ, Jaroslav Pekar, Greg Stewart

Proceedings of the European Control Conference 2009, pp.2408-2413, 2009

ABSTRACT: Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be translated 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.

BibTeX entry:
@inproceedings \{Borrelli2009_476,
author = \{Borrelli, F. AND Baoti\'{c}, M. AND Pekar, J. AND Stewart, G.},
title = \{On Complexity of Explicit MPC Laws}, booktitle = {Proceedings of the European Control Conference 2009}, pages = \{2408-2413}, year = \{2009} }