Abstract
Persistent dwell-time (PDT) constraint is demonstrated to be powerful for modeling the dynamics of switched systems with nonuniform time-dependent scheduling constraints. However, the study of switched systems under PDT constraints presently struggles to provide nonconservative and convex stability conditions for stabilization. In this article, we present a novel concept called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">dictionary</i> to precisely characterize PDT constraints. It outperforms the existing methods for PDT constraints, which undesirably involve inadmissible or redundant switching sequences. By building an advanced dictionary equivalent to any concerned PDT constraint, we develop a nonconservative stability criterion, which is further lifted to preserve convexity. Two numerical examples verify the derived theories.
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.
