Cargando…
Gossip-Based Solutions for Discrete Rendezvous in Populations of Communicating Agents
The objective of the rendezvous problem is to construct a method that enables a population of agents to agree on a spatial (and possibly temporal) meeting location. We introduce the buffered gossip algorithm as a general solution to the rendezvous problem in a discrete domain with direct communicati...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4232358/ https://www.ncbi.nlm.nih.gov/pubmed/25397882 http://dx.doi.org/10.1371/journal.pone.0112612 |