Exploiting capability constraints to solve global two-dimensional path planning problems
Open Access
- 1 January 1986
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 90-95
- https://doi.org/10.1109/robot.1986.1087656
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. We assume the availability of topographic data organized into regions of homogeneous traversal cost. Given this, we 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.Keywords
This publication has 5 references indexed in Scilit:
- Path Relaxation: Path Planning for a Mobile RobotPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Adaptive Locomotion of a Multilegged Robot over Rough TerrainIEEE Transactions on Systems, Man, and Cybernetics, 1979