Numerical potential field techniques for robot path planning

The authors investigate a path planning approach that consists of concurrently building and searching a graph connecting the local minima of a numerical potential field defined over the robot's configuration space. They describe techniques for constructing 'good' potentials and efficient methods for dealing with the local minima of these functions. These techniques have been implemented in fast planners that can deal with single and/or multiple robot systems with few and/or many degrees of freedom. Some experimental results with these planners are described.<<ETX>>

[1]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[2]  Robert F. Anderson,et al.  Small Random perturbation of dynamical systems with reflecting boundary , 1976, Nagoya Mathematical Journal.

[3]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[4]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[5]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[6]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.

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

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  L. Gouzenes.  Strategies for Solving Collision-free Trajectories Problems for Mobile and Manipulator Robots , 1984 .

[11]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[13]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[14]  Bernard Faverjon.  Object level programming of industrial robots , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[15]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[16]  Chee-Keng Yap,et al.  Algorithmic and geometric aspects of robotics , 1987 .

[17]  Bruce Randall Donald,et al.  A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..

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

[19]  R. A. Jarvis,et al.  An automated guided vehicle with map building and path finding capabilities , 1988 .

[20]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[21]  Daniel E. Koditschek,et al.  Robot planning and control via potential functions , 1989 .

[22]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[23]  D. Koditschek,et al.  The construction of analytic diffeomorphisms for exact robot navigation on star worlds , 1991 .

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

[25]  Jean-Claude Latombe,et al.  Robot motion planning with many degrees of freedom and dynamic constraints , 1991 .

[26]  Jean-Claude Latombe,et al.  New heuristic algorithms for efficient hierarchical path planning , 1991, IEEE Trans. Robotics Autom..

[27]  Jean-Claude Latombe.  A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.