Constrained min-max predictive control: modifications of the objective function leading to polynomial complexity
- 16 May 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 50 (5) , 710-714
Abstract
In this note, an efficient way of implementing a constrained min-max predictive controller is presented. The new approach modifies the objective function in such a way that the resulting min-max problem can be solved in polynomial time. Different modifications are proposed. The main contribution of the note is to provide a robust constrained min-max predictive controller that can be implemented in real time. The new controller stabilizes the uncertain system.Keywords
This publication has 11 references indexed in Scilit:
- Min max MPC based on a graph problem2004
- Convex Optimization2004
- Feedback min‐max model predictive control using a single linear program: robust stability and the explicit solutionInternational Journal of Robust and Nonlinear Control, 2004
- Robust model predictive control using tubesAutomatica, 2004
- Min-max control of constrained uncertain discrete-time linear systemsIEEE Transactions on Automatic Control, 2003
- Constrained model predictive control: Stability and optimalityAutomatica, 2000
- Efficient robust predictive controlIEEE Transactions on Automatic Control, 2000
- A linear programming approach to constrained robust predictive controlIEEE Transactions on Automatic Control, 2000
- Minimum cuts and related problemsNetworks, 1975
- A minimax control problem for sampled linear systemsIEEE Transactions on Automatic Control, 1968