Journal
SIAM JOURNAL ON CONTROL AND OPTIMIZATION
Volume 48, Issue 1, Pages 33-55Publisher
SIAM PUBLICATIONS
DOI: 10.1137/060678324
Keywords
consensus algorithms; distributed averaging; cooperative control
Categories
Ask authors/readers for more resources
We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available