This study provides an alternative approach to stability analysis of positive switched descriptor systems (SDSs). First, by introducing a Drazin-inverse-based projector which takes a simpler form than the traditional matrix-decomposition-based ones, the state consistency of SDSs is guaranteed. Then, regarding the fact that SDSs may not be positive even if all individual subsystems are positive, two different definitions of positivity are introduced and a complete characterisation is provided. The stability issue is also addressed and two checkable approaches are proposed, which are formulated as a set of linear matrix inequality problems and linear programming problems, respectively.
ASJC Scopus subject areas
- コンピュータ サイエンスの応用