Affiliation:
1. School of Intelligent Manufacturing, Taizhou University, Taizhou 318000, China
Abstract
This paper proposes an improved Soft Actor–Critic Long Short-Term Memory (SAC-LSTM) algorithm for fast path planning of mobile robots in dynamic environments. To achieve continuous motion and better decision making by incorporating historical and current states, a long short-term memory network (LSTM) with memory was integrated into the SAC algorithm. To mitigate the memory depreciation issue caused by resetting the LSTM’s hidden states to zero during training, a burn-in training method was adopted to boost the performance. Moreover, a prioritized experience replay mechanism was implemented to enhance sampling efficiency and speed up convergence. Based on the SAC-LSTM framework, a motion model for the Turtlebot3 mobile robot was established by designing the state space, action space, reward function, and overall planning process. Three simulation experiments were conducted in obstacle-free, static obstacle, and dynamic obstacle environments using the ROS platform and Gazebo9 software. The results were compared with the SAC algorithm. In all scenarios, the SAC-LSTM algorithm demonstrated a faster convergence rate and a higher path planning success rate, registering a significant 10.5 percentage point improvement in the success rate of reaching the target point in the dynamic obstacle environment. Additionally, the time taken for path planning was shorter, and the planned paths were more concise.
Funder
National Natural Science Foundation of China
Subject
Electrical and Electronic Engineering,Biochemistry,Instrumentation,Atomic and Molecular Physics, and Optics,Analytical Chemistry
Reference37 articles.
1. Path Planning Techniques for Mobile Robots: Review and Prospect;Liu;Expert Syst. Appl.,2023
2. A Note on Two Problems in Connexion with Graphs;Dijkstra;Edsger Wybe Dijkstra: His Life, Work, and Legacy,2022
3. A Formal Basis for the Heuristic Determination of Minimum Cost Paths;Hart;IEEE Trans. Syst. Sci. Cybern.,1968
4. Stentz, A. (1994, January 8–13). Optimal and Efficient Path Planning for Partially-Known Environments. Proceedings of the 1994 IEEE International Conference on Robotics and Automation, San Diego, CA, USA.
5. Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces;Kavraki;IEEE Trans. Robot. Autom.,1996