This paper proposes an asynchronous gossip framework where agents move according to independent random walks over a location graph and interactions may occur only when two agents share the same location. Our goal is to investigate how average consensus may be achieved when agents’ motion occurs over a set of discrete locations with topological constraints. This could be used to model the spreading of information across moving crowds or the coordination of agents monitoring a discrete set of points of interest.

Gossip algorithm for multi-agent systems via random walk

Oliva G;Setola R;
2019-01-01

Abstract

This paper proposes an asynchronous gossip framework where agents move according to independent random walks over a location graph and interactions may occur only when two agents share the same location. Our goal is to investigate how average consensus may be achieved when agents’ motion occurs over a set of discrete locations with topological constraints. This could be used to model the spreading of information across moving crowds or the coordination of agents monitoring a discrete set of points of interest.
Distributed averaging; Gossip algorithms; Multi-agent systems; Random walk
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/20.500.12610/5719
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact