2009 · 19 citations · 23 references
ComputingComputer ScienceAlgorithmsComplex SystemsDistributed SystemsConsensus AlgorithmsDistributed AlgorithmsDistributed ComputingDistributed ControlMatrix ComputationMatrix FactorizationAverage ConsensusConsensusFinite-time ConsensusLower Bounds
We study the finite-time average-consensus problem for arbitrary connected networks. Viewing this consensus problem as a factorization of 1/n11 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sup> by suitable families of matrices, we prove the existence of a finite factorization and provide tight bounds on the size of the minimal factorization by exhibiting finite-time average-consensus algorithms and bounding their runtimes. We also show that basic matrix theory yields insights into the structure of finite-time consensus algorithms.
23
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Consensus and Cooperation in Networked Multi-Agent Systems
Reza Olfati‐Saber, J.A. Fax, Richard M. Murray · Proceedings of the IEEE · 2007 · 10.3K citations
Fast linear iterations for distributed averaging
Lin Xiao, Stephen Boyd · Systems & Control Letters · 2004 · 2.8K citations