Abstract
We consider a collection of robots which are identical (anonymous), have limited visibility of the environment, and no memory of the past (oblivious); furthermore, they are totally asynchronous in their actions, computations, and movements. We show that, even in such a totally asynchronous setting, it is possible for the robots to gather in the same location in finite time, provided they have a compass.
Author supplied keywords
Cite
CITATION STYLE
Flocchini, P., Prencipe, G., Santoro, N., & Widmayer, P. (2001). Gathering of asynchronous oblivious robots with limited visibility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2010, pp. 247–258). Springer Verlag. https://doi.org/10.1007/3-540-44693-1_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
