Herman, M.
(1986),
Fast Path Planning in Unstructured, Dynamic, 3-D Worlds, Proceedings of SPIE Conference on Applications of Artificial Intelligence III, Orlando, FL, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=820183
(Accessed July 18, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Fast Path Planning in Unstructured, Dynamic, 3-D Worlds
Published
Author(s)
Abstract
Issues dealing with fast motion planning in unstructured, dynamic 3-D worlds are discussed, and a fast path planning system under the development at NBS is described. It is agued 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.Proceedings Title
Proceedings of SPIE Conference on Applications of Artificial Intelligence III
Conference Dates
April 1, 1986
Conference Location
Orlando, FL
Conference Title
Conference on Applications of Artificial Intelligence III
Pub Type
Conferences
Download Paper
Keywords
Image Processing, Octrees
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created April 21, 1986, Updated February 17, 2017