Qualitative analysis of switched discrete-time descriptor systems

Guisheng Zhai, Xuping Xu, Joe Imae, Tomoaki Kobayashi

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

In this paper, we consider stability analysis and design for switched systems consisting of linear discrete-time descriptor subsystems. When all descriptor subsystems 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. We also extend the result to the case where all subsystems have different descriptor matrices. Under the same commutation condition, we show that in the case where none of the descriptor subsystems is stable, if there is a stable combination of the unstable descriptor subsystems, then we establish a class of switching laws which stabilize the switched descriptor system. All the results are natural but important extensions to the existing results for switched systems composed of state space subsystems.

Original languageEnglish
Pages (from-to)512-519
Number of pages8
JournalInternational Journal of Control, Automation and Systems
Volume7
Issue number4
DOIs
Publication statusPublished - 2009 Aug
Externally publishedYes

Fingerprint

Electric commutation

Keywords

  • Arbitrary switching
  • Discrete-time descriptor systems
  • Stability analysis
  • Stabilization
  • Stable combination
  • Switched systems

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications

Cite this

Qualitative analysis of switched discrete-time descriptor systems. / Zhai, Guisheng; Xu, Xuping; Imae, Joe; Kobayashi, Tomoaki.

In: International Journal of Control, Automation and Systems, Vol. 7, No. 4, 08.2009, p. 512-519.

Research output: Contribution to journalArticle

Zhai, Guisheng ; Xu, Xuping ; Imae, Joe ; Kobayashi, Tomoaki. / Qualitative analysis of switched discrete-time descriptor systems. In: International Journal of Control, Automation and Systems. 2009 ; Vol. 7, No. 4. pp. 512-519.
@article{bc4aff7e9ec540138600027319ce5350,
title = "Qualitative analysis of switched discrete-time descriptor systems",
abstract = "In this paper, we consider stability analysis and design for switched systems consisting of linear discrete-time descriptor subsystems. When all descriptor subsystems 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. We also extend the result to the case where all subsystems have different descriptor matrices. Under the same commutation condition, we show that in the case where none of the descriptor subsystems is stable, if there is a stable combination of the unstable descriptor subsystems, then we establish a class of switching laws which stabilize the switched descriptor system. All the results are natural but important extensions to the existing results for switched systems composed of state space subsystems.",
keywords = "Arbitrary switching, Discrete-time descriptor systems, Stability analysis, Stabilization, Stable combination, Switched systems",
author = "Guisheng Zhai and Xuping Xu and Joe Imae and Tomoaki Kobayashi",
year = "2009",
month = "8",
doi = "10.1007/s12555-009-0402-6",
language = "English",
volume = "7",
pages = "512--519",
journal = "International Journal of Control, Automation and Systems",
issn = "1598-6446",
publisher = "Institute of Control, Robotics and Systems",
number = "4",

}

TY - JOUR

T1 - Qualitative analysis of switched discrete-time descriptor systems

AU - Zhai, Guisheng

AU - Xu, Xuping

AU - Imae, Joe

AU - Kobayashi, Tomoaki

PY - 2009/8

Y1 - 2009/8

N2 - In this paper, we consider stability analysis and design for switched systems consisting of linear discrete-time descriptor subsystems. When all descriptor subsystems 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. We also extend the result to the case where all subsystems have different descriptor matrices. Under the same commutation condition, we show that in the case where none of the descriptor subsystems is stable, if there is a stable combination of the unstable descriptor subsystems, then we establish a class of switching laws which stabilize the switched descriptor system. All the results are natural but important extensions to the existing results for switched systems composed of state space subsystems.

AB - In this paper, we consider stability analysis and design for switched systems consisting of linear discrete-time descriptor subsystems. When all descriptor subsystems 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. We also extend the result to the case where all subsystems have different descriptor matrices. Under the same commutation condition, we show that in the case where none of the descriptor subsystems is stable, if there is a stable combination of the unstable descriptor subsystems, then we establish a class of switching laws which stabilize the switched descriptor system. All the results are natural but important extensions to the existing results for switched systems composed of state space subsystems.

KW - Arbitrary switching

KW - Discrete-time descriptor systems

KW - Stability analysis

KW - Stabilization

KW - Stable combination

KW - Switched systems

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

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

U2 - 10.1007/s12555-009-0402-6

DO - 10.1007/s12555-009-0402-6

M3 - Article

VL - 7

SP - 512

EP - 519

JO - International Journal of Control, Automation and Systems

JF - International Journal of Control, Automation and Systems

SN - 1598-6446

IS - 4

ER -