Affiliation:
1. School of Mechanical and Electrical Engineering, Lanzhou University of Technology, Lanzhou 730000, China
2. State Key Laboratory of Robotics and System (HIT), Harbin Institute of Technology, Harbin 150001, China
Abstract
In the traditional Deep Deterministic Policy Gradient (DDPG) algorithm, path planning for mobile robots in mapless environments still encounters challenges regarding learning efficiency and navigation performance, particularly adaptability and robustness to static and dynamic obstacles. To address these issues, in this study, an improved algorithm frame was proposed that designs the state and action spaces, and introduces a multi-step update strategy and a dual-noise mechanism to improve the reward function. These improvements significantly enhance the algorithm’s learning efficiency and navigation performance, rendering it more adaptable and robust in complex mapless environments. Compared to the traditional DDPG algorithm, the improved algorithm shows a 20% increase in the stability of the navigation success rate with static obstacles along with a 25% reduction in pathfinding steps for smoother paths. In environments with dynamic obstacles, there is a remarkable 45% improvement in success rate. Real-world mobile robot tests further validated the feasibility and effectiveness of the algorithm in true mapless environments.
Funder
National Natural Science Foundation of China
Reference26 articles.
1. Gao, H., Liu, D., and Hu, J. (2023, January 12–14). A survey on path planning for mobile robot systems. Proceedings of the 2023 IEEE 12th Data Driven Control and Learning Systems Conference (DDCLS), Xiangtan, China.
2. Robot path planning algorithm based on improved DDPG algorithm;Zhou;J. Nanjing Univ. Sci. Technol.,2021
3. Dynamic path planning of the UAV avoiding static and moving obstacles;Chen;J. Intell. Robot. Syst.,2020
4. Gao, J., Ye, W., Guo, J., and Li, Z. (2020). Deep reinforcement learning for indoor mobile robot path planning. Sensors, 20.
5. Path planning for smart car based on Dijkstra algorithm and dynamic window approach;Liu;Wirel. Commun. Mob. Comput.,2021