A variational dynamic programming approach to robot-path planning with a distance-safety criterion
- 1 June 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Robotics and Automation
- Vol. 4 (3), 334-349
- https://doi.org/10.1109/56.794
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Natural decomposition of free space for path planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- Robot path planning using intersecting convex shapes: Analysis and simulationIEEE Journal on Robotics and Automation, 1987
- Selection of near-minimum time geometric paths for robotic manipulatorsIEEE Transactions on Automatic Control, 1986
- Distance functions and their application to robot path planning in the presence of obstaclesIEEE Journal on Robotics and Automation, 1985
- 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
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979