Path-complete $p$-dominant switching linear systems
Optimization and Control
2018-08-30 v1
Abstract
The notion of path-complete -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.
Cite
@article{arxiv.1808.09757,
title = {Path-complete $p$-dominant switching linear systems},
author = {Guillaume O. Berger and Fulvio Forni and Raphaël M. Jungers},
journal= {arXiv preprint arXiv:1808.09757},
year = {2018}
}
Comments
6 pages, 5 figures, to be presented at IEEE Conference on Decision and Control 2018