Fast Path Planning In Unstructured, Dynamic, 3-D Worlds

Martin Herman

doi:10.1117/12.964167

26 March 1986 Fast Path Planning In Unstructured, Dynamic, 3-D Worlds

Martin Herman

Proceedings Volume 0635, Applications of Artificial Intelligence III; (1986) https://doi.org/10.1117/12.964167
Event: 1986 Technical Symposium Southeast, 1986, Orlando, United States

Abstract

Issues dealing with fast motion planning in unstructured, dynamic 3-D worlds are discussed, and a fast path planning system under development at NBS is described. It is argued that an octree representation of the obstacles in the world leads to fast path planning algorithms. The system we are developing performs the path search in an octree space, and uses a hybrid search technique that combines hypothesize and test, hill climbing, A*, and multiresolution grid search.

Citation Download Citation

Martin Herman "Fast Path Planning In Unstructured, Dynamic, 3-D Worlds", Proc. SPIE 0635, Applications of Artificial Intelligence III, (26 March 1986); https://doi.org/10.1117/12.964167

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