We consider the on-line navigation problem of a robot inside an unknown polygon P. The robot has to find a path from a starting point to an unknown goal point and it is equipped with on-board cameras through which it can get the visibility map of its immediate surroundings. It is known that if P is a street with respect to two points s and t then starting at s the robot can find t with a constant competitive ratio. In this paper we consider the case where the robot is inside a rectilinear street but looks for an arbitrary goal point g instead of t. Furthermore, it may start at some point different from s. We show that in both cases a constant competitive ratio can be achieved and establish lower bounds for this ratio. If the robot starts at s, then our lower and upper bound match, that is, our algorithm is optimal.
CITATION STYLE
Bröcker, C. A., & Schuierer, S. (1999). Searching rectilinear streets completely. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1663, pp. 98–109). Springer Verlag. https://doi.org/10.1007/3-540-48447-7_12
Mendeley helps you to discover research relevant for your work.