Efficient Pruning of Search Trees in LQR Control of Switched Linear Systems
(2000) 2. p.1828-1832- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/537984
- author
- Lincoln, Bo
LU
and Bernhardsson, Bo
LU
- organization
- publishing date
- 2000
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- discrete time systems, time-varying systems, tree searching, dynamic programming, linear quadratic control, linear systems, sequences
- host publication
- Proceedings of the 39th IEEE Conference on Decision and Control, 2000.
- volume
- 2
- pages
- 1828 - 1832
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:0034440076
- ISBN
- 0-7803-6638-7
- DOI
- 10.1109/CDC.2000.912128
- language
- English
- LU publication?
- yes
- id
- 2fdabcbb-5e29-4611-889f-c829b2dba193 (old id 537984)
- date added to LUP
- 2016-04-04 12:21:15
- date last changed
- 2025-10-14 13:09:55
@inproceedings{2fdabcbb-5e29-4611-889f-c829b2dba193,
abstract = {{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.}},
author = {{Lincoln, Bo and Bernhardsson, Bo}},
booktitle = {{Proceedings of the 39th IEEE Conference on Decision and Control, 2000.}},
isbn = {{0-7803-6638-7}},
keywords = {{discrete time systems; time-varying systems; tree searching; dynamic programming; linear quadratic control; linear systems; sequences}},
language = {{eng}},
pages = {{1828--1832}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Efficient Pruning of Search Trees in LQR Control of Switched Linear Systems}},
url = {{https://lup.lub.lu.se/search/files/5985636/625729.pdf}},
doi = {{10.1109/CDC.2000.912128}},
volume = {{2}},
year = {{2000}},
}