arrow
返回

The Experience-Memory Q-Learning Algorithm for Robot Path Planning in Unknown Environment

delete2020-01-01
delete34
delete
OA
AI
M
Meng Zhao
H
Hui Lu *
S
Siyi Yang
F
Fengjuan Guo
DOI:10.1109/ACCESS.2020.2978077delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In order to solve the problem of slow convergence speed and long planned path when the robot plans a path in unknown environment by using Q-learning algorithm, we propose the Experience-Memory Q-Learning (EMQL) algorithm based on the continuous update of the shortest distance from the current state node to the start point. The autonomous learning ability of the robot is enhanced by the different role assignments of two tables in the proposed algorithm. EM table with (m*1) dimension is designed to record the distance information, reflecting the learning process of the robot. Q table is adopted as an auxiliary guidance for the experience transfer strategy and experience reuse strategy, and these strategies enable the robot accomplish the task even if the destination is changed or the path is blocked. Further, the learning efficiency of the robot in the EMQL algorithm is improved by the dual reward mechanism consisting of static reward and dynamic reward. The static reward is designed to prevent the robot from exploring a state node excessively. The dynamic reward is responsible for helping the robot avoid searching blindly in unknown environment. We test the effectiveness of the proposed algorithm on both grid maps and road network maps. The comparison results in planning time, iteration times and path length show that the performance of the EMQL algorithm is superior to Q-learning algorithm in convergence speed and optimization ability. Additionally, the practicability of the proposed algorithm is validated in a real-world experiment using the Turtlebot3 burger robot.
Keyword:
Path planning
Q-learning
experience memory
experience transfer
experience reuse
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

B
Beihang University
学者数:
5.2W
论文数: 4.1W
被引数: 37
引用论文

引用论文

Path Planning for Active SLAM Based on the D* Algorithm With Negative Edge Weights
err2018-08-01
err87
PREAI
errMaurovic, Ivan; Seder, Marija; Lenac, Kruno; Petrovic, Ivan
err分享
err收藏
err分享
err收藏
err分享
err收藏
Evolving Rule-Based Explainable Artificial Intelligence for Unmanned Aerial Vehicles基于规则的可解释的无人机人工智能
err2019-01-01
err56
errOAAI
errKeneni, Blen M.; Kaur, Devinder; Al Bataineh, Ali; Devabhaktuni, Vijaya K.; Javaid, Ahmad Y.; Zaientz, Jack D.; Marinier, Robert P., III
err分享
err收藏
Cost-Benefit Analysis
err
IF0
err2007-05-07
err0
PREAI
errEuston Quah; E.J. Mishan; Euston Quah
err分享
err收藏
A Deterministic Improved Q-Learning for Path Planning of a Mobile Robot用于移动机器人路径规划的确定性改进Q学习
err2013-09-01
err196
PREAI
errKonar, Amit; Chakraborty, Indrani Goswami; Singh, Sapam Jitu; Jain, Lakhmi C.; Nagar, Atulya K.
err分享
err收藏
学者 查看更多内容