4.7 Article

Path Planning for Robotic Manipulator in Complex Multi-Obstacle Environment Based on Improved_RRT

Journal

IEEE-ASME TRANSACTIONS ON MECHATRONICS
Volume 27, Issue 6, Pages 4774-4785

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TMECH.2022.3165845

Keywords

Dynamic obstacle avoidance; path planning; rapidly exploring random tree (RRT); robotic manipulator; singularity

Funding

  1. National Key R&D Program of China [2018YFB1308303]
  2. Excellent Youth Foundation of Jiangsu Scientific Committee [BK20211531]
  3. Priority Academic Program Development of Jiangsu Higher Education Institutions

Ask authors/readers for more resources

In this article, the Improved_RRT method is proposed for planning a successful and practically executable path for a manipulator in a complex obstacle environment. The method utilizes collision detection models, hybrid constrained sampling, and an innovative approach of RRT_Connect in collaboration with the artificial potential field method to optimize the path planning process. The improved algorithm is proven to be more robust and efficient in generating safe and optimal obstacle avoidance paths.
To plan a successful and practically executable path for a manipulator in a complex obstacle environment, the Improved_RRT method is proposed. In this article, we develop the collision detection model between the manipulator and obstacle based on the cylinder and sphere bounding box, and the shortest distance between the link and obstacle at each moment is obtained. Afterward, hybrid constrained sampling is used instead of original random sampling. The distribution of nodes obtained by sampling is close to the passages between obstacles. During the sampling process, the forward search process is accelerated. In the expansion, we propose a novel approach of RRT_Connect in collaboration with the artificial potential field method. Meanwhile, the adaptive gravitational field, dynamic step size, and new node constraint strategy are adopted. In the process of expansion, the algorithm uses the information of the environment and nodes to expand to the target area in a short time, which reduces the excessive exploration and collision area expansion. Considering the low success rate of algorithm planning in complex, multi-obstacle and dynamic environments, local minimum processing and a dynamic path planning method are proposed, which generate double trees in the Cartesian and configuration spaces, respectively, for local path replanning. The improved algorithm is more robust to the singular problems of the manipulator, and the path is smoother after pruning optimization. Simulation results show that, compared with other algorithms, the proposed method can effectively plan a safe and optimal obstacle avoidance path with the best comprehensive performance. Experiments on the actual robotic manipulator platform further prove the efficiency of our method.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available