CUED Publications database

Path-complete $p$-dominant switching linear systems

Berger, GO and Forni, F and Jungers, RM Path-complete $p$-dominant switching linear systems. In: IEEE Conference on Decision and Control, 2018-12-16 to --. (Unpublished)

Full text not available from this repository.


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.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Uncontrolled Keywords: math.OC math.OC 93C30, 93C05, 93C83
Divisions: Div F > Control
Depositing User: Unnamed user with email
Date Deposited: 12 Sep 2018 20:18
Last Modified: 09 Sep 2021 03:01