Path planning of the dual-arm robot based on VT-RRT algorithm

This paper presents a variable step size trunk rapidly-exploring random trees (VT-RRT) algorithm for path planning of a dual-arm robot. First, we establish the DH parameter simulation model of the dual-arm robot which is composed of two UR5 single-arm robots. Then, in the working space of the dual-arm robot, several spheres are randomly added to constitute an obstacle environment. Finally, we propose a new improved algorithm by transforming the search space of random nodes in RRT algorithm and adaptively adjusting the step size according to the target position. The simulation results show that the VT-RRT algorithm effectively increases the search efficiency, decreases the iteration step size, and reduces the path planning time in comparison to the basic rapidly-exploring random trees (RRT) algorithm. At the same time, the robustness is also greatly increased.

[1]  M. Gerke,et al.  Genetic path planning for mobile robots , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[2]  Leslie Pack Kaelbling,et al.  LQR-RRT*: Optimal sampling-based motion planning with automatically derived extension heuristics , 2012, 2012 IEEE International Conference on Robotics and Automation.

[3]  Yu Lan Hu,et al.  Multi-Robots Path Planning Based on Improved Artificial Potential Field Method , 2012 .

[4]  Kai Oliver Arras,et al.  RRT-based nonholonomic motion planning using any-angle path biasing , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

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

[6]  Andrew W. Moore,et al.  The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces , 2004, Machine Learning.

[7]  Cai Hai-zhou.  Research on Path Planning Method of Robot Based on Improved A* Algorithm , 2012 .

[8]  H. A. Varol,et al.  Rapidly-exploring random tree based memory efficient motion planning , 2013, 2013 IEEE International Conference on Mechatronics and Automation.

[9]  Mansour Jamzad,et al.  Adaptive motion planning with artificial potential fields using a prior path , 2015, 2015 3rd RSI International Conference on Robotics and Mechatronics (ICROM).

[10]  Olzhas Adiyatov,et al.  A novel RRT*-based algorithm for motion planning in Dynamic environments , 2017, 2017 IEEE International Conference on Mechatronics and Automation (ICMA).

[11]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[13]  Ming Zhu,et al.  The modified RRT-based cooperative searching for human and UAV , 2018, 2018 Chinese Control And Decision Conference (CCDC).

[14]  Steven M. LaValle,et al.  Resolution complete rapidly-exploring random trees , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[15]  Katie Byl,et al.  Smooth RRT-connect: An extension of RRT-connect for practical use in robots , 2015, 2015 IEEE International Conference on Technologies for Practical Robot Applications (TePRA).

[16]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[17]  Zhang Heng.  On-line Real-time Obstacle Avoidance Path Planning of Space Manipulator , 2007 .