The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

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.

Publishing year

2000

Language

English

Pages

1828-1832

Publication/Series

Proceedings of the 39th IEEE Conference on Decision and Control, 2000.

Volume

2

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Control Engineering

Keywords

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

Status

Published

ISBN/ISSN/Other

  • ISBN: 0-7803-6638-7