Stability analysis and design for switched descriptor systems

Guisheng Zhai, Ryuuen Kou, Joe Imae, Tomoaki Kobayashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationIEEE International Symposium on Intelligent Control - Proceedings
Pages482-487
Number of pages6
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventJoint 2006 IEEE Conference on Control Applications (CCA), Computer-Aided Control Systems Design Symposium (CACSD) and International Symposium on Intelligent Control (ISIC) - Munich
Duration: 2006 Oct 42006 Oct 6

Other

OtherJoint 2006 IEEE Conference on Control Applications (CCA), Computer-Aided Control Systems Design Symposium (CACSD) and International Symposium on Intelligent Control (ISIC)
CityMunich
Period06/10/406/10/6

Fingerprint

Electric commutation
Linear systems

Keywords

  • Arbitrary switching
  • Commutation
  • Convex combination
  • Descriptor systems
  • Stability analysis
  • Stabilization
  • Switched systems

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Modelling and Simulation

Cite this

Zhai, G., Kou, R., Imae, J., & Kobayashi, T. (2006). Stability analysis and design for switched descriptor systems. In IEEE International Symposium on Intelligent Control - Proceedings (pp. 482-487). [4064924] https://doi.org/10.1109/ISIC.2006.285599

Stability analysis and design for switched descriptor systems. / Zhai, Guisheng; Kou, Ryuuen; Imae, Joe; Kobayashi, Tomoaki.

IEEE International Symposium on Intelligent Control - Proceedings. 2006. p. 482-487 4064924.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhai, G, Kou, R, Imae, J & Kobayashi, T 2006, Stability analysis and design for switched descriptor systems. in IEEE International Symposium on Intelligent Control - Proceedings., 4064924, pp. 482-487, Joint 2006 IEEE Conference on Control Applications (CCA), Computer-Aided Control Systems Design Symposium (CACSD) and International Symposium on Intelligent Control (ISIC), Munich, 06/10/4. https://doi.org/10.1109/ISIC.2006.285599
Zhai G, Kou R, Imae J, Kobayashi T. Stability analysis and design for switched descriptor systems. In IEEE International Symposium on Intelligent Control - Proceedings. 2006. p. 482-487. 4064924 https://doi.org/10.1109/ISIC.2006.285599
Zhai, Guisheng ; Kou, Ryuuen ; Imae, Joe ; Kobayashi, Tomoaki. / Stability analysis and design for switched descriptor systems. IEEE International Symposium on Intelligent Control - Proceedings. 2006. pp. 482-487
@inproceedings{c876f779368e4287ba3bd41eb3f6cc42,
title = "Stability analysis and design for switched descriptor systems",
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.",
keywords = "Arbitrary switching, Commutation, Convex combination, Descriptor systems, Stability analysis, Stabilization, Switched systems",
author = "Guisheng Zhai and Ryuuen Kou and Joe Imae and Tomoaki Kobayashi",
year = "2006",
doi = "10.1109/ISIC.2006.285599",
language = "English",
isbn = "0780397983",
pages = "482--487",
booktitle = "IEEE International Symposium on Intelligent Control - Proceedings",

}

TY - GEN

T1 - Stability analysis and design for switched descriptor systems

AU - Zhai, Guisheng

AU - Kou, Ryuuen

AU - Imae, Joe

AU - Kobayashi, Tomoaki

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Arbitrary switching

KW - Commutation

KW - Convex combination

KW - Descriptor systems

KW - Stability analysis

KW - Stabilization

KW - Switched systems

UR - http://www.scopus.com/inward/record.url?scp=41149088306&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=41149088306&partnerID=8YFLogxK

U2 - 10.1109/ISIC.2006.285599

DO - 10.1109/ISIC.2006.285599

M3 - Conference contribution

AN - SCOPUS:41149088306

SN - 0780397983

SN - 9780780397989

SP - 482

EP - 487

BT - IEEE International Symposium on Intelligent Control - Proceedings

ER -