Gossip consensus algorithms via quantized communication

  • Authors:

  • Ruggero Carli;Fabio Fagnani;Paolo Frasca;Sandro Zampieri

  • Affiliations:

  • Center for Control, Dynamical Systems and Computation, University of California, Santa Barbara, CA 93106, USA;Dipartimento di Matematica, Politecnico di Torino, C.so Duca degli Abruzzi,24, 10129 Torino, Italy;D.I.I.M.A., Universití di Salerno, Italy and Istituto per le Applicazioni del Calcolo, C.N.R., Roma, Italy;D.E.I., Universití di Padova, ViaGradenigo6/a, 35131 Padova, Italy

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2010

Quantified Score

Hi-index 22.22

Visualization

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.