.png){kind=icon}
.png){kind=icon}
Return
An Improved Dyna-Q Algorithm for Mobile Robot Path Planning in Unknown Dynamic Environment
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2021.3096935.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article deals with the problem of mobile robot path planning in an unknown environment that contains both static and dynamic obstacles, utilizing a reinforcement learning approach. We propose an improved Dyna-Q algorithm, which incorporates heuristic search strategies, simulated annealing mechanism, and reactive navigation principle into Q-learning based on the Dyna architecture. A novel action-selection strategy combining epsilon-greedy policy with the cooling schedule control is presented, which, together with the heuristic reward function and heuristic actions, can tackle the exploration-exploitation dilemma and enhance the performance of global searching, convergence property, and learning efficiency for path planning. The proposed method is superior to the classical Q-learning and Dyna-Q algorithms in an unknown static environment, and it is successfully applied to an uncertain environment with multiple dynamic obstacles in simulations. Further, practical experiments are conducted by integrating MATLAB and robot operating system (ROS) on a physical robot platform, and the mobile robot manages to find a collision-free path, thus fulfilling autonomous navigation tasks in the real world.
Keywords:
Path planning
Mobile robots
Robots
Heuristic algorithms
Navigation
Collision avoidance
Task analysis
Dynamic environment
Dyna-Q
mobile robot
path planning
reinforcement learning (RL)
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W