Discrete-Time High-Order Distributed Consensus Algorithm for Accelerating Binary-Hop Information Synchronization Convergence

In order to improve the convergence rate of distributed consensus, a discrete-time high-order distributed consensus algorithm is proposed in the article. This algorithm aims at adopting the previous multistage information of the binary-hop adjacent node to accelerate the convergence rate of the distributed consensus algorithm through single-hop communication. Meanwhile, the convergence performance and rate of this algorithm under undirected communication topology as well as the convergence performance of the algorithm with communication delay have been analyzed and simulated in the article. The result shows: this algorithm can converge to the mean value of the initial state when meeting relevant conditions, compared with other algorithms which also adopt binary-hop adjacent node information, this algorithm has the features of small communication traffic and fast convergence, but it has a smaller tolerable communication delay.