TY - GEN

T1 - A one-parameter family of distributed consensus algorithms with boundary

T2 - 45th IEEE Conference on Decision and Control 2006, CDC

AU - Tahbaz-Salehi, Alireza

AU - Jadbabaie, Ali

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=39649107929&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39649107929&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:39649107929

SN - 1424401712

SN - 9781424401710

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 4664

EP - 4669

BT - Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC

Y2 - 13 December 2006 through 15 December 2006

ER -