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

Guisheng Zhai, Chi Huang

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトル2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest
ページ198-203
ページ数6
DOI
出版ステータスPublished - 2013 12 1
イベント2013 CACS International Automatic Control Conference, CACS 2013 - Nantou, Taiwan, Province of China
継続期間: 2013 12 22013 12 4

出版物シリーズ

名前2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest

Conference

Conference2013 CACS International Automatic Control Conference, CACS 2013
国/地域Taiwan, Province of China
CityNantou
Period13/12/213/12/4

ASJC Scopus subject areas

  • 制御およびシステム工学

フィンガープリント

「Basic consensus problems in multi-agent systems with switching interconnection graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル