Abstract
This paper 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 |
---|---|
Title of host publication | 2021 American Control Conference, ACC 2021 |
Pages | 2406-2411 |
Number of pages | 6 |
ISBN (Electronic) | 9781665441971 |
DOIs | |
State | Published - May 25 2021 |
Event | 2021 American Control Conference, ACC 2021 - Virtual, New Orleans, United States Duration: May 25 2021 → May 28 2021 |
Publication series
Name | Proceedings of the American Control Conference |
---|---|
Volume | 2021-May |
ISSN (Print) | 0743-1619 |
Conference
Conference | 2021 American Control Conference, ACC 2021 |
---|---|
Country/Territory | United States |
City | Virtual, New Orleans |
Period | 5/25/21 → 5/28/21 |
Bibliographical note
Publisher Copyright:© 2021 American Automatic Control Council.
ASJC Scopus subject areas
- Electrical and Electronic Engineering