Real-time input-constrained MPC using fast gradient methods

Linear quadratic model predictive control (MPC) with input constraints leads to an optimization problem that has to be solved at every instant in time. Although there exists computational complexity analysis for current online optimization methods dedicated to MPC, the worst case complexity bound is either hard to compute or far off from the practically observed bound. In this paper we introduce fast gradient methods that allow one to compute a priori the worst case bound required to find a solution with pre-specified accuracy. Both warm- and cold-starting techniques are analyzed and an illustrative example confirms that small, practical bounds can be obtained that together with the algorithmic and numerical simplicity of fast gradient methods allow online optimization at high rates.

Published in:
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 7387-7393
Presented at:
Joint 48th IEEE Conference on Decision and Control (CDC) and 28th Chinese Control Conference (CCC), Shanghai, China, 15-18 December 2009

Note: The status of this file is: Anyone
The status of this file is: EPFL only

 Record created 2011-10-24, last modified 2020-07-30

Download fulltextPDF
Publisher's version:
Download fulltextPDF
Rate this document:

Rate this document:
(Not yet reviewed)