Event-Triggered Bipartite Consensus for Multiagent Systems: A Zeno-Free Analysis

In this article, the bipartite consensus of first-order multiagent systems with a connected structurally balanced signed graph is studied. To reduce the communications among agents, a distributed event-triggered control law is proposed, where the event-triggering condition of each agent only uses its own state and the sampled states of its neighbours, and no knowledge of the global network topology is required. By relating to the nonexistence of some finite-time convergence, a novel analysis is given to show that there is no Zeno behavior in the proposed event-triggered multiagent system. Then, from the Lyapunov stability theory and the algebraic graph theory, it is proved that all agents can reach agreement with an identical magnitude but opposite signs. Finally, a numerical example is given to illustrate the efficiency and feasibility of the proposed results.