LQR optimization of linear system switching

Considers offline optimization of a switching sequence for a given finite set of linear control systems, together with joint optimization of control laws. A linear quadratic full information criterion is optimized and dynamic programming is used to find an optimal switching sequence and control law....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control 2002-10, Vol.47 (10), p.1701-1705
Hauptverfasser:	Lincoln, B., Bernhardsson, B.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Automatic control Bluetooth Combinatorial analysis Communication system control Computer science control theory systems Control Engineering Control systems Control theory. Systems Costs Covariance matrix Dynamical systems Electrical Engineering, Electronic Engineering, Information Engineering Elektroteknik och elektronik Engineering and Technology Exact sciences and technology Explosions Hybrid systems Laws Linear systems Optimal control Optimization Pruning Reglerteknik scheduling Searching Switches Switching sequences Teknik
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Considers offline optimization of a switching sequence for a given finite set of linear control systems, together with joint optimization of control laws. A linear quadratic full information criterion is optimized and dynamic programming is used to find an optimal switching sequence and control law. The main result is a method for efficient pruning of the search tree to avoid combinatoric explosion. A method to prove optimality of a found candidate switch sequence and corresponding control laws is presented.
ISSN:	0018-9286 1558-2523
DOI:	10.1109/TAC.2002.803539