Abstract
In this paper, two reachability properties for single-input positive switched systems are introduced: monomial reachability and reachability. Monomial reachability, which represents a necessary but not sufficient condition for reachability, is fully characterized. Necessary and sufficient conditions for reachability are provided for the class of n-dimensional systems, switching among n subsystems. Several necessary or sufficient conditions are also provided. Moreover, the definition of k-switching reachability set is given, and an equivalent condition for the existence of an upper bound on the number of switchings required to reach any reachable vector is given. Finally, it is shown that, for reachable systems of low dimension (n = 2 or n = 3), each vector of the positive orthant can be reached by resorting to a switching sequence which switches no more than n - 1 times.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
