A Study on Accelerating Average Consensus Algorithms Using Delayed Feedback

Abstract

This article studies accelerating a Laplacian-based dynamic average consensus algorithm by splitting the conventional delay-free disagreement feedback into a weighted summation of current and outdated terms. When determining the weighted sum, there is a range of time delay that results in a higher convergence rate for the algorithm. For such weights, using the Lambert <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$W$</tex-math></inline-formula> function, we obtain the rate-increasing range of the time delay, obtain the maximum reachable rate, and characterize the value of the corresponding maximizer delay. We also study the effect of using the outdated feedback on the control effort of the agents. We show that only for some specific affine combination of the immediate and outdated feedback, the control effort of the agents does not go beyond that of the delay-free algorithm. In addition, we demonstrate that using outdated feedback does not increase the steady-state tracking error of the average consensus algorithm. Finally, we determine the optimum combination of the current and the outdated feedback weights to achieve the maximum increase in the rate of convergence without increasing the control effort of the agents. We demonstrate our results through a numerical example.