Searching in the Plane

In this paper we initiate a new area of study dealing with the best way to search a possibly unbounded region for an object. The model for our search algorithms is that we must pay costs proportional to the distance of the next probe position relative to our current position. This model is meant to give a realistic cost measure for a robot moving in the plane. We also examine the effect of decreasing the amount of a priori information given to search problems. Problems of this type are very simple analogues of non-trivial problems on searching an unbounded region, processing digitized images, and robot navigation. We show that for some simple search problems, knowing the general direction of the goal is much more informative than knowing the distance to the goal.

[1]  Z. A. Melzak.  Companion to concrete mathematics : mathematical techniques and various applications , 1973 .

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

[3]  T H O'Beirne.  Tomorrow's Math–Unsolved Problems for the Amateur , 1963 .

[4]  Jeffrey Shallit.  A Minimization Problem , 1994, SIAM Rev..

[5]  B. Gluss.  The minimax path in a search for a circle in a plane , 1961 .

[6]  Michael E. Saks,et al.  On a search problem related to branch-and-bound procedures , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[7]  C. Ogilvy,et al.  Tomorrow's math; unsolved problems for the amateur , 1964, Canadian Mathematical Bulletin.

[8]  Joel H. Spencer,et al.  Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..

[9]  Jan Mycielski,et al.  The shortest curve that meets all the lines that meet a convex body , 1986 .

[10]  Prabhakar Raghavan,et al.  Random walks on weighted graphs, and applications to on-line algorithms , 1990, STOC '90.

[11]  Shi-Kuo Chang.  A triangular scanning technique for locating boundary curves , 1974, Comput. Graph. Image Process..

[12]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, ICALP.

[13]  Henri Joris.  Le chasseur perdu dans la forêt , 1980 .

[14]  M. Goldberg.  A Minimization Problem , 1981 .

[15]  Andrew Chi-Chih Yao,et al.  An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..

[16]  J. R. Isbell.  An optimal search pattern , 1957 .

[17]  B. Gluss.  An alternative solution to the “lost at sea” problem , 1961 .

[18]  Prabhakar Raghavan,et al.  Random walks on weighted graphs and applications to on-line algorithms , 1993, JACM.

[19]  Allan Borodin,et al.  An optimal online algorithm for metrical task systems , 1987, STOC.