Task constrained motion planning for 7-degree of freedom manipulators with parameterized submanifolds

This paper aims to use the redundancy of a 7-DOF (degree of freedom) serial manipulator to solve motion planning problems along a given 6D Cartesian tool path, in the presence of geometric constraints, namely, obstacles and joint limits.

This paper describes an explicit expression of the task submanifolds for a 7-DOF redundant robot, and the submanifolds can be parameterized by two parameters with this explicit expression. Therefore, the global search method can find the feasible path on this parameterized graph.

The proposed planning algorithm is resolution complete and resolution optimal for 7-DOF manipulators, and the planned path can satisfy task constraint as well as avoiding singularity and collision. The experiments on Motoman SDA robot are reported to show the effectiveness.

This algorithm is still time-consuming, and it can be improved by applying parallel collision detection method or lazy collision detection, adopting new constraints and implementing more effective graph search algorithms.

Compared with other task constrained planning methods, the proposed algorithm archives better performance. This method finds the explicit expression of the two-dimensional task sub-manifolds, so it’s resolution complete and resolution optimal.