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
Information and Computation
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
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth 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
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
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 |
A polygon P is a street if there exist points (u, v) on the boundary such that P is weakly visible from any path from u to v. Optimal strategies have been found for on-line searching of streets provided that the starting position of the robot is s = u and the target is located at t = v. Thus a hiding target could foil the strategy of the robot by choosing its position t in such a manner as not to realize a street. In this paper we introduce a strategy with a constant competitive ratio to search a street polygon for a target located at an arbitrary point t on the boundary, starting at any other arbitrary point s on the boundary. We also provide lower bounds for this problem. This makes streets only the second non-trivial class of polygons (after stars) known to admit a constant-competitive-ratio strategy in the general position case.