A continuation method for nonholonomic path-finding problems
暂无分享,去创建一个
We study the mathematical theory of an algorithm for nonholonomic point-to-point path finding, based on a "continuation" or "deformation" method, in which one starts with an admissible trajectory that goes from the desired initial point p~ to some point q~/sub 0/, and then tries to construct a one-parameter family of trajectories, whose terminal points q~/sub s/ describe, as s varies, a path that joins q/sub 0/ to the desired terminal point q~.<<ETX>>
[1] R. Strichartz. Sub-Riemannian geometry , 1986 .
[2] R. Strichartz. Corrections to: ``Sub-Riemannian geometry'' , 1989 .
[3] H. Sussmann. New Differential Geometric Methods in Nonholonomic Path Finding , 1992 .
[4] John T. Wen,et al. A global approach to path planning for redundant manipulators , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.