This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation that is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The properties of this algorithm are investigated both by a worst-case analysis and by a probabilistic analysis, and are shown to depend on the spectral properties of the evolution matrix. A special attention is devoted to the issue of the dependence of the performance on the number of agents, and several examples are given.

Average consensus on networks with quantized communication

CARLI, RUGGERO;ZAMPIERI, SANDRO
2009

Abstract

This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation that is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The properties of this algorithm are investigated both by a worst-case analysis and by a probabilistic analysis, and are shown to depend on the spectral properties of the evolution matrix. A special attention is devoted to the issue of the dependence of the performance on the number of agents, and several examples are given.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2448320
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 195
  • ???jsp.display-item.citation.isi??? 165
social impact