A Novel Feasible Map Algorithm For Efficient Path Planning
暂无分享,去创建一个
This paper discusses a path-planning algorithm, feasible map algorithm ( FMA), for the classical mover's problem in any dimension using a feasible map representation of a configuration space.
[1] Daniel E. Koditschek,et al. The construction of analytic diffeomorphisms for exact robot navigation on star worlds , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[2] Narendra Ahuja,et al. A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..
[3] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[4] D. Koditschek,et al. Robot navigation functions on manifolds with boundary , 1990 .