Deep Reinforcement Learning-Based Mapless Navigation for Mobile Robot in Unknown Environment With Local Optima

Local optima issues challenge mobile robots mapless navigation with the dilemma of avoiding collisions and approaching the target. Planning-based methods rely on environmental models and manual strategies to guide the robot. In contrast, learning-based methods can process original sensor data to navigate the robot in real-time but struggle with local optima. To address this, we designed reward rules that punish the robot for previously visited areas that may trap the robot, and reward it for exploring local areas in diverse ways and escaping from local optima areas. Then, we improved the Soft Actor-Critic (SAC) algorithm by making its temperature parameter adaptive to the current training status, and memorizing it in experiences for strategy updating, bringing additional exploratory behaviors and necessary stability into the training. Finally, with the assistance of auxiliary networks, the robot learns to handle various navigation tasks with local optima risks. Simulations demonstrate the advantages of our method in terms of both success rate and path efficiency compared to several existing methods. Experiments verified the proposed method in real-world scenarios.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2024-12-04
DOI
https://doi.org/10.1109/lra.2024.3511437
Citations
12
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.99

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deep Reinforcement Learning-Based Mapless Navigation for Mobile Robot in Unknown Environment With Local Optima

Imre J. Rudas, Yuanlong Xie, Shiqi Zheng, Shuting Wang et al.
12 citations
IEEE Robotics and Automation Letters
Robotic Path Planning Algorithms
2.99
article

Deep Reinforcement Learning-Based Mapless Navigation for Mobile Robot in Unknown Environment With Local Optima

Imre J. Rudas, Yuanlong Xie, Shiqi Zheng, Shuting Wang, Cheng Xiang, Peng Shi, Yiming Hu
article en
12 citations

Abstract

Local optima issues challenge mobile robots mapless navigation with the dilemma of avoiding collisions and approaching the target. Planning-based methods rely on environmental models and manual strategies to guide the robot. In contrast, learning-based methods can process original sensor data to navigate the robot in real-time but struggle with local optima. To address this, we designed reward rules that punish the robot for previously visited areas that may trap the robot, and reward it for exploring local areas in diverse ways and escaping from local optima areas. Then, we improved the Soft Actor-Critic (SAC) algorithm by making its temperature parameter adaptive to the current training status, and memorizing it in experiences for strategy updating, bringing additional exploratory behaviors and necessary stability into the training. Finally, with the assistance of auxiliary networks, the robot learns to handle various navigation tasks with local optima risks. Simulations demonstrate the advantages of our method in terms of both success rate and path efficiency compared to several existing methods. Experiments verified the proposed method in real-world scenarios.

IEEE Robotics and Automation LettersVol. 10(1)
Obuda University (HU), China University of Geosciences (CN), Innova (Hungary) (HU), Huazhong University of Science and Technology (CN), The University of Adelaide (AU)
National Natural Science Foundation of China, Australian Research Council
Openalex Percentile: Top 7%
Robotic Path Planning Algorithms
2.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.