Chebyshev Polynomials in Distributed Consensus Applications

In this paper we analyze the use of Chebyshev polynomials in distributed consensus applications. It is well known that the use of polynomials speeds up the convergence to the consensus in a significant way. However, existing solutions only work for low degree polynomials and require the topology of the network to be fixed and known. We propose a distributed algorithm based on the second order difference equation that describes the Chebyshev polynomials of first kind. The contributions of our algorithm are three: (i) Since the evaluation of Chebyshev polynomials is stable, there is no limitation in the degree of the polynomial. (ii) Instead of the knowledge of the whole network topology, it only requires a partial knowledge or an approximation to it. (iii) It can be applied to time varying topologies. In the paper we characterize the main properties of the algorithm for both fixed and time-varying communication topologies. Theoretical results, as well as experiments with synthetic data, show the benefits of using our algorithm compared to existing methods.

[1]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[2]  R. K. McConnell,et al.  Load Balancing , 2021, Encyclopedia of Algorithms.

[3]  Xiaojie Gao,et al.  On matrix factorization and finite-time average-consensus , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[4]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[5]  Sonia Martínez,et al.  Discrete-time dynamic average consensus , 2010, Autom..

[6]  John N. Tsitsiklis,et al.  A Lower Bound for Distributed Averaging Algorithms on the Line Graph , 2011, IEEE Transactions on Automatic Control.

[7]  Paolo Braca,et al.  Single-Transmission Distributed Detection via Order Statistics , 2012, IEEE Transactions on Signal Processing.

[8]  Long Wang,et al.  Finite-time information consensus for multi-agent systems with fixed and switching topologies , 2009 .

[9]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

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

[11]  T. J. Rivlin.  The Chebyshev polynomials , 1974 .

[12]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[13]  Alberto Leon-Garcia,et al.  Communication Networks , 2000 .

[14]  Sandro Zampieri,et al.  A resistance-based approach to performance analysis of the consensus algorithm , 2010 .

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

[16]  Sonia Martínez,et al.  On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms , 2010, IEEE Transactions on Automatic Control.

[17]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[18]  S. Muthukrishnan,et al.  First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing , 1996, Theory of Computing Systems.

[19]  Shengyuan Xu,et al.  Accelerating distributed average consensus by exploring the information of second-order neighbors , 2010 .

[20]  E. Montijano,et al.  Fast distributed consensus with Chebyshev polynomials , 2011, Proceedings of the 2011 American Control Conference.

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

[22]  Pascal Frossard,et al.  Polynomial Filtering for Fast Convergence in Distributed Consensus , 2008, IEEE Transactions on Signal Processing.

[23]  Jorge Cortés,et al.  Finite-time convergent gradient flows with applications to network consensus , 2006, Autom..

[24]  Long Wang,et al.  Finite-Time Consensus Problems for Networks of Dynamic Agents , 2007, IEEE Transactions on Automatic Control.

[25]  Ling Shi,et al.  Decentralised final value theorem for discrete-time LTI systems with application to minimal-time distributed consensus , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[26]  Jan G. Verwer,et al.  An Implicit-Explicit Runge-Kutta-Chebyshev Scheme for Diffusion-Reaction Equations , 2004, SIAM J. Sci. Comput..

[27]  Amr El Abbadi,et al.  Convergence Rates of Distributed Average Consensus With Stochastic Link Failures , 2010, IEEE Transactions on Automatic Control.

[28]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[29]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[30]  J. Dicapua.  Chebyshev Polynomials , 2019, Fibonacci and Lucas Numbers With Applications.

[31]  Nicholas R. Jennings,et al.  Consensus acceleration in multiagent systems with the Chebyshev semi-iterative method , 2011, AAMAS.

[32]  Jing Zhou,et al.  Convergence speed in distributed consensus over dynamically switching random networks , 2009, Autom..

[33]  Y. Bar-Shalom,et al.  Censoring sensors: a low-communication-rate scheme for distributed detection , 1996, IEEE Transactions on Aerospace and Electronic Systems.

[34]  D. Angeli,et al.  Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees , 2006, SIAM J. Control. Optim..

[35]  R.M. Murray,et al.  Multi-Hop Relay Protocols for Fast Consensus Seeking , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[36]  Ian Postlethwaite,et al.  Spectral radius minimization for optimal average consensus and output feedback stabilization , 2009, Autom..

[37]  C.N. Hadjicostis,et al.  Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies , 2007, 2007 American Control Conference.

[38]  Giancarlo Ferrari-Trecate,et al.  Analysis of coordination in multi-agent systems through partial difference equations , 2006, IEEE Transactions on Automatic Control.

[39]  Hakan A. Çirpan,et al.  A set of new Chebyshev kernel functions for support vector machine pattern classification , 2011, Pattern Recognit..

[40]  Michael G. Rabbat,et al.  Optimization and Analysis of Distributed Averaging With Short Node Memory , 2009, IEEE Transactions on Signal Processing.

[41]  R.M. Murray,et al.  Asynchronous Distributed Averaging on Communication Networks , 2007, IEEE/ACM Transactions on Networking.

[42]  T. C. Aysal,et al.  Accelerated Distributed Average Consensus via Localized Node State Prediction , 2009, IEEE Transactions on Signal Processing.

[43]  M. Johansson,et al.  Faster Linear Iterations for Distributed Averaging , 2008 .

[44]  Hans-Heinrich Carstensen,et al.  Reaction Rate Representation Using Chebyshev Polynomials , 2002 .