Abstract
This letter proposes computational algorithms for analyzing conewise affine dynamical systems, where every neighborhood of the origin contains an affine mode. These algorithms are based on conewise linear Lyapunov functions. To make such algorithms useful, we present an algorithm to automatically search over partitions defining these conewise Linear functions. This algorithm is sound, although we present a counter-example to its completeness. We show that this approach verifies stability of 2D and 3D examples of conewise affine dynamical systems, including combinations of the harmonic and nonsmooth oscillators.
| Original language | English |
|---|---|
| Article number | 9302672 |
| Pages (from-to) | 2126-2131 |
| Number of pages | 6 |
| Journal | IEEE Control Systems Letters |
| Volume | 5 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 2021 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.
Funding
Manuscript received September 14, 2020; revised November 21, 2020; accepted December 6, 2020. Date of publication December 22, 2020; date of current version April 13, 2021. This work was supported by the Department of Mechanical Engineering at the University of Kentucky. Recommended by Senior Editor M. Arcak.
| Funders | Funder number |
|---|---|
| Department of Mechanical Engineering at the University of Kentucky |
Keywords
- Computational met23hods
- Lyapunov methods
- optimization
- switched systems
ASJC Scopus subject areas
- Control and Systems Engineering
- Control and Optimization