A note on basic consensus problems in multi-agent systems with switching interconnection graphs

Guisheng Zhai, Chi Huang

研究成果: Article

10 引用 (Scopus)

抄録

We consider several basic consensus problems in multi-agent 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.

元の言語English
ページ(範囲)631-639
ページ数9
ジャーナルInternational Journal of Control
88
発行部数3
DOI
出版物ステータスPublished - 2015 3 4

Fingerprint

Multi agent systems

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications

これを引用

@article{028c962572e64ae387b1cc9ea3f200e7,
title = "A note on basic consensus problems in multi-agent systems with switching interconnection graphs",
abstract = "We consider several basic consensus problems in multi-agent 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-agent systems, switching interconnection graphs, switching strategy",
author = "Guisheng Zhai and Chi Huang",
year = "2015",
month = "3",
day = "4",
doi = "10.1080/00207179.2014.971431",
language = "English",
volume = "88",
pages = "631--639",
journal = "International Journal of Control",
issn = "0020-7179",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

TY - JOUR

T1 - A note on basic consensus problems in multi-agent systems with switching interconnection graphs

AU - Zhai, Guisheng

AU - Huang, Chi

PY - 2015/3/4

Y1 - 2015/3/4

N2 - We consider several basic consensus problems in multi-agent 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-agent 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-agent systems

KW - switching interconnection graphs

KW - switching strategy

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

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

U2 - 10.1080/00207179.2014.971431

DO - 10.1080/00207179.2014.971431

M3 - Article

AN - SCOPUS:84922010977

VL - 88

SP - 631

EP - 639

JO - International Journal of Control

JF - International Journal of Control

SN - 0020-7179

IS - 3

ER -