Finite-time distributed consensus through graph filters

We propose a new framework for distributed computation of average consensus. The presented framework leads to a systematic design of iterative algorithms that compute the consensus exactly, are guaranteed to converge in finite time, are computationally efficient, and require no online memory. We demonstrate that our approach is applicable to a broad class of networks. For remaining networks, our framework leads to the construction of approximating algorithms for consensus that are also guaranteed to compute in finite time. Our approach is inspired by graph filters introduced by the theoretical framework of signal processing on graphs.

[1]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[2]  José M. F. Moura,et al.  Discrete signal processing on graphs: Graph filters , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[4]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[5]  Shreyas Sundaram,et al.  Distributed function calculation and consensus using linear iterative strategies , 2008, IEEE Journal on Selected Areas in Communications.

[6]  Soummya Kar,et al.  Sensor Networks With Random Links: Topology Design for Distributed Consensus , 2007, IEEE Transactions on Signal Processing.

[7]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[8]  J.N. Tsitsiklis,et al.  Convergence Rates in Distributed Consensus and Averaging , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[9]  Soummya Kar,et al.  Optimal design of distributed sensor networks for field reconstruction , 2013, 21st European Signal Processing Conference (EUSIPCO 2013).

[10]  Alain Y. Kibangou.  Finite-time average consensus based protocol for distributed estimation over AWGN channels , 2011, IEEE Conference on Decision and Control and European Control Conference.

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

[12]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs , 2012, IEEE Transactions on Signal Processing.

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

[14]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

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