Bipartite consensus for multi-agent systems on directed signed networks

Jiangping Hu, Wei Xing Zheng

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

101 Citations (Scopus)

Abstract

Collective dynamics is a complex emergence phenomenon yielded by local interactions within multi-agent systems. When agents cooperate or compete in the community, a collective behavior, such as consensus, polarization or diversity, may emerge. In this paper, we investigate a bipartite consensus process, in which all the agents converge to a final state characterized by identical modulus but opposite sign. Firstly, the interaction network of the agents is represented by a directed signed graph. A neighbor-based interaction rule is proposed for each agent with a single integrator dynamics. Then, we classify the signed network into heterogeneous networks and homogeneous networks according to the sign of edges. Under a weak connectivity assumption that the signed network has a spanning tree, some sufficient conditions are derived for bipartite consensus of multi-agent systems with the help of a structural balance theory. At the same time, signless Laplacian matrix and signed Laplacian matrix are introduced to analyze the bipartite consensus of multi-agent systems on homogeneous networks and heterogenous networks, respectively. Finally, simulation results are provided to demonstrate the bipartite consensus formation.
Original languageEnglish
Title of host publicationProceedings of the 2013 IEEE 52nd Annual Conference on Decision and Control (CDC'2013): 10-13 December 2013, Florence, Italy
PublisherIEEE
Pages3451-3456
Number of pages6
ISBN (Print)9781467357166
DOIs
Publication statusPublished - 2013
EventIEEE Conference on Decision & Control -
Duration: 10 Dec 2013 → …

Conference

ConferenceIEEE Conference on Decision & Control
Period10/12/13 → …

Fingerprint

Dive into the research topics of 'Bipartite consensus for multi-agent systems on directed signed networks'. Together they form a unique fingerprint.

Cite this