Bipartite consensus of general linear multi-agent systems

Hongwei Zhang, Jie Chen

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

105 Citations (Scopus)

Abstract

Collective behaviors of multi-agent systems over signed graphs find applications in a variety of scenarios including social networks, predator-prey dynamics, which however have not been adequately addressed as their counterparts with nonnegative graphs. This paper studies bipartite consensus problem of general linear multi-agent systems over signed digraphs. First, we show that for general linear agents, bipartite consensus over signed graphs and ordinary consensus over nonnegative graphs are equivalent. This indicates that prevailing consensus controllers for nonnegative graphs can be adopted to solve bipartite consensus problems. Based on this observation, an existing Riccati equation based cooperative tracking controller is extended to solve the bipartite consensus problem for general linear systems. © 2014 American Automatic Control Council.
Original languageEnglish
Title of host publicationProceedings of the American Control Conference
PublisherIEEE
Pages808-812
ISBN (Print)9781479932726
DOIs
Publication statusPublished - Jun 2014
Event2014 American Control Conference (ACC 2014) - Portland, United States
Duration: 4 Jun 20146 Jun 2014

Publication series

Name
ISSN (Print)0743-1619

Conference

Conference2014 American Control Conference (ACC 2014)
PlaceUnited States
CityPortland
Period4/06/146/06/14

Research Keywords

  • Cooperative control
  • Linear systems
  • Networked control systems

Fingerprint

Dive into the research topics of 'Bipartite consensus of general linear multi-agent systems'. Together they form a unique fingerprint.

Cite this