Name
Title | ||
|---|---|---|
A distributed algorithm for average consensus on strongly connected weighted digraphs |
Abstract | ||
|---|---|---|
In this work we propose a distributed algorithm to solve the discrete-time average consensus problem on strongly connected weighted digraphs (SCWDs). The key idea is to couple the computation of the average with the estimation of the left eigenvector associated with the zero eigenvalue of the Laplacian matrix according to the protocol described in Qu et al. (2012). The major contribution is the removal of the requirement of the knowledge of the out-neighborhood of an agent, thus paving the way for a simple implementation based on a pure broadcast-based communication scheme. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.automatica.2013.12.026 | Automatica |
Keywords | Field | DocType |
Average consensus,Directed graphs,Broadcast communication | Laplacian matrix,Broadcasting,Discrete mathematics,Combinatorics,Directed graph,Distributed algorithm,Strongly connected component,Eigenvalues and eigenvectors,Mathematics,Broadcast communication network,Computation | Journal |
Volume | Issue | ISSN |
50 | 3 | 0005-1098 |
Citations | PageRank | References |
14 | 0.91 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Attilio Priolo | 1 | 36 | 4.78 |
| Andrea Gasparri | 2 | 447 | 41.42 |
| Eduardo Montijano | 3 | 214 | 22.27 |
| Carlos Sagues | 4 | 91 | 8.17 |