Path-complete positivity of switching systems
Systems and Control
2016-11-09 v1 Dynamical Systems
Optimization and Control
Abstract
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.
Cite
@article{arxiv.1611.02603,
title = {Path-complete positivity of switching systems},
author = {Fulvio Forni and Raphael M. Jungers and Rodolphe Sepulchre},
journal= {arXiv preprint arXiv:1611.02603},
year = {2016}
}
Comments
7 pages