Parallel Searching on m Rays
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 = [log m]. We also give a strategy that obtains this ratio.
Unable to display preview. Download preview PDF.
- Margrit Betke, Ronald L. Rivest, and Mona Singh. Piecemeal learning of an unknown environment. In Sixth ACM Conference on Computational Learning Theory (COLT 93), pages 277–286, July 1993.Google Scholar
- A. Datta, Ch. Hipke, and S. Schuierer. Competitive searching in polygons—beyond generalized streets. In Proc. Sixth Annual International Symposium on Algorithms and Computation, pages 32–41. LNCS 1004, 1995.Google Scholar
- A. Datta and Ch. Icking. Competitive searching in a generalized street. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 175–182, 1994.Google Scholar
- S. Gal. Search Games. Academic Press, 1980.Google Scholar
- Ch. Hipke. Online-Algorithmen zur kompetitiven Suche in einfachen Polygonen. Master’s thesis, Universität Freiburg, 1994.Google Scholar
- Christian Icking and Rolf Klein. Searching for the kernel of a polygon: A competitive strategy. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 258–266, 1995.Google Scholar
- J. M. Kleinberg. On-line search in a simple polygon. In Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, pages 8–15, 1994.Google Scholar
- A. López-Ortiz. On-line Searching on Bounded and Unbounded Domains. PhD thesis, Department of Computer Science, University of Waterloo, 1996.Google Scholar
- A. López-Ortiz and S. Schuierer. Going home through an unknown street. In S. G. Akl, F. Dehne, and J.-R. Sack, editors, Proc. 4th Workshop on Algorithms and Data Structures, pages 135–146. LNCS 955, 1995.Google Scholar
- A. López-Ortiz and S. Schuierer. Generalized streets revisited. In M. Serna J. Diaz, editor, Proc. 4th European Symposium on Algorithms, pages 546–558. LNCS 1136, 1996.Google Scholar
- A. Mei and Y. Igarashi. Efficient strategies for robot navigation in unknown environment. In Proc. of 21st Intl. Colloquium on Automata, Languages and Programming, pages 630–641, 1994.Google Scholar
- S. Schuierer. On-line searching in geometric trees. In Proc. 9th Canadian Conf. on Computational Geometry, pages 135–140, 1997.Google Scholar