Abstract
This article focuses on the finite-time and prescribed-time cluster synchronization problems of switched complex networks with proportional delays. Considering that the matched controller often switches behind the switched systems, asynchronous switching law and switching parameters have been introduced to the complex dynamical networks. By applying the stability theory of dynamical systems and the average dwell time approach, some sufficient criteria in form of linear matrix inequalities have been developed to guarantee such networks finite/prescribed-time cluster synchronization under the pinning control scheme. Finally, one numerical example is presented to show the effectiveness of the theoretical results.
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
Disclaimer: 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.
