Bipartite Consensus Of Multi-Agent Systems Over Sign Networks

In recent years,with the increasing maturity of computer information technology and the rapid development of modern artificial intelligence technology,the coordination and control of multi-agent system has been paid more and more attention by domestic and foreign researchers.However,most studies only consider the consensus problem based on non-negative graph,but the system consensus protocol based on the topology of non-negative graph can't determine the stability of the system with negative connection interaction between the agent nodes.Sign graph can describe the network topology with positive and negative connections so the bipartite consensus of multi-agent system is generated.In this paper,by using the knowledge of graph theory,Lyapunov function and Linear Matrix Inequality(LMI),the bipartite consensus problem of multi-agent system under sign network is studied deeply.The main work is as follows:1.The adaptive bipartite consensus problem of linear multi-agent system containing antagonistic interaction is studied.First,consider the undirected connection of the initial communication topology of the system and satisfy the structural balance condition.A distributed adaptive protocol is designed for the network model with linear dynamics.Based on this,a sufficient condition for multi-agent system to achieve leaderless adaptive bipartite consensus is given.2.Due to the disturbance of unstable factors in communication environment,the problem of bipartite consensus of nonlinear multi-agent system under network attack is studied.Connections between agents in a system may be broken or restored after a network attack.The topology of the system will change constantly under continuous network attack.Therefore,an appropriate adaptive strategy is designed for the multi-agent system to ensure the balance of the topology structure under network attack.A sufficient condition for bipartite consensus of nonlinear multi-agent system affected by network attacks is presented.3.Based on the single-layer network structure,the point-to-point bipartite consensus problem of the two-layered multi-agent systems under network attack is further studied.Consider that the neighboring agents in the followers' layer are both cooperative and competitive.Meanwhile,there is a restraining relationship between the leaders' layer and the followers' layer.The consensus problem among nodes of leaders' layer,followers' layer and two layers are discussed respectively.Based on LMI,Lyapunov stability theory and graph theory,some sufficient conditions of consensus in the leaders' layer,bipartite consensus in the followers' layer and node-to-node bipartite consensus in the two-layer under network attacks are given.