Lacaze, A.
(2002),
Hierarchical Planning Algorithms, SPIE 16th Annual International Symposium on Aerospace/Defense Sensing, Simulation and Controls, Orlando, FL, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=821734
(Accessed December 14, 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.
Hierarchical Planning Algorithms
Published
Author(s)
Abstract
A novel method for communicating commands in hierarchical planning control is presented. This new method can be used to warranty that plans created will be optimal within the defined planning graphs throughout the planning hierarchy. Boundary conditions are specified so that optimality can be warranted. Specific hierarchical planning examples are given for a group of off-road autonomous ground vehicles.Conference Dates
April 1-5, 2002
Conference Location
Orlando, FL
Conference Title
SPIE 16th Annual International Symposium on Aerospace/Defense Sensing, Simulation and Controls
Pub Type
Conferences
Download Paper
Keywords
autonomous ground vehicle, boundary conditions, hierarchical control, operations research, planning, robotics, search, shortest path
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created April 5, 2002, Updated February 19, 2017