Bipartite Consensus of Linear Multi-Agent Systems by Distributed Event-Triggered Control

For multi-agent systems with competitive and collaborative relationships, signed graph can more intuitively express the characteristics of their interactive networks. In this paper, the bipartite consensus is investigated for multi-agent systems with structurally balanced signed graph. In order to reduce actuation burden in dynamical network environment, the event-triggering strategy is applied to bipartite consensus protocol for the multi-agent systems. The triggered condition for each agent is designed by using its own information and transmitted information of its neighbors at sampling instant and make the number of triggers of the whole systems be reduced. Based on the distributed event-triggered control, some sufficient conditions are derived to guarantee the leaderless and leader-following bipartite consensus. Finally, some numerical examples are shown to demonstrate the effectiveness of the theoretical results.