3 search results - page 1 / 1 » Watchman tours for polygons with holes |
CCCG
2010
13 years 6 months ago
2010
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...
CCCG
2007
13 years 6 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...