DocumentCode
2469868
Title
Convergence Rates in Distributed Consensus and Averaging
Author
Olshevsky, Alex ; Tsitsiklis, John N.
Author_Institution
Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA
fYear
2006
fDate
13-15 Dec. 2006
Firstpage
3387
Lastpage
3392
Abstract
We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence rates of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the convergence time
Keywords
computational complexity; convergence; distributed algorithms; graph theory; convergence rates; distributed averaging; distributed consensus; dynamic-topology case; fixed-graph case; polynomial-time; Autonomous agents; Communication networks; Computer networks; Control theory; Convergence; Distributed algorithms; Distributed computing; Heuristic algorithms; Polynomials; Unmanned aerial vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2006 45th IEEE Conference on
Conference_Location
San Diego, CA
Print_ISBN
1-4244-0171-2
Type
conf
DOI
10.1109/CDC.2006.376899
Filename
4177335
Link To Document