DocumentCode
3636806
Title
Low-complexity polynomial approximation of explicit MPC via linear programming
Author
Michal Kvasnica;Johan Löfberg;Martin Herceg;L´uboš čirka;Miroslav Fikar
Author_Institution
Institute of Information Engineering, Automation, and Mathematics, Faculty of Chemical and Food Technology, Slovak University of Technology in Bratislava, Slovakia
fYear
2010
fDate
6/1/2010 12:00:00 AM
Firstpage
4713
Lastpage
4718
Abstract
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.
Keywords
"Polynomials","Linear programming","Sampling methods","Optimal control","Stability","Table lookup","Automatic control","Feedback","State-space methods","Chemical technology"
Publisher
ieee
Conference_Titel
American Control Conference (ACC), 2010
ISSN
0743-1619
Print_ISBN
978-1-4244-7426-4
Type
conf
DOI
10.1109/ACC.2010.5531092
Filename
5531092
Link To Document