Abstract
In this paper, the stabilizability of discrete-time linear switched systems subject to constraints on the switching law is considered. The admissible switching sequences are given by the language generated by a nondeterministic finite state automaton. An algorithm is proposed for computing contractive sets defined in the space of the continuous and finite states that induce recurrent exponential control Lyapunov functions for the system. A necessary and sufficient condition for the existence of recurrent control Lyapunov functions is given in terms of finite termination of the algorithm.
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.
