Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6421523 | Applied Mathematics and Computation | 2013 | 9 Pages |
Abstract
We address the reachable set bounding problem of linear systems subject to both time-varying delay and polytopic uncertainties. A novel criterion is established to give a more accurate description of the set which bounds the states starting from the origin by inputs with peak values. By combining the maximal Lyapunov functional and the reciprocally convex approach, we obtain a tighter reachable set estimation with lower computational complexity. The corresponding reachable set condition for the common Lyapunov functional can be obtained naturally as a special case of the above result. Finally, two examples illustrate the advantages of our proposed method.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhiqiang Zuo, Youhua Fu, Yinping Chen, Yijing Wang,