1
results found
In the distributed localisation problem (DLP), n anonymous robots (agents) A0, . . . ,An−1 are located at arbitrary points p0, . . . , pn−1 ∈ S, where S is a Euclidean space. Initially, each agent Ai ...
Population Protocols
Distributed Localisation
Spatial Queries
Self-Stabilisation
SinoXiv