Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
© 2018 Informa UK Limited, trading as Taylor & Francis Group. We study a continuous-time surplus-based algorithm for multi-agent average consensus, and derive a tight upper bound on the key parameter included in this algorithm that ensures convergence over strongly connected and balanced digra...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Language: | English |
| Published: |
TAYLOR & FRANCIS LTD
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/82649 |
| _version_ | 1848764529228382208 |
|---|---|
| author | Kawamura, S. Cai, K. Ye, Mengbin Lin, Z. |
| author_facet | Kawamura, S. Cai, K. Ye, Mengbin Lin, Z. |
| author_sort | Kawamura, S. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | © 2018 Informa UK Limited, trading as Taylor & Francis Group. We study a continuous-time surplus-based algorithm for multi-agent average consensus, and derive a tight upper bound on the key parameter included in this algorithm that ensures convergence over strongly connected and balanced digraphs. We specialise the upper bound result to undirected (connected) graphs and unweighted cyclic digraphs; in particular, for undirected graphs the algorithm converges for arbitrary positive values of the parameter, and for cyclic digraphs the upper bound on the parameter depends only on the number of agents and may be easily calculated. Moreover, it is suggested through extensive simulation that, for the same number of agents, the upper bound for cyclic digraphs be smaller than that for other strongly connected and possibly unbalanced digraphs; this implies that as long as the parameter satisfies the upper bound for cyclic digraphs, this parameter can work for other digraphs. |
| first_indexed | 2025-11-14T11:20:48Z |
| format | Journal Article |
| id | curtin-20.500.11937-82649 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T11:20:48Z |
| publishDate | 2020 |
| publisher | TAYLOR & FRANCIS LTD |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-826492021-03-12T06:30:32Z Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs Kawamura, S. Cai, K. Ye, Mengbin Lin, Z. Science & Technology Technology Automation & Control Systems Multi-agent systems average consensus surplus-based algorithm strongly connected digraphs balanced digraphs CONSENSUS AGENTS © 2018 Informa UK Limited, trading as Taylor & Francis Group. We study a continuous-time surplus-based algorithm for multi-agent average consensus, and derive a tight upper bound on the key parameter included in this algorithm that ensures convergence over strongly connected and balanced digraphs. We specialise the upper bound result to undirected (connected) graphs and unweighted cyclic digraphs; in particular, for undirected graphs the algorithm converges for arbitrary positive values of the parameter, and for cyclic digraphs the upper bound on the parameter depends only on the number of agents and may be easily calculated. Moreover, it is suggested through extensive simulation that, for the same number of agents, the upper bound for cyclic digraphs be smaller than that for other strongly connected and possibly unbalanced digraphs; this implies that as long as the parameter satisfies the upper bound for cyclic digraphs, this parameter can work for other digraphs. 2020 Journal Article http://hdl.handle.net/20.500.11937/82649 10.1080/00207179.2018.1535200 English TAYLOR & FRANCIS LTD fulltext |
| spellingShingle | Science & Technology Technology Automation & Control Systems Multi-agent systems average consensus surplus-based algorithm strongly connected digraphs balanced digraphs CONSENSUS AGENTS Kawamura, S. Cai, K. Ye, Mengbin Lin, Z. Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs |
| title | Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs |
| title_full | Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs |
| title_fullStr | Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs |
| title_full_unstemmed | Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs |
| title_short | Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs |
| title_sort | tight bound on parameter of surplus-based averaging algorithm over balanced digraphs |
| topic | Science & Technology Technology Automation & Control Systems Multi-agent systems average consensus surplus-based algorithm strongly connected digraphs balanced digraphs CONSENSUS AGENTS |
| url | http://hdl.handle.net/20.500.11937/82649 |