Robustness of consensus algorithm for communication delays and switching topology

Takanobu Shida, Hiromitsu Ohmori

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

In this paper, we study consensus problems of continuous time multi-agent systems. Multi-agent system has communication network. Each agent gets information of neighbors to achieve consensus. It is assumed that there are delays in communication network. The communication delays are different every communication channels and time-dependent. Furthermore, it is assumed that there are switching topologies and feed-back gains are time variable. Under these assumptions, we show that the entire system is stable. The stability is shown by Lyapunov theorem. In addition, we extend the consensus algorithm for first order systems to the output consensus algorithm for high order systems.

本文言語English
ホスト出版物のタイトルSICE 2011 - SICE Annual Conference 2011, Final Program and Abstracts
出版社Society of Instrument and Control Engineers (SICE)
ページ1373-1380
ページ数8
ISBN(印刷版)9784907764395
出版ステータスPublished - 2011 1月 1
イベント50th Annual Conference on Society of Instrument and Control Engineers, SICE 2011 - Tokyo, Japan
継続期間: 2011 9月 132011 9月 18

出版物シリーズ

名前Proceedings of the SICE Annual Conference

Other

Other50th Annual Conference on Society of Instrument and Control Engineers, SICE 2011
国/地域Japan
CityTokyo
Period11/9/1311/9/18

ASJC Scopus subject areas

  • 制御およびシステム工学
  • コンピュータ サイエンスの応用
  • 電子工学および電気工学

フィンガープリント

「Robustness of consensus algorithm for communication delays and switching topology」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル