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
Event2013 CACS International Automatic Control Conference, CACS 2013 - Nantou
Duration: 2013 Dec 22013 Dec 4

Other

Other2013 CACS International Automatic Control Conference, CACS 2013
CityNantou
Period13/12/213/12/4

Fingerprint

Multi agent systems

Keywords

  • average consensus
  • connected graphs
  • disconnected graphs
  • Multi-agents systems
  • 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] https://doi.org/10.1109/CACS.2013.6734132

Basic consensus problems in multi-agent systems with switching interconnection graphs. / Zhai, Guisheng; Huang, Chi.

2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest. 2013. p. 198-203 6734132.

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

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., 6734132, pp. 198-203, 2013 CACS International Automatic Control Conference, CACS 2013, Nantou, 13/12/2. https://doi.org/10.1109/CACS.2013.6734132
Zhai G, Huang C. Basic consensus problems in multi-agent systems with switching interconnection graphs. In 2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest. 2013. p. 198-203. 6734132 https://doi.org/10.1109/CACS.2013.6734132
Zhai, Guisheng ; Huang, Chi. / Basic consensus problems in multi-agent systems with switching interconnection graphs. 2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest. 2013. pp. 198-203
@inproceedings{66f0104efa5345de9f42f80e7d7ddd5b,
title = "Basic consensus problems in multi-agent systems with switching interconnection graphs",
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.",
keywords = "average consensus, connected graphs, disconnected graphs, Multi-agents systems, switching interconnection graphs, switching strategy",
author = "Guisheng Zhai and Chi Huang",
year = "2013",
doi = "10.1109/CACS.2013.6734132",
language = "English",
isbn = "9781479923847",
pages = "198--203",
booktitle = "2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest",

}

TY - GEN

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

AU - Zhai, Guisheng

AU - Huang, Chi

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - average consensus

KW - connected graphs

KW - disconnected graphs

KW - Multi-agents systems

KW - switching interconnection graphs

KW - switching strategy

UR - http://www.scopus.com/inward/record.url?scp=84897680947&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897680947&partnerID=8YFLogxK

U2 - 10.1109/CACS.2013.6734132

DO - 10.1109/CACS.2013.6734132

M3 - Conference contribution

SN - 9781479923847

SP - 198

EP - 203

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

ER -