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.


Computation of the Constrained Infinite Time Linear Quadratic Regulator


P. Grieder, F. Borrelli, F.D. Torrisi, M. Morari

American Control Conference, Denver, Colorado, pp. 4711-4716

This paper presents an efficient algorithm for computing the solution to the constrained infinite time linear quadratic regulator (CLQR) problem for discrete time systems. The algorithm combines multi-parametric quadratic programming with reachability analysis to obtain the optimal piecewise affine (PWA) feedback law. The algorithm reduces the time necessary to compute the PWA solution for the CLQR when compared to other approaches. It also determines the minimal finite horizon N_S, such that the constrained finite horizon LQR problem equals the CLQR problem for a compact set of states S. The on-line computational effort for the implementation of the CLQR can be significantly reduced as well, either by evaluating the PWA solution or by solving the finite dimensional quadratic program associated with the CLQR for a horizon of N=N_S.

Further Information

Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { GriEtal:2003:IFA_141,
    author={P. Grieder and F. Borrelli and F.D. Torrisi and M. Morari},
    title={{Computation of the Constrained Infinite Time Linear
	  Quadratic Regulator}},
    booktitle={American Control Conference},
    address={Denver, Colorado},
Permanent link