Analysis on the High-order Distributed Consensus under Probabilistic Quantized Communication

Abstract

Because the high-order distributed consensus algorithm utilizes the previous state values of non-adjacent nodes to accelerate the convergent rate, under the quantized communication, it means that the high-order distributed consensus algorithm utilizes the quantized information of more non-adjacent nodes, the performance of the high-order algorithm become very important under quantized communication. in the paper, the performance and the mean square errors of the high-order probabilistic quantization distributed consensus algorithm were analyzed. By analysis and simulation, the bigger the length of quantization message is, the better the performance is, and the smaller the square errors of the high-order algorithm is.