Skip to main navigation Skip to search Skip to main content

Bipartite consensus of general linear multi-agent systems

  • Southwest Jiaotong University
  • City University of Hong Kong

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2014 American Control Conference, ACC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages808-812
Number of pages5
ISBN (Print)9781479932726
DOIs
StatePublished - 2014
Externally publishedYes
Event2014 American Control Conference, ACC 2014 - Portland, OR, United States
Duration: 4 Jun 20146 Jun 2014

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Conference

Conference2014 American Control Conference, ACC 2014
Country/TerritoryUnited States
CityPortland, OR
Period4/06/146/06/14

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