Efficient Pruning of Search Trees in LQR Control of Switched Linear Systems
Författare
Summary, in English
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.
Avdelning/ar
Publiceringsår
2000
Språk
Engelska
Sidor
1828-1832
Publikation/Tidskrift/Serie
Proceedings of the 39th IEEE Conference on Decision and Control, 2000.
Volym
2
Fulltext
- Available as PDF - 489 kB
- Download statistics
Dokumenttyp
Konferensbidrag
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Control Engineering
Nyckelord
- discrete time systems
- time-varying systems
- tree searching
- dynamic programming
- linear quadratic control
- linear systems
- sequences
Status
Published
ISBN/ISSN/Övrigt
- ISBN: 0-7803-6638-7