Paper Info
Title
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
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.
Year
DOI
Venue
2008
10.1007/978-3-540-87779-0_34
DISC
Keywords
Field
DocType
mobile robots,unique label,dynamic resource,connected graph,graph exploration problem,anonymous partial grids exploration,perpetual exploration,brief announcement,location change,graph exploration,mobile entity,mobile robot
Graph,Vertex (geometry),Computer science,Exploration problem,Artificial intelligence,Robot,Connectivity,Mutual exclusion,Mobile robot,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
2
Authors
4
Name
Order
Citations
PageRank
Roberto Baldoni11606132.37
François Bonnet2806.65
Alessia Milani318715.54
Michel Raynal44078349.46