神戸大学附属図書館デジタルアーカイブ
https://hdl.handle.net/20.500.14094/90009369

このアイテムのアクセス数:39件（2025-08-03 03:00 集計）

閲覧可能ファイル 

ファイル フォーマット サイズ 閲覧回数 説明
90009369 (fulltext) pdf 496 KB 24

メタデータ

ファイル出力

メタデータID
90009369
アクセス権
open access
出版タイプ
Version of Record
タイトル
Scaled Group Consensus over Weakly Connected Structurally Balanced Graphs
著者
Hanada, Kenta ; Wada, Takayuki ; Masubuchi, Izumi ; Asai, Toru ; Fujisaki, Yasumasa
著者名
Hanada, Kenta
著者名
Wada, Takayuki
著者ID
A0015
研究者ID
1000090283150
KUID
https://kuid-rm-web.ofc.kobe-u.ac.jp/search/detail?systemId=1f0608e0a9c60754520e17560c007669
著者名
Masubuchi, Izumi
増淵, 泉
マスブチ, イズミ
所属機関名
システム情報学研究科
著者名
Asai, Toru
著者名
Fujisaki, Yasumasa
言語
English (英語)
収録物名
IFAC-PapersOnLine
巻(号)
53(2)
ページ
3037-3042
出版者
IFAC (International Federation of Automatic Control)
刊行日
2020
公開日
2022-06-29
抄録
A graph Laplacian based distributed protocol that can achieve a group consensus over weighted, signed, directed, and weakly connected graphs is investigated. It is said to achieve the group consensus if the state of agents who belong to the same group converges to a common value, while the one of agents who belong to another group converges to a different value. It is assumed that no agent knows which group she belongs to before the protocol is executed. In this paper, for a given signed graph which contains a directed spanning tree, namely, at least one leader that can affect all of the other agents, a definition of n-structurally balanced is proposed. It is emphasized that this definition is a generalization of the structurally balanced which leads a bipartite consensus. Then, necessary and sufficient conditions are established to guarantee the agents’ state reaching the group consensus. The results are illustrated through numerical examples.
キーワード
multi-agent systems
scaled consensus
group consensus
structurally balanced
カテゴリ
システム情報学研究科
学術雑誌論文
権利
© 2020 The Authors.
CC license
This is an open access article under the CC BY-NC-ND license.
関連情報
DOI
https://doi.org/10.1016/j.ifacol.2020.12.995