A Lower Bound for Randomized Searching on m Rays
- 454 Downloads
We consider the problem of on-line searching on m rays. A point robot is assumed to stand at the origin of m concurrent rays one of which contains a goal g that the point robot has to find. Neither the ray containing g nor the distance to g are known to the robot. The only way the robot can detect g is by reaching its location. We use the competitive ratio as a measure of the performance of a search strategy, that is, the worst case ratio of the total distance D R traveled by the robot to find g to the distance D from the origin to g. We present a new proof of a tight lower bound of the competitive ratio for randomized strategies to search on m rays. Our proof allows us to obtain a lower bound on the optimal competitive ratio for a fixed m even if the distance of the goal to the origin is bounded from above. Finally, we show that the optimal competitive ratio converges to 1+2(e α - 1)/α2 m∼1+2·1.544m, for large m where á minimizes the function (e x-1)/x 2.
KeywordsStep Length Competitive Ratio Simple Polygon Goal Position Hiding Strategy
Unable to display preview. Download preview PDF.
- 2.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.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
- 5.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.S. Gal. Search Games. Academic Press, 1980.Google Scholar
- 8.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
- 12.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
- 13.A. López-Ortiz and S. Schuierer. Position-independent near optimal searching and on-line recognition in star polygons. In Proc. 4th Workshop on Algorithms and Data Structures, pages 284–296. LNCS, 1997.Google Scholar
- 15.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.Google Scholar
- 16.S. Schuierer. Efficient robot self-localization in simple polygons. In H. Christensen, H. Bunke, and H. Noltemeier, editors, Sensor Based Intelligent Robots, volume 1724, pages 220–239. LNAI, 1999.Google Scholar
- 18.A. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 18th IEEE Symp. on Foundations of Comp. Sci., pages 222–227, 1977.Google Scholar