Amortized efficiency of list update and paging rules
Communications of the ACM
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
A competitive analysis of algorithms for searching unknown scenes
Computational Geometry: Theory and Applications
Competitive searching in a generalized street
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Searching for the kernel of a polygon—a competitive strategy
Proceedings of the eleventh annual symposium on Computational geometry
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
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
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On-line target searching in bounded and unbounded domains
On-line target searching in bounded and unbounded domains
Position-Independent Street Searching
WADS '99 Proceedings of the 6th 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
Searching and on-line recognition of star-shaped polygons
Information and Computation
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We consider the problem of a robot searching for an unknown, yet visually recognizable target in a street. A street is a simple polygon with start and target on the boundary so that the two boundary chains between them are weakly mutually visible. We are interested in the ratio of the search path length to the shortest path length which is called the competitive ratio of the strategy. We present an optimal strategy whose competitive ratio matches the known lower bound of √2, thereby closing the gap between the lower bound and the best known upper bound.