Cluster synchronization of a class of multi-agent systems with a bipartite graph topology  

作　　者：WANG Qiang WANG YuZhen 

机构地区：[1]School of Control Science and Engineering, Shandong University

出　　处：《Science China(Information Sciences)》2014年第1期188-198,共11页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos.61074068,61174036,61034007);Research Fund for the Taishan Scholar Project of Shandong Province of China;Natural Science Foundation of Shandong Province(Grant No.ZR2010FM013)

摘　　要：This paper investigates cluster synchronization of a class of multi-agent systems with a directed bipartite graph topology, and presents a number of new results by using the neighbor＇s rules for the following two cases： I） there is competition among the agents of diferent clusters, and II） there are both competition and cooperation among the agents. Firstly, for case I）, a linear control protocol is designed for cluster synchronization of multi-agent systems, and a method is presented to determine the final state with the initial conditions based on state-space decomposition. Secondly, we study case II）, and design a control protocol based on the information of neighbors and that of two-hop neighbors（that is, neighbors＇ neighbors）. Finally, two examples are studied by using our presented results. The study of illustrative examples with simulations shows that our results as well as designed control protocols work very well in studying the cluster synchronization of this class of multi-agent systems.This paper investigates cluster synchronization of a class of multi-agent systems with a directed bipartite graph topology, and presents a number of new results by using the neighbor＇s rules for the following two cases： I） there is competition among the agents of diferent clusters, and II） there are both competition and cooperation among the agents. Firstly, for case I）, a linear control protocol is designed for cluster synchronization of multi-agent systems, and a method is presented to determine the final state with the initial conditions based on state-space decomposition. Secondly, we study case II）, and design a control protocol based on the information of neighbors and that of two-hop neighbors（that is, neighbors＇ neighbors）. Finally, two examples are studied by using our presented results. The study of illustrative examples with simulations shows that our results as well as designed control protocols work very well in studying the cluster synchronization of this class of multi-agent systems.

关 键 词：multi-agent systems bipartite graph clustering synchronization COMPETITION COOPERATION state-space decomposition. 

分 类 号：O231[理学—运筹学与控制论]