Randomized Query Processing in Robot Path Planning

The subject of this paper is the analysis of a randomized preprocessing scheme that has been used for query processing in robot path planning. The attractiveness of the scheme stems from its general applicability to virtually any path-planning problem, and its empirically observed success. In this paper we initiate a theoretical basis for explaining this empirical success. Under a simple assumption about the configuration space, we show that it is possible to perform preprocessing following which queries can be answered quickly. En route, we consider related problems on graph connectivity in the evasiveness model and art-gallery theorems.

[1]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[2]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[3]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[5]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  John E. Hopcroft,et al.  On the movement of robot arms in 2-dimensional bounded regions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[7]  P. McMullen.  Convex Sets and Their Applications , 1982 .

[8]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[9]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[10]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[11]  John E. Hopcroft,et al.  Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..

[12]  Deborah A. Joseph,et al.  On the complexity of reachability and motion planning questions (extended abstract) , 1985, SCG '85.

[13]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[14]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[15]  Vitit Kantabutra,et al.  New Algorithms for Multilink Robot Arms , 1986, J. Comput. Syst. Sci..

[16]  John E. Hopcroft,et al.  Reducing Multiple Object Motion Planning to Graph Searching , 1984, SIAM J. Comput..

[17]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[18]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[19]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[20]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[21]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[22]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[23]  Henning Tolle,et al.  Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[24]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[25]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[26]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[27]  Lydia E. Kavraki,et al.  Random networks in configuration space for fast path planning , 1994 .

[28]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

[29]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

[30]  G. Kalai,et al.  Guarding galleries where every point sees a large area , 1997 .

[31]  Jean-Paul Laumond,et al.  Algorithms for Robotic Motion and Manipulation , 1997 .

[32]  P. Valtr.  Guarding galleries where no point sees a small area , 1998 .