Gossip consensus algorithms via quantized communication

From MaRDI portal
(Redirected from Publication:985266)




Abstract: This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise gossip communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update.




Cited in
(69)






This page was built for publication: Gossip consensus algorithms via quantized communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985266)