Du är här

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

Författare:
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
Dokumenttyp: Konferensbidrag
Förlag: IEEE

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.

Disputation

Nyckelord

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

Övriga

Published
  • ISBN: 0-7803-6638-7

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

LERU logotype U21 logotype

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen