A fast collision-free path planning method for a general robot manipulator
暂无分享,去创建一个
We propose a practical path planning method that can find collision-free paths quickly for a general robot manipulator. The proposed method repeats the global search and serial local search. The global search tries to find a sequence of intermediate goals (sub-goals). The serial local search tries to sequentially find local paths between each two adjacent sub-goals. When serial local search fails to find one of local paths, the method backtracks to the global search. The main feature is that the search range for each local search is restricted and is gradually enlarged at re-trials. We conducted simulations in 3D C-space. The result shows that proposed method can find paths 200 times faster than traditional discrete C-space method.
[1] Yong K. Hwang,et al. SANDROS: a motion planner with performance proportional to task difficulty , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[2] Koichi Kondo,et al. Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..
[3] Tsutomu Hasegawa,et al. Collision avoidance: divide-and-conquer approach by space characterization and intermediate goals , 1988, IEEE Trans. Syst. Man Cybern..