Bipartite Consensus of High‐Order Edge Dynamics on Coopetition Multiagent Systems

Abstract

The bipartite consensus of high‐order edge dynamics is investigated for coopetition multiagent systems, in which the cooperative and competitive relationships among agents are characterized by positive weight and negative weight, respectively. By mapping the initial graph to a line graph, the distributed control protocol is proposed for the strongly connected, digon sign‐symmetric structurally balanced line graph; and then we give sufficient conditions for the third‐order multi‐gent system to achieve both the bipartite consensus of edge dynamics and the final value of bipartite consensus. By transforming the coefficients of characteristic polynomial from complex domain to real number domain, the sufficient conditions for the bipartite consensus of high‐order edge dynamics are also proposed, and the final values of the high‐order edge dynamics on multiagent systems are obtained.