Reducing the Computational Cost of the Sum-of-Squares Stability Test for Time-Delayed Systems

被引:0
作者
Zhang, Yashun [1 ]
Peet, Matthew [2 ]
Gu, Keqin [3 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Automat, Nanjing, Peoples R China
[2] IIT, Dept Mech Mat & Aerosp, Chicago, IL 60616 USA
[3] Southern Illinois Univ, Dept Mech & Ind Engn, Edwardsville, IL USA
来源
2010 AMERICAN CONTROL CONFERENCE | 2010年
关键词
Lyapunov-Krasovskii; Time delay; Semidefinite programming; Sum-of-Squares; Complexity; EQUATIONS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the problem of reducing the computational complexity associated with the Sum-of-Squares approach to stability analysis of time-delay systems. Specifically, this paper considers systems with a large state-space but with relatively few delays-the most common situation in practice. The paper uses the general framework of coupled differential-difference equations with delays in low-dimensional feedback channels. This framework includes both the standard delayed and neutral-type systems. The approach is based on recent results which introduced a new type of Lyapunov-Krasovskii form which was shown to be necessary and sufficient for stability of this class of systems. This paper shows how exploiting the structure of the new functional can yield dramatic improvements in computational complexity. Numerical examples are given to illustrate this improvement.
引用
收藏
页码:5018 / 5023
页数:6
相关论文
共 20 条