Basic consensus problems in multi-agent systems with switching interconnection graphs

Guisheng Zhai, Chi Huang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider several basic consensus problems in multi-agents systems with switching interconnection graphs, where the connections between any two agents are assumed bidirectional for notation simplicity. When the switching interconnection graphs are always connected, it has been shown in the literature that the Laplacian based algorithm always achieves the average consensus. We first extend the discussion to the case where disconnected interconnection graphs are involved, by showing that the average consensus is still achieved if the dwell time ratio between connected graphs and disconnected ones satisfies a specified condition. Next, we consider the case where there is no connected graph but the combination of a set of graphs is connected, and propose two switching strategies for achieving the average consensus. Several numerical examples are provided to show the algorithms.

Original languageEnglish
Title of host publication2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest
Pages198-203
Number of pages6
DOIs
Publication statusPublished - 2013 Dec 1
Event2013 CACS International Automatic Control Conference, CACS 2013 - Nantou, Taiwan, Province of China
Duration: 2013 Dec 22013 Dec 4

Publication series

Name2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest

Conference

Conference2013 CACS International Automatic Control Conference, CACS 2013
CountryTaiwan, Province of China
CityNantou
Period13/12/213/12/4

    Fingerprint

Keywords

  • Multi-agents systems
  • average consensus
  • connected graphs
  • disconnected graphs
  • switching interconnection graphs
  • switching strategy

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Zhai, G., & Huang, C. (2013). Basic consensus problems in multi-agent systems with switching interconnection graphs. In 2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest (pp. 198-203). [6734132] (2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest). https://doi.org/10.1109/CACS.2013.6734132