Binary consensus with Gaussian communication noise: A probabilistic approach

In this paper we consider the impact of Gaussian communication noise on a network that is trying to reach consensus on the occurrence of an event. We take a probabilistic approach and formulate the consensus problem using Markov chains. We show that the steady state behavior in the presence of any amount of non-zero communication noise is unfavorable as the network loses the memory of the initial state. However, we show that the network can still reach and stay in accurate consensus for a long period of time. In order to characterize this, we derive a close approximation for the second largest eigenvalue of the network and show how it is related to the size of the network and communication noise variance.

[1]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[2]  Nicola Elia,et al.  Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise , 2005, CDC 2005.

[3]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[4]  M. Mesbahi.  State-dependent graphs , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case , 2007, SIAM J. Control. Optim..

[7]  Richard M. Murray,et al.  Approximate distributed Kalman filtering in sensor networks with quantifiable performance , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

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

[9]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[10]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[11]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .

[12]  John G. Proakis,et al.  Digital Communications , 1983 .

[13]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

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

[15]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case , 2007, SIAM J. Control. Optim..

[16]  R.W. Beard,et al.  Multi-agent Kalman consensus with relative uncertainty , 2005, Proceedings of the 2005, American Control Conference, 2005..