14 February 1992 Robot path planning based on variational methods
Author Affiliations +
Proceedings Volume 1613, Mobile Robots VI; (1992) https://doi.org/10.1117/12.135177
Event: Robotics '91, 1991, Boston, MA, United States
Abstract
Several methods for planning paths in a terrain represented by a digital map under different strategies and constraints for an autonomous vehicle are presented. The planning task is formulated as a variational problem in a space with a non-Euclidean metric depending on the applied strategy. The resulting nonlinear Hamilton-Jakobi equation can be approximated by a linear Fokker-Planck equation suitable for analytical calculations. Furthermore, an efficient dynamic programming algorithm is presented with complexity linear in the points of the discretized space. Because of the digitization bias, a second calculation step based on direct optimization can be appended. The method is applied to plan optimal flight paths in three dimensions.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ulrich G. Leuthaeusser, Ulrich G. Leuthaeusser, } "Robot path planning based on variational methods", Proc. SPIE 1613, Mobile Robots VI, (14 February 1992); doi: 10.1117/12.135177; https://doi.org/10.1117/12.135177
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

Dynamic whole-body robotic manipulation
Proceedings of SPIE (May 17 2013)
Integrated local path planning method
Proceedings of SPIE (January 07 2008)
Grasp synthesis for planar and solid objects
Proceedings of SPIE (March 01 1992)

Back to Top