Title :
A One-Parameter Family of Distributed Consensus Algorithms with Boundary: From Shortest Paths to Mean Hitting Times
Author :
Tahbaz-Salehi, Alireza ; Jadbabaie, Ali
Author_Institution :
Dept. of Electr. & Syst. Eng., Pennsylvania Univ., Philadelphia, PA
Abstract :
We present a one-parameter family of consensus algorithms over a time-varying network of agents. The proposed family of algorithms contains the average and minimum consensus algorithms as two special cases. Furthermore, we investigate a closely related family of distributed algorithms which can be considered as a consensus scheme with fixed boundary conditions and constant inputs. The proposed algorithms recover both the Bellman-Ford iteration for finding shortest paths as well as the algorithm for calculating the mean hitting time of a random walk on a graph. Finally, we demonstrate the potential utility of these algorithms for routing in adhoc networks
Keywords :
distributed algorithms; graph theory; iterative methods; Bellman-Ford iteration; adhoc network routing; distributed consensus algorithm; graph; mean hitting time; one-parameter family; random walk; shortest paths; time-varying network; Boundary conditions; Computer networks; Control system synthesis; Distributed computing; Iterative algorithms; Motion control; Multiagent systems; Nearest neighbor searches; Network topology; Routing;
Conference_Titel :
Decision and Control, 2006 45th IEEE Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
1-4244-0171-2
DOI :
10.1109/CDC.2006.377308