Randomized robot navigation algorithms

We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We assume the robot has no prior knowledge about the positions or sizes of the obstacles, and acquires such knowledge only when obstacles are encountered. Our goal is to minimize the distance the robot must travel, using the competitive ratio as our measure. We give a new randomized algorithm for this prob lem whose competitive ratio is O(n6 logn), beating the deterministic st(,/$ lower bound of [PY], and answering in the affirmative an open question of [BRS] (which presented an optimal deterministic algorithm). We believe the techniques introduced here may prove useful in other on-line situations in which information gathering is part of the on-line process.

[1]  Yuval Rabani,et al.  Lower Bounds for Randomized k-Server and Motion-Planning Algorithms , 1994, SIAM J. Comput..

[2]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[3]  Yuval Rabani,et al.  Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.

[4]  Baruch Schieber,et al.  Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..

[5]  Amos Fiat,et al.  Online Navigation in a Room , 1992, J. Algorithms.

[6]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[7]  Saharon Shelah,et al.  Expected Computation Time for Hamiltonian Path Problem , 1987, SIAM J. Comput..

[8]  Avrim Blum,et al.  An on-line algorithm for improving performance in navigation , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[9]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

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

[11]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[12]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[13]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[14]  Amos Fiat,et al.  On-Line Navigation in a Room , 1992, SODA.

[15]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[16]  Allan Borodin,et al.  On the power of randomization in online algorithms , 1990, STOC '90.

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

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

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