Lower bounds in on-line geometric searching

Abstract We present a new technique to prove lower bounds for geometric on-line searching problems. We assume that a target of unknown location is hidden somewhere in a known environment and a searcher is trying to find it. We are interested in lower bounds on the competitive ratio of the search strategy, that is, the ratio of the distance traveled by the searcher to the distance of the target. The technique we present is applicable to a number of problems, such as biased searching on m rays and on-line construction of on-line algorithms. For each problem we prove tight lower bounds.

[1]  M. Beck,et al.  Son of the linear search problem , 1984 .

[2]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[3]  Bengt J. Nilsson,et al.  Parallel searching on m rays , 1999, Comput. Geom..

[4]  Wallace Franck,et al.  On the optimal search problem , 1965 .

[5]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[6]  Rolf Klein,et al.  How to Find a Point on a Line Within a Fixed Distance , 1999, Discret. Appl. Math..

[7]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[8]  Vicki L. Wilkins,et al.  Teaching , 2001, Transcultural Graffiti.

[9]  Mihalis Yannakakis,et al.  Searching a Fixed Graph , 1996, ICALP.

[10]  A. Beck,et al.  The return of the linear search problem , 1973 .

[11]  Ming-Yang Kao,et al.  Optimal constructions of hybrid algorithms , 1994, SODA '94.

[12]  Alejandro López-Ortiz,et al.  Generalized Streets Revisited , 1996, ESA.

[13]  R. Bellman.  An Optimal Search , 1963 .

[14]  Xuemin Lin,et al.  Performance Guarantees for Motion Planning with Temporal Uncertainty , 1993, Aust. Comput. J..

[15]  Alejandro López-Ortiz,et al.  The ultimate strategy to search on m rays? , 2001, Theor. Comput. Sci..

[16]  Rolf Klein,et al.  Algorithmische Geometrie , 1997 .

[17]  Micah Beck,et al.  The revenge of the linear search problem , 1992 .

[18]  Yossi Azar,et al.  On-line choice of on-line algorithms , 1993, SODA '93.

[19]  S. Gal.  A general search game , 1972 .

[20]  Peter J. Rousseeuw.  Optimal search paths for random variables , 1983 .

[21]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[22]  A. Beck.  On the linear search problem , 1964 .

[23]  A. Beck.  More on the linear search problem , 1965 .

[24]  Micah Beck,et al.  The linear search problem rides again , 1986 .

[25]  Shmuel Gal,et al.  Errata: On the Optimality of the Exponential Functions for Some Minimax Problems , 1976 .

[26]  P. Hudson.  Search Games , 1982 .

[27]  Shmuel Gal.  Minimax Solutions for Linear Search Problems , 1974 .

[28]  D. Newman,et al.  Yet more on the linear search problem , 1970 .