Linear-quadratic discrete-time control and constant directions

David J. Clements*, Brian D.O. Anderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

The general linear-quadratic discrete-time minimization problem is studied, in which no restrictions are placed on the singularity or otherwise of certain matrices, or the appearance of cross-product terms in the performance indices. Constant directions are characterized in a number of ways, and an algorithm is presented for replacing a prescribed problem with constant directions by one of lower state and/or control dimension, lacking constant directions. The replacement is achieved using a series of state and input co-ordinate basis changes, and allows simplification of the calculations obtaining the optimal control law and performance index of the original problem.

Original languageEnglish
Pages (from-to)255-264
Number of pages10
JournalAutomatica
Volume13
Issue number3
DOIs
Publication statusPublished - May 1977
Externally publishedYes

Fingerprint

Dive into the research topics of 'Linear-quadratic discrete-time control and constant directions'. Together they form a unique fingerprint.

Cite this