DocumentCode
1743558
Title
Efficient pruning of search trees in LQR control of switched linear systems
Author
Lincoln, Bo ; Bernhardsson, Bo
Author_Institution
Dept. of Autom. Control, Lund Inst. of Technol., Sweden
Volume
2
fYear
2000
fDate
2000
Firstpage
1828
Abstract
Considers off-line optimization of a switching sequence for a given finite set of linear control systems and joint optimization of control laws. A linear quadratic full information criterion is optimized and dynamic programming is used to find the optimal switching 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
Keywords
discrete time systems; dynamic programming; linear quadratic control; linear systems; sequences; time-varying systems; tree searching; LQR control; linear control systems; linear quadratic full information criterion; off-line optimization; optimal switching sequence; optimality; pruning; search trees; switched linear systems; Automatic control; Bluetooth; Communication system control; Control systems; Cost function; Feedback; Linear systems; Optimal control; Optimal scheduling; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
Conference_Location
Sydney, NSW
ISSN
0191-2216
Print_ISBN
0-7803-6638-7
Type
conf
DOI
10.1109/CDC.2000.912128
Filename
912128
Link To Document