Abstract
This paper considers the global exponential stabilizability (GES) of a switched linear system under language constraints, which can be described by a nondeterministic finite state automaton. Firstly, the automaton is represented as a labeled diagraph to reduce the problem to the GES analysis in strongly connected components. Secondly, we analysis the properties of the lifted labeled diagraph, which can express the dwell time constraints intuitively. Based on the lifted labeled diagraph, we generalize the Lyapunov-Metzler condition to an M-step version, and propose a less conservative condition based on S-procedure. Finally, a numerical example is provided to demonstrate the S-procedure condition.
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.
