Efficient pruning of search trees in LQR control of switched linear systems
- 1 January 2000
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1828-1833
- https://doi.org/10.1109/cdc.2000.912128
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 presentedKeywords
This publication has 7 references indexed in Scilit:
- Optimal measurement scheduling in linear quadratic Gaussian control problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal controller switching for stochastic systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Stabilization of motor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling of a limited communication channel for optimal controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Limited communication controlSystems & Control Letters, 1999
- Stability analysis of networked control systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- BluetoothACM SIGMOBILE Mobile Computing and Communications Review, 1998