Premium
Quantized Consensus of Multi‐Agent Systems Via Broadcast Gossip Algorithms
Author(s) -
Liu ZhiWei,
Guan ZhiHong,
Li Tao,
Zhang XianHe,
Xiao JiangWen
Publication year - 2012
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.525
Subject(s) - gossip , consensus algorithm , computer science , network topology , quantization (signal processing) , topology (electrical circuits) , consensus , algorithm , uniform consensus , multi agent system , telecommunications network , class (philosophy) , strongly connected component , state (computer science) , distributed computing , distributed algorithm , theoretical computer science , mathematics , computer network , artificial intelligence , psychology , social psychology , combinatorics
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.