Answers are grounded in this paper and cite their sources.
Distributed consensus problems of multi‐agent systems on directed networks are studied in this paper. For the communication of agents, it is assumed that only one agent can be selected with a prescribed probability, and it broadcasts its own state to neighbors via quantized communication (for any arbitrary quantization) at each time step. For this kind of communication, the fundamental questions are how to design distributed algorithms and what kinds of network topology together lead to the quantized consensus. A class of broadcast gossip algorithms is proposed, and a necessary and sufficient graphical condition is given to ensure the quantized consensus. In particular, the obtained graphical condition does not require a symmetric network topology, which is weaker than those in some other literature. Several numerical simulations are given to show the effectiveness of the proposed algorithms.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: