CUED Publications database

Path-complete positivity of switching systems

Forni, F and Jungers, RM and Sepulchre, R (2017) Path-complete positivity of switching systems. In: UNSPECIFIED pp. 4558-4563..

Full text not available from this repository.


The notion of path-complete positivity is introduced as a way to generalize the property of positivity from one LTI system to a family of switched LTI systems whose switching rule is constrained by a finite automaton. The generalization builds upon the analogy between stability and positivity, the former referring to the contraction of a norm, the latter referring to the contraction of a cone (or, equivalently, a projective norm). We motivate and investigate the potential of path-positivity and we propose an algorithm for the automatic verification of positivity.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Uncontrolled Keywords: positivity path-complete lyapunov functions switching systems monotonicity perron-frobenius theory
Divisions: Div F > Control
Depositing User: Unnamed user with email
Date Deposited: 02 Aug 2017 20:13
Last Modified: 09 Sep 2021 03:01
DOI: 10.1016/j.ifacol.2017.08.731