z-logo
open-access-imgOpen Access
Finite-Time Stability Analysis for a Class of Continuous Switched Descriptor Systems
Author(s) -
Tinglong Pan,
Kun Yang,
Shen Yanxia,
Gao Zai-rui,
Zhicheng Ji
Publication year - 2014
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2014/979130
Subject(s) - dwell time , mathematics , control theory (sociology) , stability (learning theory) , bounded function , exponential stability , class (philosophy) , lyapunov function , interval (graph theory) , state (computer science) , computer science , control (management) , mathematical analysis , nonlinear system , algorithm , medicine , clinical psychology , physics , quantum mechanics , artificial intelligence , machine learning , combinatorics
Finite-time stability has more practical application values than the classical Lyapunov asymptotic stability over a fixed finite-time interval. The problems of finite-time stability and finite-time boundedness for a class of continuous switched descriptor systems are considered in this paper. Based on the average dwell time approach and the multiple Lyapunov functions technique, the concepts of finite-time stability and boundedness are extended to continuous switched descriptor systems. In addition, sufficient conditions for the existence of state feedback controllers in terms of linear matrix inequalities (LMIs) are obtained with arbitrary switching rules, which guarantee that the switched descriptor system is finite-time stable and finite-time bounded, respectively. Finally, two numerical examples are presented to illustrate the reasonableness and effectiveness of the proposed results

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom