Trajectory Planning and Active Obstacle Avoidance for Multi-Degree-of-Freedom Manipulator
Keywords:
Artificial potential field method, Obstacle avoidance control, Robotic arm, RRT algorithm, Trajectory planningAbstract
To overcome the challenges of suboptimal path quality, excessive computational overhead, and inadequate obstacle avoidance in multi-degree-of-freedom manipulator trajectory planning, this paper proposes an improved Rapidly-exploring Random Tree (RRT) algorithm based on the Artificial Potential Field (APF) method. By integrating an attractive field from the target point and a repulsive field from obstacles, the enhanced RRT algorithm significantly reduces redundant nodes while improving planning efficiency and safety. Specifically, the attractive field guides random sampling toward the target, thereby shortening the path length, while the repulsive field dynamically adjusts node positions to maintain a safe distance from obstacles. Simulation experiments in both 2D and 3D environments demonstrate the effectiveness of the proposed algorithm, with results showing that the RRT+APF hybrid method outperforms conventional RRT and APF algorithms in terms of path smoothness, computation time, and iteration count. Furthermore, rigorous experimental validation on the JAKA C5 six-degree-of-freedom robotic arm platform confirms the algorithm’s superior performance, producing shorter and smoother trajectories that effectively reduce abrupt changes in joint angles and mechanical shocks.References
[1] T. Xu, J. Ma, P. Qin, and Q. Hu, An improved RRT* algorithm based on adaptive informed sample strategy for coastal ship path planning, Ocean Engineering, 333, 2025, 121511.
[2] C. Liu, F. Xiao, and Y. Ma, An enhanced RRT* algorithm with biased sampling and dynamic stepsize strategy for ship route planning in the high-risk areas, Ocean Engineering, 332, 2025, 121466.
[3] Y. Liu, S. Zhu, Y. Yu, and Z. Wu, Path planning for material scheduling in industrial internet scenarios based on an improved RRT* algorithm, Journal of the Franklin Institute, 362, 2025, 107716.
[4] C. Fang, J.Wang, F. Yuan, S. Chen, and H. Zhou, Path planning for dragon-fruit-harvesting robotic arm based on XN-RRT* algorithm, Sensors, 25, 2025.
[5] X. Xu, P. Li, J. Zhou, and W. Deng, Path planning of quadrupedal robot based on improved RRT connect algorithm, Sensors,25, 2025, 2558.
[6] S. Lei, T. Li, X. Gao, P. Xue, and G. Song, Research on improved RRT path planning algorithm based on multi-strategy fusion, Scientific Reports, 15, 2025, 13312.
[7] S. LaValle, Rapidly-exploring random trees: A new tool for path planning, Tech. Rep. 9811, Research Report, 1998.
[8] Z. Wu, Z. Meng, W. Zhao, and Z. Wu, Fast-RRT: A RRT-based optimal path finding method, Applied Sciences, 11, 2021, 11777.
[9] G. Huang and Q. Ma, Research on path planning algorithm of autonomous vehicles based on improved RRT algorithm, International Journal of Intelligent Transportation Systems Research, 20, 2022, 170–180.
[10] T. Gong, Y. Yu, and J. Song, Path planning for multiple unmanned vehicles (muvs) formation shape generation based on dual RRT optimization, Actuators, 11, 2022, 190.
[11] J. J. Kuffner and S. M. LaValle, RRT-connect: An efficient approach to single-query path planning, Proceedings of IEEE International Conference on Robotics and Automation (ICRA), San Francisco, CA, USA, 2000, 8–16.
[12] J. Ge, L. Liu, X. Dong, and W. Tian, Trajectory planning of fixed-wing uav using kinodynamic RRT algorithm, 2020 10th International Conference on Information Science and Technology (ICIST), Bath, London, UK, 2020.
[13] X. Zhang, Y. Jiang, Y. Lu, and X. Xu, Receding-horizon reinforcement learning approach for kinodynamic motion planning of autonomous vehicles, IEEE Transactions on Intelligent Vehicles, 7, 2022, 556–568.
[14] C.-B. Moon and W. Chung, Kinodynamic planner dual-tree RRT (DT-RRT) for two-wheeled mobile robots using the rapidly exploring random tree, IEEE Transactions on Industrial Electronics, 62, 2014, 1080–1090.
[15] S. Karaman and E. Frazzoli, Sampling-based algorithms for optimal motion planning, The International Journal of Robotics Research, 30, 2011, 846–894.
[16] X. Wang, X. Li, Y. Guan, J. Song, and R. Wang, Bidirectional potential guided RRT* for motion planning, IEEE Access, 7, 2019, 95046–95057.
[17] S. Karaman, M. R.Walter, A. Perez, E. Frazzoli, and S. Teller, Anytime motion planning using the RRT, IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, 2011.
[18] C. Tonola, M. Faroni, M. Beschi, and N. Pedrocchi, Anytime informed multi-path replanning strategy for complex environments, IEEE Access, 11, 2023, 4105–4116.
[19] H. Yang, J. Lim, and S.-E. Yoon, Anytime RRBT for handling uncertainty and dynamic objects, IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Daejeon, South Korea, 2016.
[20] R. Shome, K. Solovey, A. Dobson, D. Halperin, and K. E. Bekris, DRRT*: Scalable and informed asymptotically-optimal multi-robot motion planning, Autonomous Robots, 44, 2020, 443–467.
[21] F. Islam, J. Nasir, U. Malik, Y. Ayaz, and O. Hasan, RRT*-smart: Rapid convergence implementation of RRT* towards optimal solution, IEEE International Conference on Mechatronics and Automation, Chengdu, China, 2012.
[22] J. Nasir, F. Islam, and Y. Ayaz, Adaptive rapidly-exploring-random-tree-star (RRT*) -smart: Algorithm characteristics and behavior analysis in complex environments, Asia-Pacific Journal of Information Technology and Multimedia, 2, 2013, 39–51.
[23] Y. Nie, H. Yang, Q. Gao, T. Qu, C. Fan, and D. Song, Research on path planning algorithm based on dimensionality reduction method and improved RRT, Global Oceans 2020, 2020.
[24] H. Liu, Y. P. Tsang, C. K. M. Lee, Y. Wang, and F.-Y. Wang, Internet of uavs to automate search and rescue missions in post-disaster for smart cities, IEEE Intelligent Vehicles Symposium (IV), Jeju Island, South Korea, 2024.
[25] S. Ganesan, B. Ramalingam, and R. E. Mohan, A hybrid sampling-based RRT* path planning algorithm for autonomous mobile robot navigation, Expert Systems with Applications, 258, 2024, 125206.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Zixiang Yan, Huimin Ouyang, Xiaodong Miao
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:Authors hold and retain copyright, and grant the journal right of first publication, with the work after publication simultaneously licensed under a Creative Commons Attribution 4.0 License CC BY that permits any use, reproduction and distribution of the work and article without further permission provided that the original work is properly cited.
Authors are permitted and encouraged to post their work online in institutional repositories, website and other social media before and after publication, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
