探索arXiv:1207.0240
穴付き多角形のオンライン探索
Online Exploration of Polygons with Holes
視覚を持つ移動ロボットが未知の穴付き多角形を探索するためのオンライン戦略を提案し、穴が特別な色でマークされている場合に(h+c_0)!競合の戦略を与えた。
著者: Robert Georges, Frank Hoffmann, Klaus Kriegel
分類: cs.CG, cs.DS, cs.RO
原文アブストラクト
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.
