By Topic

Low-complexity polynomial approximation of explicit MPC via linear programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Kvasnica, M. ; Inst. of Inf. Eng., Autom., & Math., Slovak Univ. of Technol. in Bratislava, Bratislava, Slovakia ; Löfberg, J. ; Herceg, M. ; C̆irka, L.
more authors

This paper addresses the issue of the practical implementation of Model Predictive Controllers (MPC) to processes with short sampling times. Given an explicit solution to an MPC problem, the main idea is to approximate the optimal control law defined over state space regions by a single polynomial of pre-specified degree which, when applied as a state-feedback, guarantees closed-loop stability, constraint satisfaction, and a bounded performance decay. It is shown how to search for such a polynomial by solving a single linear program.

Published in:

American Control Conference (ACC), 2010

Date of Conference:

June 30 2010-July 2 2010