### Abstract

We study the sensor and movement capabilities that simple robots need in order to create a map of an unknown polygon of size n, and to meet. We consider robots that can move from vertex to vertex, can backtrack movements, and see distant vertices in counter-clockwise order but have no means of visibly identifying them. We show that such robots can always solve the weak rendezvous problem and reconstruct the visibility graph, given an upper bound on n. Our results are tight: the strong rendezvous problem, in which robots need to gather at a common location, cannot be solved in general, and without a bound on n, not even n can be determined. In terms of mobile agents exploring a graph, our result implies that they can reconstruct any graph that is the visibility graph of a simple polygon. This is in contrast to the known result that the reconstruction of arbitrary graphs is impossible in general, even if n is known.

Original language | English |
---|---|

Title of host publication | Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC) |

Pages | 229-239 |

Number of pages | 11 |

DOIs | |

Publication status | Published - 2010 |

Externally published | Yes |

## Cite this

Chalopin, J., Das, S., Disser, Y., Mihalák, M., & Widmayer, P. (2010). How Simple Robots Benefit from Looking Back. In

*Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC)*(pp. 229-239) https://doi.org/10.1007/978-3-642-13073-1_21