Advertisement

Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots

  • Roberto Baldoni
  • François Bonnet
  • Alessia Milani
  • Michel Raynal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)

Abstract

Graph exploration by robots. The graph exploration problem consists in making one or several mobile entities visit each vertex of a connected graph. The mobile entities are sometimes called agents or robots (in the following we use the word “robot”). The exploration is perpetual if the robots have to revisit forever each vertex of the graph. Perpetual exploration is required when robots have to move to gather continuously evolving information or to look for dynamic resources (resources whose location changes with time). If nodes and edges have unique labels, the exploration is relatively easy to achieve.

Keywords

Mobile Robot Connected Graph Mutual Exclusion Dynamic Resource State Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: Anonymous Graph Exploration without Collision by Mobile Robots. Tech Report #1886, 10 pages. IRISA, Université de Rennes 1, France (2008), ftp.irisa.fr/techreports/2008/PI-1886.pdf
  2. 2.
    Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: On the Solvability of Anonymous Partial Grids Eploration by Mobile Robots. Tech Report #1892, 21 pages. IRISA, Université de Rennes 1, France (2008), ftp.irisa.fr/techreports/2008/PI-1892.pdf

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Roberto Baldoni
    • 1
  • François Bonnet
    • 2
  • Alessia Milani
    • 3
  • Michel Raynal
    • 2
  1. 1.Università di Roma “La Sapienza”Italy
  2. 2.IRISAUniversité de RennesFrance
  3. 3.LADyR, GSyCUniversidad Rey Juan CarlosSpain

Personalised recommendations