Abstract
This paper presents a unified perspective for geometric and algebraic criteria for the reachability and controllability of switched linear systems. The direct connection between the geometric and algebraic criterion is established as well as that between the subspace algorithm for controllability/reachability and other algebraic criterion. In particular, we investigate the reachability realization problem for a class of controlled switched linear discrete-time systems. Both aperiodic and periodic switching sequences are designed to solve the problem.
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.
