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 + c0)!-competitive strategy for such polygons under the assumption that each hole is marked with a special color, where c0 is a universal constant. The strategy is based on a new hybrid approach. Furthermore, we give new lower bounds for h = 1. © Springer-Verlag 2013.
Author supplied keywords
Cite
CITATION STYLE
Georges, R., Hoffmann, F., & Kriegel, K. (2013). Online exploration of polygons with holes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7846 LNCS, pp. 56–69). https://doi.org/10.1007/978-3-642-38016-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
