Path planning using a potential field representation

An approach to two-dimensional as well as three-dimensional findpath problems that divides each problem into two steps is presented. Rough paths are found based only on topological information. This is accomplished by assigning to each obstacle an artificial potential similar to electrostatic potential to prevent the moving object from colliding with the obstacles, and then locating minimum-potential valleys. The paths defined by the minimum-potential valleys are modified to obtain an optimal collision-free path and orientations of the moving object along the path. Three algorithms are given to accomplish this second step. These three algorithms based on potential fields are nearly complete in scope, and solve a large variety of problems.<<ETX>>

[1]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

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

[3]  B. Donald.  Motion Planning with Six Degrees of Freedom , 1984 .

[4]  Rodney A. Brooks,et al.  Solving the find-path problem by good representation of free space , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Martin Herman,et al.  Fast, three-dimensional, collision-free motion planning , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[6]  Meghanad D. Wagh,et al.  Robot path planning using intersecting convex shapes , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.