Optimal scheduling of discrete-time switched linear systems. (11th September 2018)

• Record Type: Journal Article
• Authors: Xu, Wei; Feng, Zhi Guo; Lin, Gui-Hua; Yu, Liying
• Is Part Of: IMA journal of mathematical control and information. Volume 37:Number 1(2020)
• Page Start: 1
• Page End: 18
• Publication Date: 2018-09-11
• Subjects: switched linear system -- optimal scheduling -- dynamical lower bound -- branch and bound technique; Control theory -- Periodicals; 629.831205
• DOI: 10.1093/imamci/dny034
• Languages: English
• ISSNs: 0265-0754

Abstract

Abstract: This paper considers a discrete-time optimal scheduling problem for switched linear systems. In order to exactly find the global optimal solution, we study the relation between the linear dynamic system and the matrix trace. Then a new dynamical lower bound of the cost functional is constructed for all possible switching signals at each period. Compared with the current optimal value treated as an upper bound, the lower bound can prune a lot of unnecessary branches which can accelerate the searching process. So a depth-first branch and bound technique is explored to exactly obtain the global optimal scheduling sequence. Some numerical experiments and applications are provided to support the efficiency and effectiveness of the method.