Memoryless Gathering of Mobile Robotic Sensors
Years and Authors of Summarized Original Work
2005; Flocchini, Prencipe, Santoro, Widmayer
1999; Ando, Oasa, Suzuki, Yamashita
The Model: A mobile robotic sensor (or simply sensor) is modeled as a computational unit with sensorial capabilities: it can perceive the spatial environment within a fixed distance V > 0, called visibility range, it has its own local working memory, and it is capable of performing local computations [3, 4].
Each sensor is a point in its own local Cartesian coordinate system (not necessarily consistent with the others), of which it perceives itself as the center. A sensor can move in any direction, but it may be stopped before reaching its destination, e.g. because of limits to its motion energy; however, it is assumed that the distance traveled in a move by a sensor is not infinitesimally small (unless it brings the sensor to its destination).
The sensors have no means of direct communication: any communication occurs in an implicit manner,...
KeywordsGathering Sensors aggregation Rendezvous
- 3.Flocchini P, Prencipe G, Santoro N (2011) Computing by mobile robotic sensors. In: Nikoletseas S, Rolim J (eds) Theoretical aspects of distributed computing in sensor networks, chap 21. Springer, Heidelberg. ISBN:978-3-642-14849-1Google Scholar
- 4.Flocchini P, Prencipe G, Santoro N (2012) Distributed computing by oblivious mobile robots. Morgan & Claypool, San RafaelGoogle Scholar
- 5.Katreniak B (2011) Convergence with limited visibility by asynchronous mobile robots. In: 18th international colloquium on structural information and communication complexity (SIROCCO), Gdańsk, Poland, pp 125–137Google Scholar
- 7.Pagli L, Prencipe G, Viglietta G (2012) Getting close without touching. In: 19th international colloquium on structural information and communication complexity (SIROCCO), Reykjavík, Iceland, pp 315–326Google Scholar