Abstract
In this paper, we show that a fast switch is able to lead a complex dynamical system to being asymptotically stable, although this system is completely unstable in every switch duration and even the associated connection matrices are randomly selected. Importantly, we define some new exponents by which we can figure out the essential patterns that guarantee the stability of fast switching systems, and besides, their calculations need little computational cost. More interestingly, we show the efficiency of some random switches in inducing stability through a comparison of the systems with different switch connection matrices and switch durations, and we give a design method for obtaining higher efficient random switch rules. We also investigate the generalization of the obtained results to a more realistic case where the switch obeys some renewal process.
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.
