Exploiting capability constraints to solve global, two dimensional path planning problems
Loading...
Authors
Richbourg, R. F.
Zyda, Michael J.
Rowe, Neil Charles
Subjects
Advisors
Date of Issue
1986
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Mobile autonomous vehicles require the capability of planning routes over ranges that are too great to be characterized by local sensor systems. Completion of this task requires some form of map data. Much work has been done concerning planning paths through local areas, those which can be scanned by on-board sensor systems. However, planning paths based on long range map data is a very different problem. Extant solution techniques require the search of discrete, node and link representations which characterize continuous, two dimensional problem environments. The authors assume the availability of topographic data organized into regions of homogenous traversal cost. Given this, they present a solution technique for the long range planning problem which relies on a Snell's Law heuristic to limit a graph search for the optimal solution
Type
Article
Description
Series/Report No
Department
Computer Science (CS)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Richbourg, R., N. Rowe, and Michael Zyda. "Exploiting capability constraints to solve global two-dimensional path planning problems." Robotics and Automation. Proceedings. 1986 IEEE International Conference on. Vol. 3. IEEE, 1986.
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.