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

Bo Lincoln, Bo Bernhardsson

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

242 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationProceedings of the 39th IEEE Conference on Decision and Control, 2000.
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (Print)0-7803-6638-7
Publication statusPublished - 2000

Publication series


Subject classification (UKÄ)

  • Control Engineering

Free keywords

  • discrete time systems
  • time-varying systems
  • tree searching
  • dynamic programming
  • linear quadratic control
  • linear systems
  • sequences


Dive into the research topics of 'Efficient Pruning of Search Trees in LQR Control of Switched Linear Systems'. Together they form a unique fingerprint.

Cite this