Amortized efficiency of list update and paging rules
Communications of the ACM
Theoretical Computer Science
Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
Information and Computation
An efficient strategy for robot navigation in unknown environment
Information Processing Letters
Piecemeal Learning of an Unknown Environment
Machine Learning - Special issue on COLT '93
Parallel searching in the plane
Computational Geometry: Theory and Applications
Searching for the kernel of a polygon—a competitive strategy
Proceedings of the eleventh annual symposium on Computational geometry
Optimal constructions of hybrid algorithms
Journal of Algorithms
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive searching in a generalized street
Computational Geometry: Theory and Applications
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
Teaching, learning and exploration
Teaching, learning and exploration
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
Optimal competitive online ray search with an error-prone robot
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
| Hi-index | 0.00 |
We investigate parallel searching on m concurrent rays. We assume that a target t is located somewhere on one of the rays; we are given a group of m point robots each of which has to reach t. Furthermore, we assume that the robots have no way of communicating over distance. Given a strategy S we are interested in the competitive ratio defined as the ratio of the time needed by the robots to reach t using S and the time needed to reach t if the location of t is known in advance. If a lower bound on the distance to the target is known, then there is a simple strategy which achieves a competitive ratio of 9-independent of m. We show that 9 is a lower bound on the competitive ratio for two large classes of strategies if m=2. If the minimum distance to the target is not known in advance, we show a lower bound on the competitive ratio of 1+2(k+1)^k^+^1/k^k where k=@?logm@? where log is used to denote the base-2 logarithm. We also give a strategy that obtains this ratio.