arrow
返回

An optimized Q-Learning algorithm for mobile robot local path planning

delete2024-02-01
delete17
PRE
AI
Q
Qian Zhou *
L
Lian Yang
J
Jiayang Wu
H
Haiyong Wang
J
Jinli Cao
DOI:10.1016/j.knosys.2024.111400delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The Q-Learning algorithm is a reinforcement learning technique widely used in various fields such as path planning, intelligent transportation, penetration testing, among others. It primarily involves the interaction between an agent and its environment, enabling the agent to learn an optimal strategy that maximizes cumulative rewards. Most non-agent-based path planning algorithms face challenges in exploring completely unknown environments effectively, lacking efficient perception in unfamiliar settings. Additionally, many QLearning-based path planning algorithms suffer from slow convergence and susceptibility to getting stuck in local optimal solutions. To address these issues, an optimized version of the Q-Learning algorithm (Optimized Q-Learning, O-QL) is proposed and applied to local path planning of mobile robots. O-QL introduces novel Q -table initialization methods, incorporates a new action-selection policy, and a new reward function, and adapts the Root Mean Square Propagation (RMSprop) method in the learning rate adjustment. This adjustment dynamically tunes the learning rate based on gradient changes to accelerate learning and enhance path planning efficiency. Simulation experiments are carried out in three maze environments with different complexity levels, and the performance of the algorithm in local path planning is evaluated using steps, exploration reward, learning rate change and running time. The experimental results demonstrate that O-QL exhibits improvements across all four metrics compared to existing algorithms.
Keyword:
Mobile robot
Q-Learning algorithm
Local path planning
Reinforcement learning
Adaptive learning rate

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

L
La Trobe University
学者数:
1.1W
论文数: 1.1W
被引数: 1.5W
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
A novel test-cost-sensitive attribute reduction approach using the binary bat algorithm
err2019-12-01
err21
PREAI
errXie, Xiaojun; Qin, Xiaolin; Zhou, Qian; Zhou, Yanghao; Zhang, Tong; Janicki, Ryszard; Zhao, Wei
err分享
err收藏
err分享
err收藏
A novel multi-step Q-learning method to improve data efficiency for deep reinforcement learning一种提高深度强化学习数据效率的多步Q学习方法
err2019-07-01
err43
PREAI
errYuan, Yinlong; Yu, Zhu Liang; Gu, Zhenghui; Yeboah, Yao; Wei, Wu; Deng, Xiaoyan; Li, Jingcong; Li, Yuanqing
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收藏
学者 查看更多内容