A Variational Dynamic Programming Approach to Robot-Path Planning With a Distance-Safety Criterion

IEEE Journal on Robotics and Automation

Volumn 4, Issue 3, 1988, Pages 334-349

  Suh, Suk Hwan ^a   Shin, Kang G ^b  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING, DYNAMIC - APPLICATIONS;

FREE WORKSPACE AS CHANNELS REPRESENTATION; NEAR-OPTIMAL PATH; ROBOT-PATH PLANNING; WEIGHTED DISTANCE-SAFETY CRITERION;

ROBOTS, INDUSTRIAL;

EID: 0024032173     PISSN: 08824967     EISSN: None     Source Type: Journal    
DOI: 10.1109/56.794     Document Type: Article

References (13)

1. M. Athans and P. L. Falb, Optimal Control, An Introduction to the Theory and Its Application. New York, NY: McGraw-Hill, 1966.
2. R. A. Brooks, “Solving the find-path problem by good representation of free space,” IEEE Trans. Syst., Man, Cybern., vol. SMC-13, no. 3, pp. 190-197, Mar./Apr. 1983.
3. R. Chatila, “Path planning and environmental learning in a mobile robot system,” in Proc. European Conf. on Artificial Intelligence (Orsay, France, 1982).
4. D. E. Kirk, Optimal Control Theory: An Introduction. Englewood Cliffs, NJ: Prentice-Hall, 1970.
5. D. T. Kuan, J. C. Zamiska, and R. A. Brooks, “Natural decomposition of free space for path planning,” in Proc. Int. Conf. on Robotics Automation (St. Louis, MO, Mar. 1985), pp. 168-173.
6. E. G. Gilbert and D. W. Johnson, “Distance functions and their application to robot path planning in the presence of obstacles,” IEEE J. Robotics Automat., vol. RA-1, no. 1, pp. 21-30, Mar. 1985.
7. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi, “A fast procedure for computing the distance between complex objects in three-dimensional space,” IEEE J. Robotics Automat., vol. 4, no. 2, pp. 193-203, Apr. 1988.
8. D. T. Lee and R. L. Drysdale, “Generalization of Voronoi diagrams in the plane,” SIAMJ. Comput., vol. 10, no. 1, pp. 73-87, Feb. 1981.
9. T. Lozano-Perez and M. A. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles,” Commun. ACM, vol. 22, no. 10, pp. 560-570, Oct. 1979.
10. J. Mitchell and C. Papadimitriou, “Planning shortest paths,” Tech. Rep., Dept. Operations Research, Stanford Univ., Stanford, CA.
11. K. G. Shin and N. D. Mckay, “Selection of near-minimum time geometric paths for robotic manipulators,” IEEE Trans. Automat. Contr., vol. AC-31, no. 6, pp. 501-511, June 1986.
12. J. S. Singh and M. D. Wagh, “Robot path planning using intersecting convex shapes: Analysis and simulation,” IEEE J. Robotics Automat., vol. RA-3, no. 2, pp. 101-108, Apr. 1987.
13. C. E. Thrope, “Path relaxation: Path planning for a mobile robot,” Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-RI-TR-84-5, 1984.