Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ALLERTON.2018.8635839 | Allerton |
Keywords | Field | DocType |
Protocols,Convergence,Robot sensing systems,Multi-agent systems,Computers,Communication networks,Graph theory | Graph theory,Convergence (routing),Graph,Telecommunications network,Computer science,Multi-agent system,Multiprocessor interconnection,Computation,Distributed computing | Conference |
ISSN | ISBN | Citations |
2474-0195 | 978-1-5386-6596-1 | 1 |
PageRank | References | Authors |
0.38 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prakash, M. | 1 | 5 | 1.18 |
| Saurav Talukdar | 2 | 5 | 3.17 |
| Sandeep Attree | 3 | 4 | 1.14 |
| Sourav Patel | 4 | 4 | 2.49 |
| Murti V. Salapaka | 5 | 182 | 45.34 |