A computing capability test for a switched system control design using the Haris-Rogers method

Research output: Contribution to journalArticle

Abstract

The problem of finding stabilizing controllers for switched systems is an area of much research interest as conventional concepts from continuous time and discrete event dynamics do not hold true for these systems. Many solutions have been proposed, most of which are based on finding the existence of a common Lyapunov function (CLF) or a multiple Lyapunov function (MLF) where the key is to formulate the problem into a set of linear matrix inequalities (LMIs). An alternative method for finding the existence of a CLF by solving two sets of linear inequalities (LIs) has previously been presented. This method is seen to be less computationally taxing compared to methods based on solving LMIs. To substantiate this, the computational ability of three numerical computational solvers, LMI solver, cvx, and Yalmip, as well as the symbolic computational program Maple were tested. A specific switched system comprising four second-order subsystems was used as a test case. From the obtained solutions, the validity of the controllers and the corresponding CLF was verified. It was found that all tested solvers were able to correctly solve the LIs. The issue of rounding-off error in numerical computation based software is discussed in detail. The test revealed that the guarantee of stability became uncertain when the rounding off was at a different decimal precision. The use of different external solvers led to the same conclusion in terms of the stability of switched systems. As a result, a shift from using a conventional numerical computation based program to using computer algebra is suggested.

Original languageEnglish
Pages (from-to)781-792
Number of pages12
JournalJournal of Zhejiang University: Science C
Volume13
Issue number10
DOIs
Publication statusPublished - Oct 2012

Fingerprint

Lyapunov functions
Linear matrix inequalities
Control systems
Controllers
Algebra

Keywords

  • Common quadratic Lyapunov function
  • Hybrid systems
  • Linear inequalities
  • Numerical computation
  • Stability
  • Symbolic computation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{f167d2be2dea46baa873d2e6dc935215,
title = "A computing capability test for a switched system control design using the Haris-Rogers method",
abstract = "The problem of finding stabilizing controllers for switched systems is an area of much research interest as conventional concepts from continuous time and discrete event dynamics do not hold true for these systems. Many solutions have been proposed, most of which are based on finding the existence of a common Lyapunov function (CLF) or a multiple Lyapunov function (MLF) where the key is to formulate the problem into a set of linear matrix inequalities (LMIs). An alternative method for finding the existence of a CLF by solving two sets of linear inequalities (LIs) has previously been presented. This method is seen to be less computationally taxing compared to methods based on solving LMIs. To substantiate this, the computational ability of three numerical computational solvers, LMI solver, cvx, and Yalmip, as well as the symbolic computational program Maple were tested. A specific switched system comprising four second-order subsystems was used as a test case. From the obtained solutions, the validity of the controllers and the corresponding CLF was verified. It was found that all tested solvers were able to correctly solve the LIs. The issue of rounding-off error in numerical computation based software is discussed in detail. The test revealed that the guarantee of stability became uncertain when the rounding off was at a different decimal precision. The use of different external solvers led to the same conclusion in terms of the stability of switched systems. As a result, a shift from using a conventional numerical computation based program to using computer algebra is suggested.",
keywords = "Common quadratic Lyapunov function, Hybrid systems, Linear inequalities, Numerical computation, Stability, Symbolic computation",
author = "At-Tasneem, {Mohd Amin} and {Mohamed Haris}, Sallehuddin and {Mohd Nopiah}, Zulkifli",
year = "2012",
month = "10",
doi = "10.1631/jzus.C1200074",
language = "English",
volume = "13",
pages = "781--792",
journal = "Frontiers of Information Technology and Electronic Engineering",
issn = "2095-9184",
publisher = "Springer Science + Business Media",
number = "10",

}

TY - JOUR

T1 - A computing capability test for a switched system control design using the Haris-Rogers method

AU - At-Tasneem, Mohd Amin

AU - Mohamed Haris, Sallehuddin

AU - Mohd Nopiah, Zulkifli

PY - 2012/10

Y1 - 2012/10

N2 - The problem of finding stabilizing controllers for switched systems is an area of much research interest as conventional concepts from continuous time and discrete event dynamics do not hold true for these systems. Many solutions have been proposed, most of which are based on finding the existence of a common Lyapunov function (CLF) or a multiple Lyapunov function (MLF) where the key is to formulate the problem into a set of linear matrix inequalities (LMIs). An alternative method for finding the existence of a CLF by solving two sets of linear inequalities (LIs) has previously been presented. This method is seen to be less computationally taxing compared to methods based on solving LMIs. To substantiate this, the computational ability of three numerical computational solvers, LMI solver, cvx, and Yalmip, as well as the symbolic computational program Maple were tested. A specific switched system comprising four second-order subsystems was used as a test case. From the obtained solutions, the validity of the controllers and the corresponding CLF was verified. It was found that all tested solvers were able to correctly solve the LIs. The issue of rounding-off error in numerical computation based software is discussed in detail. The test revealed that the guarantee of stability became uncertain when the rounding off was at a different decimal precision. The use of different external solvers led to the same conclusion in terms of the stability of switched systems. As a result, a shift from using a conventional numerical computation based program to using computer algebra is suggested.

AB - The problem of finding stabilizing controllers for switched systems is an area of much research interest as conventional concepts from continuous time and discrete event dynamics do not hold true for these systems. Many solutions have been proposed, most of which are based on finding the existence of a common Lyapunov function (CLF) or a multiple Lyapunov function (MLF) where the key is to formulate the problem into a set of linear matrix inequalities (LMIs). An alternative method for finding the existence of a CLF by solving two sets of linear inequalities (LIs) has previously been presented. This method is seen to be less computationally taxing compared to methods based on solving LMIs. To substantiate this, the computational ability of three numerical computational solvers, LMI solver, cvx, and Yalmip, as well as the symbolic computational program Maple were tested. A specific switched system comprising four second-order subsystems was used as a test case. From the obtained solutions, the validity of the controllers and the corresponding CLF was verified. It was found that all tested solvers were able to correctly solve the LIs. The issue of rounding-off error in numerical computation based software is discussed in detail. The test revealed that the guarantee of stability became uncertain when the rounding off was at a different decimal precision. The use of different external solvers led to the same conclusion in terms of the stability of switched systems. As a result, a shift from using a conventional numerical computation based program to using computer algebra is suggested.

KW - Common quadratic Lyapunov function

KW - Hybrid systems

KW - Linear inequalities

KW - Numerical computation

KW - Stability

KW - Symbolic computation

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

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

U2 - 10.1631/jzus.C1200074

DO - 10.1631/jzus.C1200074

M3 - Article

AN - SCOPUS:84870881168

VL - 13

SP - 781

EP - 792

JO - Frontiers of Information Technology and Electronic Engineering

JF - Frontiers of Information Technology and Electronic Engineering

SN - 2095-9184

IS - 10

ER -