Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction

Abstract : In this paper, we investigate the exclusive perpetual exploration of grid shaped networks using anonymous, oblivious and fully asynchronous robots. Our results hold for robots without sense of direction (i.e. they do not agree on a common North, nor do they agree on a common left and right ; furthermore, the "North" and "left" of each robot is decided by an adversary that schedules robots for execution, and may change between invocations of particular robots). We focus on the minimal number of robots that are necessary and sufficient to solve the problem in general grids. In more details, we prove that three deterministic robots are necessary and sufficient, provided that the size of the grid is nxm with 3<=n<=m or n=2 and m>=4. Perhaps surprisingly, and unlike results for the exploration with stop problem (where grids are "easier" to explore and stop than rings with respect to the number of robots), exclusive perpetual exploration requires as many robots in the ring as in the grid. Furthermore, we propose a classification of configurations such that the space of configurations to be checked is drastically reduced. This pre-processing lays the bases for the automated verification of our algorithm for general grids as it permits to avoid combinatorial explosion.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download
Contributor : François Bonnet <>
Submitted on : Friday, September 23, 2011 - 4:05:46 PM
Last modification on : Tuesday, May 14, 2019 - 11:03:57 AM
Long-term archiving on : Saturday, December 24, 2011 - 2:25:29 AM


Files produced by the author(s)


  • HAL Id : hal-00626155, version 1


François Bonnet, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil. Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction. 2011. ⟨hal-00626155⟩



Record views


Files downloads