Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
Walking an unknown street with bounded detour
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A competitive analysis of algorithms for searching unknown scenes
Computational Geometry: Theory and Applications
Information and Computation
Competitive searching in a generalized street
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
An efficient strategy for robot navigation in unknown environment
Information Processing Letters
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Competitive Searching in Polygons - Beyond Generalised Streets
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
An optimal competitive strategy for walking in streets
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An optimal strategy for searching in unknown streets
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
| Hi-index | 0.00 |
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.