{"title":"Event-based Bipartite Synchronization of Nonlinear Dynamical Networks With Sampled Data","authors":"Kwaku Ayepah, Mei Sun, Q. Jia","doi":"10.1109/ISPCE-ASIA57917.2022.9970977","DOIUrl":null,"url":null,"abstract":"This research examines the bipartite synchronization of dynamical network with switching signed topologies, where the nodes are governed by certain nonlinear dynamics, and an event-triggered control strategy is applied by under periodic sampling communications. It is shown that when the topologies switch within a finite set of signed graph, all nodes are guaranteed to achieve bipartite synchronization if the time average of the algebraic connectivity of the corresponding unsigned graph over certain length of time is large enough, and the main theorem details the impacts of nodal dynamics, network structure on synchronization, and gives a criterion for selecting the involved control parameters. Finally, some numerical simulations are presented to show the validity of our theoretical results and the efficiency of the proposed controller.","PeriodicalId":197173,"journal":{"name":"2022 IEEE International Symposium on Product Compliance Engineering - Asia (ISPCE-ASIA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Symposium on Product Compliance Engineering - Asia (ISPCE-ASIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPCE-ASIA57917.2022.9970977","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This research examines the bipartite synchronization of dynamical network with switching signed topologies, where the nodes are governed by certain nonlinear dynamics, and an event-triggered control strategy is applied by under periodic sampling communications. It is shown that when the topologies switch within a finite set of signed graph, all nodes are guaranteed to achieve bipartite synchronization if the time average of the algebraic connectivity of the corresponding unsigned graph over certain length of time is large enough, and the main theorem details the impacts of nodal dynamics, network structure on synchronization, and gives a criterion for selecting the involved control parameters. Finally, some numerical simulations are presented to show the validity of our theoretical results and the efficiency of the proposed controller.