Convergence Speed in Distributed Consensus and Control

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.

[1]  M. Degroot.  Reaching a Consensus , 1974 .

[2]  A. Odlyzko,et al.  Bounds for eigenvalues of certain stochastic matrices , 1981 .

[3]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[4]  John N. Tsitsiklis,et al.  Distributed asynchronous deterministic and stochastic gradient optimization algorithms , 1986 .

[5]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[6]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[7]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[8]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[9]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[10]  Huaiqing Wang,et al.  Multi-agent coordination using nearest neighbor rules: revisiting the Vicsek model , 2004, ArXiv.

[11]  F. Bullo,et al.  On collective motion in sensor networks: sample problems and distributed algorithms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  R.M. Murray,et al.  Distributed Averaging on Asynchronous Communication Networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[13]  Panos J. Antsaklis,et al.  On communication requirements for multi-agent consensus seeking , 2006 .

[14]  Benjamin Van Roy,et al.  Consensus Propagation , 2005, IEEE Transactions on Information Theory.

[15]  Mehran Mesbahi,et al.  On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian , 2006, IEEE Transactions on Automatic Control.