On quantized consensus by means of gossip algorithm - Part II: Convergence time

This paper deals with the distributed averaging problem over a connected network of agents, subject to a quantization constraint. It is assumed that at each time update, only a pair of agents can update their own numbers in terms of the quantized data being exchanged. The agents are also required to communicate with one another in a stochastic fashion. In the first part of the paper, it was shown that the quantized consensus is reached by means of a stochastic gossip algorithm proposed in a recent paper, for any arbitrary quantization. The current part of the paper considers the expected value of the time at which the quantized consensus is reached. This quantity (corresponding to the worst case) is lower and upper bounded in terms of the topology of the graph, for uniform quantization. In particular, it is shown that the upper bound is related to the principal minors of the weighted Laplacian matrix. A convex optimization is also proposed to determine the set of probabilities (used to pick a pair of agents) which leads to the fast convergence of the gossip algorithm.

[1]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  S. Strogatz Exploring complex networks , 2001, Nature.

[3]  Ruggero Carli,et al.  Communication constraints in the average consensus problem , 2008, Autom..

[4]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[6]  Alexandros G. Dimakis,et al.  Gossip along the way: order-optimal consensus through randomized path averaging , 2007 .

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

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

[9]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[10]  Yuval Rabani,et al.  Local divergence of Markov chains and the analysis of iterative load-balancing schemes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[11]  Richard M. Murray,et al.  Real-valued average consensus over noisy quantized channels , 2009, 2009 American Control Conference.

[12]  Stephen P. Boyd,et al.  Analysis and optimization of randomized gossip algorithms , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[13]  K.H. Johansson,et al.  Distributed and Collaborative Estimation over Wireless Sensor Networks , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[14]  Ruggero Carli,et al.  Average consensus by gossip algorithms with quantized communication , 2008, 2008 47th IEEE Conference on Decision and Control.

[15]  Richard M. Murray,et al.  A biologically inspired approach to real-valued average consensus over quantized channels with arbitrary deterministic accuracy , 2008 .

[16]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[17]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[18]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[19]  Javad Lavaei,et al.  On quantized consensus by means of gossip algorithm - Part I: Convergence proof , 2009, 2009 American Control Conference.

[20]  Andrey V. Savkin,et al.  Coordinated collective motion of Groups of autonomous mobile robots: analysis of Vicsek's model , 2004, IEEE Transactions on Automatic Control.

[21]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.