Path Planning of Redundant Series Manipulators Based on Improved RRT Algorithms

Aiming at the path planning problem of the redundant manipulator with seven degrees of freedom, this paper presents a new algorithm based on improved RRT (Rapidly-exploring Random Tree algorithm), Gm-RRT algorithm. The new algorithm performs path planning in the joint space of the robot to improve the efficiency of the planning. The new algorithm combines the target probability offset to improve the orientation of the growth of extended random trees; uses the method of generating random points instead of single random points to improve the computational efficiency of path planning; and introduces the method of adaptive virtual gravity of targets to ensure the balance of the new algorithm in target orientation and exploration to the surrounding space. Lastly, a simulation experiment is carried out on the MATLAB platform. The results show that the improved algorithm has advantages in time and keeps the algorithm concise.

[1]  S. LaValle,et al.  Sampling-Based Motion Planning With Differential Constraints , 2005 .

[2]  Baris Akgün,et al.  Sampling heuristics for optimal motion planning in high dimensions , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Yasar Ayaz,et al.  Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments , 2015, Robotics Auton. Syst..

[4]  Marco Pavone,et al.  Learning Sampling Distributions for Robot Motion Planning , 2017, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[5]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[6]  Bingyin Ren,et al.  A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm , 2018, Sensors.

[7]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1998, IEEE Trans. Robotics Autom..

[8]  Sylvia C. Wong,et al.  A topological coverage algorithm for mobile robots , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[9]  Leonidas J. Guibas,et al.  Visibility-polygon search and euclidean shortest paths , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  F. Islam,et al.  RRT∗-Smart: Rapid convergence implementation of RRT∗ towards optimal solution , 2012, 2012 IEEE International Conference on Mechatronics and Automation.

[11]  Shimon Whiteson,et al.  Rapidly exploring learning trees , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[12]  Luis Merino,et al.  Learning Human-Aware Path Planning with Fully Convolutional Networks , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[13]  Peng Li,et al.  A novel hybrid method for mobile robot path planning in unknown dynamic environment based on hybrid DSm model grid map , 2011, J. Exp. Theor. Artif. Intell..

[14]  Michiel van de Panne,et al.  RRT-blossom: RRT with a local flood-fill behavior , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[15]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[16]  Michael A. Goodrich,et al.  Homotopy-aware RRT*: Toward human-robot topological path-planning , 2016, 2016 11th ACM/IEEE International Conference on Human-Robot Interaction (HRI).

[17]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[18]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .