文献类型：期刊文献

英文题名：Optimal scheduling of discrete-time switched linear systems

作者：Xu, Wei[1];Feng, Zhi Guo[2,3];Lin, Gui-Hua[1];Yu, Liying[1]

机构：[1]Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China;[2]Guangdong Ocean Univ, Fac Math & Comp Sci, Zhanjiang 524088, Guangdong, Peoples R China;[3]Chongqing Normal Univ, Coll Math Sci, Chongqing 401331, Peoples R China

年份：2020

卷号：37

期号：1

起止页码：1

外文期刊名：IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION

收录：SCI-EXPANDED(收录号：WOS:000536436000001)、、EI(收录号：20201308343508)、Scopus(收录号：2-s2.0-85082028095)、WOS

基金：National Natural Science Foundation of China (11431004, 11671250 and 61673078); Humanity and Social Science Foundation of Ministry of Education of China (15YJA630034); Chongqing Science and Technology Commission (cstc2017jcyjAX0161); Chongqing Normal University (17XLB010).

语种：英文

外文关键词：switched linear system; optimal scheduling; dynamical lower bound; branch and bound technique

外文摘要：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.