Online Exploration of Polygons with Holes
Computational Geometry
2012-07-03 v1 Data Structures and Algorithms
Robotics
Abstract
We study online strategies for autonomous mobile robots with vision to explore unknown polygons with at most h holes. Our main contribution is an (h+c_0)!-competitive strategy for such polygons under the assumption that each hole is marked with a special color, where c_0 is a universal constant. The strategy is based on a new hybrid approach. Furthermore, we give a new lower bound construction for small h.
Keywords
Cite
@article{arxiv.1207.0240,
title = {Online Exploration of Polygons with Holes},
author = {Robert Georges and Frank Hoffmann and Klaus Kriegel},
journal= {arXiv preprint arXiv:1207.0240},
year = {2012}
}
Comments
16 pages, 9 figures, submitted to WAOA 2012