Improved robust stability criteria for uncertain discrete-time systems with interval time-varying delays via new zero equalities

2012 ◽  
Vol 6 (16) ◽  
pp. 2567-2575 ◽  
Author(s):  
O.M. Kwon ◽  
J.H. Park ◽  
S.M. Lee ◽  
E.J. Cha ◽  
M.J. Park
Keyword(s):  
Robust Stability ◽  
Discrete Time ◽  
Time Varying ◽  
Stability Criteria ◽  
Interval Time ◽  
Discrete Time Systems ◽  
Time Systems

scholarly journals New Delay-Dependent Robust Stability Criterion for LPD Discrete-Time Systems with Interval Time-Varying Delays

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Narongsak Yotha ◽  
Kanit Mukdasai
Keyword(s):  
Robust Stability ◽  
Discrete Time ◽  
Model Transformation ◽  
Linear Matrix ◽  
Time Varying ◽  
Interval Time ◽  
Discrete Time Systems ◽  
Delay Dependent ◽  
Parameter Dependent ◽  
Time Systems

This paper investigates the problem of robust stability for linear parameter-dependent (LPD) discrete-time systems with interval time-varying delays. Based on the combination of model transformation, utilization of zero equation, and parameter-dependent Lyapunov-Krasovskii functional, new delay-dependent robust stability conditions are obtained and formulated in terms of linear matrix inequalities (LMIs). Numerical examples are given to demonstrate the effectiveness and less conservativeness of the proposed methods.

scholarly journals Partitioning Technique for Relaxed Stability Criteria of Discrete-Time Systems with Interval Time-Varying Delay

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Kuang-Yow Lian ◽  
Wen-Tsung Yang ◽  
Peter Liu
Keyword(s):  
Lyapunov Function ◽  
Discrete Time ◽  
Time Varying ◽  
Stability Criteria ◽  
Discrete Time System ◽  
Interval Time ◽  
Time Varying Delay ◽  
Discrete Time Systems ◽  
Time Systems ◽  
Varying Delay

We demonstrate an improved stability analysis based on a partition oriented technique for discrete-time systems with interval time-varying delay. The partition oriented technique introduces beneficial terms contributing to the negative definiteness of the Lyapunov function difference, meanwhile completely avoiding traditional inequality based approaches. In contrast, nonpartitioning oriented techniques do not put emphasis on further dividing the interval of the summation in the Lyapunov function. Herein, we demonstrate that the advantages of exploiting partitioning techniques manifest the relaxed stability criteria, as well as the flexibility to tune tradeoff between allowable timedelay range performance and computational load. Simulation carried out on a benchmark discrete-time system reveals the significant improvement in terms of maximum allowable upper bound in comparison.

Sign in / Sign up

Export Citation Format

Share Document