Distributed event-triggered bipartite consensus for multi-agent systems associated with signed graphs

In order to reduce the unnecessary consumption of limited resources e.g., network bandwidth, communication cost, and energy of agents, a bipartite consensus problem of first-order multi-agent systems under linear asynchronous decentralized event-triggered control is investigated. According to properties of the connected signed graphs, the bipartite consensus control of a first-order multi-agent systems with the coexistence of cooperative and competitive interactions is designed, so that the multi-agent systems can reach an agreement with an identical magnitude but opposite sign. Due to the drawbacks of unnecessary consumption of communication cost in traditional sampling methods, we consider the event-triggered control bipartite consensus protocol, where both the control protocol and the event-triggered condition are based on local information and sampled states of neighboring agents. Specifically, cutting off continuous communication between agents will reduce energy consumption and communication utilization. The simulation results are given to illustrate the efficiency of the proposed control protocol.