Abstract
In this note, an improved method of ultimate bound computation for a linear switched system under arbitrary switching is presented. An ultimate bound for a linear switched system can be computed by solving a class of linear matrix inequalities. The effectiveness of the obtained results is illustrated by numerical examples.
Original language | English |
---|---|
Pages (from-to) | 148-152 |
Number of pages | 5 |
Journal | Automatica |
Volume | 70 |
DOIs | |
Publication status | Published - 1 Aug 2016 |
Externally published | Yes |