We study the distributed averaging problem on arbitrary connected graphs, with the additional constraint that the value at each node is an integer.

We first prove that a general class of algorithms converges to quantized consensus, and then show that quantized gossip algorithms are contained in this class.

We describe simple randomized distributed algorithms which achieve consensus to the extent that the discrete nature of the problem permits. Published in: 2006 ...

Jul 18, 2022 · Abstract:This paper is concerned with the quantized consensus problem for uncertain nonlinear multi-agent systems under data-rate ...

Roughly speaking, a quantized consensus is reached if all numbers on the vertices of the graph G ultimately lie between two consecutive levels or splitting ...

This paper addresses a quantized consensus problem of general linear multi-agent systems in a symmetric network under an event-triggered scheme.

Oct 19, 2017 · We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily.

This paper shows that the quantized gossip algorithm leads to reaching the quantized consensus. This result is extended in [18] to the case when the ...

In the world of networked system, average consensus is an important dimension of co-ordinate control and cooperation. Since the communication medium is digital, ...

This dissertation aims to develop efficient quantized consensus algorithms based on the alternating direction method of multipliers (ADMM) for networked ...