Efficient Pruning of Search Trees in LQR Control of Switched Linear Systems

Bo Lincoln, Bo Bernhardsson

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

242 Nedladdningar (Pure)

Sammanfattning

This paper considers off-line optimization of a switching sequence fora given finite set of linear control systems and joint optimization ofcontrol laws. A linear quadratic full information criterion isoptimized and dynamic programming is used to find the optimalswitching sequence and control laws. 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.
Originalspråkengelska
Titel på värdpublikationProceedings of the 39th IEEE Conference on Decision and Control, 2000.
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor1828-1832
Volym2
ISBN (tryckt)0-7803-6638-7
DOI
StatusPublished - 2000

Publikationsserier

Namn
Volym2

Ämnesklassifikation (UKÄ)

  • Reglerteknik

Fingeravtryck

Utforska forskningsämnen för ”Efficient Pruning of Search Trees in LQR Control of Switched Linear Systems”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här