Path Planning Using Potential Field Representation

Yong Koo Hwang; Narendra Ahuja

doi:10.1117/12.947010

29 March 1988 Path Planning Using Potential Field Representation

Yong Koo Hwang, Narendra Ahuja

Proceedings Volume 0937, Applications of Artificial Intelligence VI; (1988) https://doi.org/10.1117/12.947010
Event: 1988 Technical Symposium on Optics, Electro-Optics, and Sensors, 1988, Orlando, FL, United States

Abstract

Finding a safe, smooth, and efficient path to move an object through obstacles is necessary for object manipulation in robotics and automation. This paper presents an approach to two-dimensional as well as three-dimensional findpath problems that divides the problem into two steps. First, rough paths are found based only on topological information. This is accomplished by assigning to each obstacle an artificial potential similar to the electrostatic potential to prevent the moving object from colliding with the obstacles, and then locating minimum potential valleys. Second, 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. The first algorithm simply minimizes a weighted sum of the path length and the total potential experienced by the moving object along the path. This algorithm solves only "easy" problems where the free space between the obstacles is wide. The other two algorithms are developed to handle the problems in which intelligent maneuvering of the moving object among tightly packed obstacles is necessary. These three algorithms based on potential fields are nearly complete in scope, and solve a large variety of problems.

Citation Download Citation

Yong Koo Hwang and Narendra Ahuja "Path Planning Using Potential Field Representation", Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); https://doi.org/10.1117/12.947010

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available