H ∞ Guaranteed Cost Computation for Uncertain Time-Delay Systems

摘要: This paper presents a less conservative approach to compute, with any prescribed accuracy, the H ∞ guaranteed cost of time-delay continuous-time linear time-invariant systems subjected polytopic uncertainties. The proposed analysis is based on branch-and-bound algorithm that incorporates recent LMI-based formulation and new polytope partition strategy. In algorithm, upper bound function defined as worst case disturbance attention level computed for subpolytopes achieved successive partitions which describes uncertainty domain. lower norm in subpolytope vertices. difference between functions converges zero initial split into smaller resulting whole required accuracy. It also presented an implement d−dimensional simplex subdivision technique be used algorithm.