An efficient quantization algorithm for solving average-consensus problems

In this work we present a new algorithm to solve the average-consensus problem. The main goal of this algorithm is to obtain exact convergence despite the existence of quantized communication channels between the agents. Starting from the Zoom-in Zoom-out strategy already presented in [5], we introduce the equations describing the behaviour of the algorithm and we formally prove the asymptotic agreement. We will also show that, under a reasonable hypothesis, the algorithm parameters ensuring convergence, can be chosen regardless the number of agents.