Abstract
This paper addresses on the robust exponential admissibility of uncertain switched descriptor systems with time-varying delays. Firstly, an easily verified condition is presented to check the switching-impulsive-free which ensures the consistent of algebraic equations. Moreover, a novel type of piecewise Lyapunov functions which are decreasing at switching times is introduced. This type of delicately constructed Lyapunov functions can efficiently eliminate the switching jump of adjacent Lyapunov functions at switching instants. By this type of Lyapunov functions and Razumikhin-type technique, the delay-independent minimum dwell time criteria of robust exponential admissibility are established under switching-impulsive-free. Two illustrative numerical examples are presented to show the effectiveness of the obtained theoretical results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
