Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.sysconle.2019.04.009 | Systems & Control Letters |
Keywords | Field | DocType |
Multi-agent systems,Gossip algorithms,Random walk,Distributed averaging | Graph,Crowds,Asynchronous communication,Mathematical optimization,Gossip algorithms,Random walk,Gossip,Multi-agent system,Theoretical computer science,Point of interest,Mathematics | Journal |
Volume | ISSN | Citations |
128 | 0167-6911 | 1 |
PageRank | References | Authors |
0.37 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gabriele Oliva | 1 | 20 | 4.38 |
| Stefano Panzieri | 2 | 269 | 36.84 |
| Roberto Setola | 3 | 454 | 62.69 |
| Andrea Gasparri | 4 | 447 | 41.42 |