Path-complete positivity of switching systems

Forni, F;Jungers, Raphaël;Sepulchre, R
(2017) IFAC WORLD CONGRESS — Location: Toulouse (9.July.2017)

Files

161102603.pdf
  • Open Access
  • Adobe PDF
  • 334.03 KB
Download

Details

Authors
  • Forni, FUniversity of Cambridge, United Kingdom
    Author
  • Jungers, RaphaëlUCLouvain
    Author
  • Sepulchre, RUniversity of Cambridge, United Kingdom
    Author
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 positivy
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Forni, F., Jungers, R., & Sepulchre, R. (2017). Path-complete positivity of switching systems. IFAC Proceedings, 50(1), 4558-4563. https://hdl.handle.net/2078.5/51685 (Original work published 2017)