Improved results on reachable set bounding for linear systems with discrete and distributed delays

Advances in Difference Equations

Wei Kang¹  Shouming Zhong²  Hao Chen³  Jun Cheng⁴  Jinxiang Yang⁴ 

[1] School of Computer Science and Technology, Southwest University for Nationalities, Chengdu, P.R. China;School of Electrical and Information Technology, Yunnan Minzu University, Kunming, P.R. China;School of Mathematical Sciences, Huaibei Normal University, Huaibei, P.R. China;School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, P.R. China

关键词: reachable set;    distributed delay;    Lyapunov-Krasovskii functional;    linear matrix inequality;   

DOI  :  10.1186/s13662-015-0479-6

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

This paper investigates the bound of a reachable set for linear systems with discrete and distributed delays. By utilizing the Lyapunov-Krasovskii functional, delay decomposition technique, reciprocally convex method and free-weighting matrix approach, some new results in the form of linear matrix inequalities are derived. Finally, a tighter bound of the reachable set is obtained. Three numerical examples are given to illustrate the effectiveness and advantage of the proposed results compared with the existing criteria.

【 授权许可】

CC BY