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.

  

Complexity Reduction of Receding Horizon Control

Author(s):

P. Grieder, M. Morari
Conference/Journal:

IEEE Conference on Decision and Control, Maui, Hawaii, pp. 3179-3184
Abstract:

The off-line solution of constrained optimal control problems has garnered increasing attention because implementation can be realized with a simple look-up table. In this paper, a detailed complexity analysis of algorithms used to compute the explicit optimal control solution is given. Based on this analysis, two novel algorithms to compute controllers of significantly lower complexity are presented. Stability and feasibility of the closed-loop system are guaranteed by both algorithms. Extensive simulation results show that, on average, the controller complexity can be reduced by a factor of $100$ at the cost of a performance decrease by $1%$.

Year:

2003
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { GriMor:2003:IFA_305,
    author={P. Grieder and M. Morari},
    title={{Complexity Reduction of Receding Horizon Control}},
    booktitle={IEEE Conference on Decision and Control},
    pages={3179--3184},
    year={2003},
    address={Maui, Hawaii},
    month=dec,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=305}
}
Permanent link