Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
Information and Computation
Robot navigation with range queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Navigating in Unfamiliar Geometric Terrain
SIAM Journal on Computing
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Optimal on-line algorithms for walking with minimum number of turns in unknown streets
Computational Geometry: Theory and Applications
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Going Home Through an Unknown Street
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Searching Rectilinear Streets Completely
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Performance bounds for planning in unknown terrain
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Searching and on-line recognition of star-shaped polygons
Information and Computation
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √2, thus matching the best lower bound known before. This finally settles an interesting open problem in the area of competitive path planning many authors have been working on.