Chebyshev Polynomials in Distributed Consensus Applications

Details Chebyshev Polynomials in Distributed Consensus Applications Chebyshev Polynomials in Distributed Consensus Applications

2011-11-21

arxiv.org/abs/1111.4825v2

Computer Science

Systems and Control

Submitted to TAC

Scientific paper

In this paper we analyze the use of Chebyshev polynomials in distributed consensus applications. We study the properties of these polynomials to propose a distributed algorithm that reaches the consensus in a fast way. The algorithm is expressed in the form of a linear iteration and, at each step, the agents only require to transmit their current state to their neighbors. The difference with respect to previous approaches is that the update rule used by the network is based on the second order difference equation that describes the Chebyshev polynomials of first kind. As a consequence, we show that our algorithm achieves the consensus using far less iterations than other approaches. We characterize the main properties of the algorithm for both, fixed and switching communication topologies. The main contribution of the paper is the study of the properties of the Chebyshev polynomials in distributed consensus applications, proposing an algorithm that increases the convergence rate with respect to existing approaches. Theoretical results, as well as experiments with synthetic data, show the benefits using our algorithm.

Affiliated with

Also associated with

No associations

Rating

Chebyshev Polynomials in Distributed Consensus Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Chebyshev Polynomials in Distributed Consensus Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chebyshev Polynomials in Distributed Consensus Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376649