Abstract
We study the stability of an equilibrium of arbitrarily switched, autonomous, continuous-time systems through the computation of a clf. The switching occurs between a finite number of individual subsystems, each of which is assumed to be linear. We present a lp based approach to compute a cpa clf and compare this approach with different methods in the literature. In particular we compare it with the prevalent use of lmi and semidefinite optimization to parameterize a qclf for the linear subsystems.
| Original language | English |
|---|---|
| Pages (from-to) | 1 |
| Number of pages | 1 |
| Journal | IEEE Control Systems Letters |
| DOIs | |
| Publication status | Accepted/In press - 2022 |
Bibliographical note
Publisher Copyright:IEEE
Other keywords
- Common Lyapunov function
- Linear Matrix Inequalities
- Linear Programming
- Linear programming
- Linear systems
- Lyapunov methods
- Quantum cascade lasers
- Standards
- Switched systems
- Switched Systems
- Switches