Evaluation of a New Backtrack Free Path Planning Algorithm for Manipulators

DOI Web Site Web Site 被引用文献1件 参考文献35件

この論文をさがす

説明

This paper evaluates a newly proposed backtrack free path planning algorithm (BFA) for manipulators. BFA is an exact algorithm, i.e. it is resolution complete. Different from existing resolution complete algorithms, its computation time and memory space are proportional to the number of arms. Therefore paths can be calculated within practical and predetermined time even for manipulators with many arms, and it becomes possible to plan complicated motions of multi-arm manipulators in fully automated environments. The performance of BFA is evaluated for 2-dimensional environments while changing the number of arms and obstacle placements. Its performance under locus and attitude constraints is also evaluated. Evaluation results show that the computation volume of the algorithm is almost the same as the theoretical one, i.e. it increases linearly with the number of arms even in complicated environments. Moreover BFA achieves the constant performance independent of environments.

収録刊行物

被引用文献 (1)*注記

もっと見る

参考文献 (35)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ