Brief Announcement: Infinite Grid Exploration by Disoriented Robots

Abstract : We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycles. They all agree on a common chirality, but have no global compass. Finally, they may use lights of different colors, but except from that, robots have neither persistent memories, nor communication mean. We consider the infinite grid exploration (IGE) problem. We first show that two robots are not sufficient in our settings to solve the problem, even when robots have a common coordinate system. We then show that if the robots' coordinate systems are not self-consistent, three or four robots are not sufficient to solve the problem neither. Finally, we present three algorithms that solve the IGE problem in various settings. The first algorithm uses six robots with constant colors and a visibility range of one. The second one uses the minimum number of robots, i.e., five, as well as five modifiable colors, still under visibility one. The last algorithm requires seven oblivious anonymous robots, yet assuming visibility two. Notice that the two last algorithms also achieve exclusiveness.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Pascal Lafourcade <>
Submitted on : Monday, June 3, 2019 - 1:07:26 PM
Last modification on : Saturday, June 8, 2019 - 1:24:06 AM


Files produced by the author(s)


  • HAL Id : hal-02145822, version 1



Quentin Bramas, Stéphane Devismes, Pascal Lafourcade. Brief Announcement: Infinite Grid Exploration by Disoriented Robots. 26th International Colloquium on Structural Information and Communication Complexity SIROCCO 2019, Jul 2019, L'Aquila, Italy. ⟨hal-02145822⟩



Record views


Files downloads