Path planning using a potential field representation
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 648-649
- https://doi.org/10.1109/robot.1988.12131
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Real-time obstacle avoidance for manipulators and mobile robotsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fast, three-dimensional, collision-free motion planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Robot path planning using intersecting convex shapesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Motion Planning with Six Degrees of Freedom. RevisionPublished by Defense Technical Information Center (DTIC) ,1984
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983