The polygon exploration problem II: The angle hull (1998)

by F Hoffmann, C Icking, R Klein, K Kriegel
Results 1 - 1 of 1

The Polygon Exploration Problem I: A Competitive Strategy

by Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel , 1998
"... 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. ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
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.