TY - GEN
T1 - Basic consensus problems in multi-agent systems with switching interconnection graphs
AU - Zhai, Guisheng
AU - Huang, Chi
PY - 2013/12/1
Y1 - 2013/12/1
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 - Multi-agents systems
KW - average consensus
KW - connected graphs
KW - disconnected graphs
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
AN - SCOPUS:84897680947
SN - 9781479923847
T3 - 2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest
SP - 198
EP - 203
BT - 2013 CACS International Automatic Control Conference, CACS 2013 - Conference Digest
T2 - 2013 CACS International Automatic Control Conference, CACS 2013
Y2 - 2 December 2013 through 4 December 2013
ER -