Skip to main navigation Skip to search Skip to main content

Sign-consensus of linear multi-agent systems over signed graphs

  • Southwest Jiaotong University

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

Abstract

This paper investigates sign-consensus of linear multi-agent systems, that is the signs of all agents' states achieve consensus. The communication network we consider is a signed graph, which consists of both positive and negative edges, representing collaboration and competition interactions, respectively. A state feedback control protocol is proposed to make a group of agents achieve sign-consensus. Moreover, we show by an example that conventional consensus can also be achieved even over signed graphs.

Original languageEnglish
Title of host publicationProceedings of the 35th Chinese Control Conference, CCC 2016
EditorsJie Chen, Qianchuan Zhao, Jie Chen
PublisherIEEE Computer Society
Pages8133-8137
Number of pages5
ISBN (Electronic)9789881563910
DOIs
StatePublished - 26 Aug 2016
Externally publishedYes
Event35th Chinese Control Conference, CCC 2016 - Chengdu, China
Duration: 27 Jul 201629 Jul 2016

Publication series

NameChinese Control Conference, CCC
Volume2016-August
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference35th Chinese Control Conference, CCC 2016
Country/TerritoryChina
CityChengdu
Period27/07/1629/07/16

Keywords

  • consensus
  • linear system
  • sign-consensus
  • signed graph

Fingerprint

Dive into the research topics of 'Sign-consensus of linear multi-agent systems over signed graphs'. Together they form a unique fingerprint.

Cite this