Skip to Main content Skip to Navigation

On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots

Abstract : Given an arbitrary partial anonymous grid (a finite grid with possibly missing vertices or edges), this paper focuses on the exploration of such a grid by a set of mobile anonymous agents (called robots). Assuming that the robots can move synchronously, but cannot communicate with each other, the aim is to design an algorithm executed by each robot that allows, as many robots as possible (let k be this maximal number), to visit infinitely often all the vertices of the grid, in such a way that no vertex hosts more than one robot at a time, and each edge is traversed by at most one robot at a time. The paper addresses this problem by considering a central parameter, denoted p, that captures the view of each robot. More precisely, it is assumed that each robot sees the part of the grid (and its current occupation by other robots, if any) centered at the vertex it currently occupies and delimited by the radius p. Based on such a radius notion, the paper investigates the following cases and presents associated results. It first shows that there is no solution (i.e., k = 0) when = 0. It then shows that k p
Document type :
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Tuesday, May 6, 2008 - 10:31:24 AM
Last modification on : Thursday, January 20, 2022 - 5:29:38 PM
Long-term archiving on: : Friday, May 28, 2010 - 6:29:08 PM


Files produced by the author(s)


  • HAL Id : inria-00277344, version 1


Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal. On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. [Research Report] PI 1892, 2008, pp.21. ⟨inria-00277344⟩



Record views


Files downloads