### 抄録

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

### ASJC Scopus subject areas

- Control and Systems Engineering
- Computer Science Applications

### これを引用

**A note on basic consensus problems in multi-agent systems with switching interconnection graphs.** / Zhai, Guisheng; Huang, Chi.

研究成果: Article

*International Journal of Control*, 巻. 88, 番号 3, pp. 631-639. https://doi.org/10.1080/00207179.2014.971431

}

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 -