Gathering of Asynchronous Oblivious Robots with Limited Visibility

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.

• Type: Conference
• Year: 2001
• Where: STACS
• Authors: Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
• Keywords: Asynchronous, Robots, STACS 2001, Theoretical Computer Science, Visibility