Abstract

In this paper, we consider stability analysis and design for switched systems consisting of linear descriptor systems that have the same descriptor matrix. When all descriptor systems are stable, we show that if the descriptor matrix and all the subsystem matrices are commutative pairwise, then the switched system is stable under arbitrary switching. This is an extension of the existing well known result in [1] for switched linear systems with state space models to switched descriptor systems. Under the same commutation condition, we also show that in the case where all the descriptor systems are not stable, if there is a stable convex combination of the unstable descriptor systems, then we can establish a class of switching laws which stabilize the switched system.

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 call

Disclaimer: 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.