Distributed averaging of initial conditions held by multiple agents is a well-studied problem in context of networked systems where coordination amongst the agents is of paramount importance. The asymptotic nature of distributed averaging protocols makes it challenging to implement in practical settings as it does not lend itself to a finite-time stopping criterion that can be ascertained distributively. It is important that agents develop the ability to detect on their own when average of the initial conditions of the agents is achieved within some pre-specified tolerance and stop further computations. This article presents a distributed stopping criterion for distributed averaging using ratio consensus on a fixed interconnection topology (captured by a directed or undirected graph). The practical utility of the algorithm is illustrated through simulations.
|Original language||English (US)|
|Title of host publication||2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|State||Published - Feb 5 2019|
|Event||56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018 - Monticello, United States|
Duration: Oct 2 2018 → Oct 5 2018
|Name||2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018|
|Conference||56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018|
|Period||10/2/18 → 10/5/18|
Bibliographical noteFunding Information:
VII. ACKNOWLEDGMENTS The authors acknowledge the support of ARPA-E for supporting this research through the project titled ‘A Robust Distributed Framework for Flexible Power Grids’ via grant no. DE-AR000071 and Xcel Energy’s Renewable Development Fund.
© 2018 IEEE.