The Polygon Exploration Problem I: A Competitive Strategy

摘要

We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed o#-line.