Parallel Searching on m Rays

  • Mikael Hammar
  • Bengt J. Nilsson
  • Sven Schuierer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1563)

Abstract

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 /kk where k = [log m]. We also give a strategy that obtains this ratio.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 106:234–252, 1993.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    R. Baeza-Yates and R. Schott. Parallel searching in the plane. Comput. Geom. Theory Appl., 5:143–154, 1995.MATHMathSciNetGoogle Scholar
  3. [3]
    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
  4. [4]
    K-F. Chan and T. W. Lam. An on-line algorithm for navigating in an unknown environment. International Journal of Computational Geometry & Applications, 3:227–244, 1993.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    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
  6. [6]
    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
  7. [7]
    S. Gal. Search Games. Academic Press, 1980.Google Scholar
  8. [8]
    Ch. Hipke. Online-Algorithmen zur kompetitiven Suche in einfachen Polygonen. Master’s thesis, Universität Freiburg, 1994.Google Scholar
  9. [9]
    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
  10. [10]
    R. Klein. Walking an unknown street with bounded detour. Comput. Geom. Theory Appl., 1:325–351, 1992.MATHGoogle Scholar
  11. [11]
    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
  12. [12]
    A. López-Ortiz. On-line Searching on Bounded and Unbounded Domains. PhD thesis, Department of Computer Science, University of Waterloo, 1996.Google Scholar
  13. [13]
    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
  14. [14]
    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
  15. [15]
    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
  16. [16]
    C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. In Proc. 16th Internat. Colloq. Automata Lang. Program., volume 372 of Lecture Notes in Computer Science, pages 610–620. Springer-Verlag, 1989.CrossRefGoogle Scholar
  17. [17]
    S. Schuierer. Lower bounds in on-line geometric searching. In Proc. of the 11th Intern. Symp. on Fundamentals of Computation Theory, pages 429–440. LNCS 1279, 1997.CrossRefGoogle Scholar
  18. [18]
    S. Schuierer. On-line searching in geometric trees. In Proc. 9th Canadian Conf. on Computational Geometry, pages 135–140, 1997.Google Scholar
  19. [19]
    D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Mikael Hammar
    • 1
  • Bengt J. Nilsson
    • 1
  • Sven Schuierer
    • 2
  1. 1.Department of Computer ScienceLund UniversityLundSweden
  2. 2.Institut für InformatikFreiburgGermany

Personalised recommendations