Path-Complete p-Dominant Switching Linear Systems
Proceedings of the IEEE Conference on Decision and Control
2018 IEEE Conference on Decision and Control (CDC)
MetadataShow full item record
Berger, G., Forni, F., & Jungers, R. (2018). Path-Complete p-Dominant Switching Linear Systems. Proceedings of the IEEE Conference on Decision and Control, 2018-December 6446-6451. https://doi.org/10.1109/CDC.2018.8619703
The notion of path-complete $p$-dominance for switching linear systems (in short, path-dominance) is introduced as a way to generalize the notion of dominant/slow modes for LTI systems. Path-dominance is characterized by the contraction property of a set of quadratic cones in the state space. We show that path-dominant systems have a low-dimensional dominant behavior, and hence allow for a simplified analysis of their dynamics. An algorithm for deciding the path-dominance of a given system is presented.
External DOI: https://doi.org/10.1109/CDC.2018.8619703
This record's URL: https://www.repository.cam.ac.uk/handle/1810/288225