Tratamiento Numérico del Problema LQR con Restricciones a través de la Actualización de la Fase Final (Numerical Treatment Of The Bounded-Control LQR Problem By Updating The Final Phase Value)

Vicente Costanza (, Pablo Santiago Rivadeneira (, John Anderson Gómez Múnera (

1Grupo de Sistemas No Lineales, INTEC (CONICET-UNL), Güemes 3450, 3000 Santa Fe

This paper appears in: Revista IEEE América Latina

Publication Date: June 2016
Volume: 14,   Issue: 6 
ISSN: 1548-0992

A novel approach has been developed for approximately solving the constrained LQR problem, based on updating the final state and costate of an unrestricted related regular problem, and the switching times (when the control meets the constraints). The main result is the expression of a suboptimal control in feedback form by using some corresponding Riccati equation. The gradient method is applied to reduce the cost via explicit algebraic formula for its partial derivatives with respect to the hidden final state/costate of the related regular problem. The numerical method results efficient because it does not involve integrations of states or cost trajectories and reduces the dimension of the relevant unknown parameters. All the relevant objects are calculated from a few auxiliary matrices, which are computed only once and kept in memory. The scheme is here applied to the “cheapest stop of a train” case-study whose optimal solution is already known.

Index Terms:
optimal control, restricted controls, LQR problem, gradient methods.   

Documents that cite this document
This function is not implemented yet.

[PDF Full-Text (416)]