International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a graph, i.e., visit all the nodes of the graph. The robot has no a priori knowledge of the topology of the graph or of its size. It is known that, for any $k$-state robot, there exists a graph of maximum degree~3 that the robot cannot explore. This paper considers the effects of allowing the system designer to add short labels to the graph nodes in a preprocessing stage, and using these labels to guide the exploration by the robot. We describe an exploration algorithm that given appropriate 2-bit labels (in fact, only 3-valued labels) allows a robot to explore all graphs. Furthermore, we describe a suitable labeling algorithm for generating the re...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
International audienceWe consider the task of exploring graphs with anonymous nodes by a team of non...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
AbstractA finite automaton, simply referred to as a robot, has to explore a graph whose nodes are un...
AbstractA finite automaton, simply referred to as a robot, has to explore a graph whose nodes are un...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
International audienceWe consider the task of exploring graphs with anonymous nodes by a team of non...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
International audienceA finite automaton, simply referred to as a {\em robot}, has to explore a grap...
AbstractA finite automaton, simply referred to as a robot, has to explore a graph whose nodes are un...
AbstractA finite automaton, simply referred to as a robot, has to explore a graph whose nodes are un...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, m...
International audienceWe consider the task of exploring graphs with anonymous nodes by a team of non...