Abstract

This paper presents an efficient planning algorithm, called Direct-Projection Rapidly-exploring Random Tree (DP-RRT), to address the motion planning with end-effector pose constraints for anthropomorphic manipulators. The key of this planning problem is to find constraint-satisfying configurations on the constraint manifolds and connect them to generate a collision-free and smooth path. In the previous works, the configurations that satisfy pose constraints are generally calculated by the numerical iteration methods based on Jacobian projection techniques. However, such approaches have many technical challenges, such as joint limits and singularity, many numerical iterations and much computing time. In this work, we propose a Direct Projection method based on the analytic inverse kinematics (IK) that can directly project configurations onto the constraint manifolds instead of the numerical iteration methods. The proposed DP-RRT algorithm combines the Direct Projection method with the Rapidly-exploring Random Tree (RRT) algorithm, where the RRT algorithm is employed to explore the ambient space by growing tree branches, and the Direct Projection method is used to project the tree branches onto the constraint manifolds for constructing a constraint-satisfying path. As the analytic IK solver is used to calculate the constraint-satisfying configurations, the DP-RRT algorithm is characterized by high efficiency and no numerical iteration. Besides, avoiding joint limits and singularity, as well as the smoothness of the end-effector and the joints trajectory are also considered. The effectiveness of the proposed algorithm is demonstrated on the Willow Garage’s PR2 simulation platform in a wide range of pose-constrained cases.

Highlights

  • The manipulator motion planning is one of the challenging problems in the field of robot manipulators, which involves finding a collision-free path under certain constraints from an initial to a goal configuration among a collection of obstacles

  • We focus on the motion planning with pose constraints (MPPC) of anthropomorphic manipulators by a Direct Projection method that can directly find the constraint-satisfying configurations without the numerical iteration

  • The algorithm is to combine the Rapidly-exploring Random Tree (RRT) algorithm with the Direct Projection method, which uses the RRT algorithm to explore the ambient space by growing tree branches, and directly projects the tree branches onto the constraint manifolds for constructing a constraint-satisfying path

Read more

Summary

INTRODUCTION

The manipulator motion planning is one of the challenging problems in the field of robot manipulators, which involves finding a collision-free path under certain constraints from an initial to a goal configuration among a collection of obstacles. In the previous works [6]–[19], the numerical iteration methods based on Jacobian projection techniques have been generally used to generate configurations that satisfy pose constraints. We focus on the motion planning with pose constraints (MPPC) of anthropomorphic manipulators by a Direct Projection method that can directly find the constraint-satisfying configurations without the numerical iteration. The Direct Projection method based on the analytic IK of the anthropomorphic manipulator is proposed to project configurations of the ambient C-space onto the constraint manifolds. Contributions: The proposed DP-RRT algorithm can be applied to solve the general MPPC problems for anthropomorphic robots, which are generally solved by numerical iteration methods based on Jacobian projection techniques. The planning time of the DP-RRT algorithm is significantly reduced, because the analytic IK solver is applied to compute the constraint-satisfying configurations directly

RELATED WORK
POSE CONSTRAINT REPRESENTATION
CONSTRAINT MANIFOLDS
PLANNING EXPERIMENTS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call