Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Approximations of closed-loop MPC

Author(s):

J. Löfberg
Conference/Journal:

IEEE Conference on Decision and Control, Maui, Hawaii, pp. 1438-1442
Abstract:

Minimax or worst-case approaches have been used frequently recently in model predictive control (MPC) to obtain control laws that are less sensitive to uncertainty. The problem with minimax MPC is that the controller can become overly conservative. An extension to minimax MPC that can resolve this problem is closed-loop minimax MPC. Unfortunately, closed-loop minimax MPC is essentially an intractable problem. In this paper, we introduce a novel approach to approximate the solution to a number of closed-loop minimax MPC problems. The result is convex optimization problems with size growing polynomially in system dimension and prediction horizon.

Year:

2003
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { Xxx:2003:IFA_312,
    author={J. L{\"o}fberg},
    title={{Approximations of closed-loop MPC}},
    booktitle={IEEE Conference on Decision and Control},
    pages={1438--1442},
    year={2003},
    address={Maui, Hawaii},
    month=dec,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=312}
}
Permanent link