Event-based Bipartite Consensus on Signed Networks

TL;DR

This paper introduces an event-based control strategy for achieving bipartite consensus in multi-agent systems with signed interactions, analyzing stability through spectral properties of the signed Laplacian matrix.

Contribution

It proposes a novel event-based interaction rule for bipartite consensus in signed networks and analyzes its stability using spectral graph theory.

Findings

Successful bipartite consensus achieved in simulations

Event-based rule reduces communication load

Stability confirmed via spectral analysis

Abstract

In this paper, a bipartite consensus problem for a multi-agent system is formulated firstly. Then an event-based interaction rule is proposed for the multi-agent system with antagonistic interactions. The bipartite consensus stability is analyzed on the basis of spectral properties of the signed Laplacian matrix associated with multi-agent networks. Some simulation results are presented to illustrate the bipartite consensus with the proposed interaction rule.