Fast distributed consensus with Chebyshev polynomials

Global observation of the environment is a key component in sensor networks and multi-robot systems. Distributed consensus algorithms make all the nodes in the network to achieve a common perception by local interactions between direct neighbors. The convergence rate of these algorithms depends on the network connectivity, which is related to the second largest eigenvalue of the weighted adjacency matrix of the communication graph. When the...