Premium
Optimal partitioning method for stability analysis of continuous/discrete delay systems
Author(s) -
Feng Zhiguang,
Lam James,
Yang GuangHong
Publication year - 2013
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.3106
Subject(s) - interval (graph theory) , stability (learning theory) , regular polygon , basis (linear algebra) , linear matrix inequality , computer science , mathematics , matrix (chemical analysis) , convex optimization , discrete time and continuous time , mathematical optimization , control theory (sociology) , control (management) , statistics , materials science , geometry , combinatorics , machine learning , artificial intelligence , composite material
Summary This paper is concerned with the problem of stability analysis for continuous‐time/discrete‐time systems with interval time‐varying delay. Based on the idea of partitioning the delay interval into l nonuniform subintervals, new Lyapunov functionals are established. By utilizing the reciprocally convex approach to deal with the delay information in each subinterval, sufficient stability conditions are proposed in terms of linear matrix inequalities. Based on these criteria, the optimal partitioning method is given on the basis of the genetic algorithm. Finally, the reduced conservatism of the results in this paper is illustrated by numerical examples. Copyright © 2013 John Wiley & Sons, Ltd.