CIOMP OpenIR
Biologically Inspired Complete Coverage Path Planning Algorithm Based on Q-Learning
X. Tan, L. Han, H. Gong and Q. Wu
2023
发表期刊Sensors
ISSN14248220
卷号23期号:10
摘要Complete coverage path planning requires that the mobile robot traverse all reachable positions in the environmental map. Aiming at the problems of local optimal path and high path coverage ratio in the complete coverage path planning of the traditional biologically inspired neural network algorithm, a complete coverage path planning algorithm based on Q-learning is proposed. The global environment information is introduced by the reinforcement learning method in the proposed algorithm. In addition, the Q-learning method is used for path planning at the positions where the accessible path points are changed, which optimizes the path planning strategy of the original algorithm near these obstacles. Simulation results show that the algorithm can automatically generate an orderly path in the environmental map, and achieve 100% coverage with a lower path repetition ratio. © 2023 by the authors.
DOI10.3390/s23104647
URL查看原文
收录类别sci ; ei
引用统计
文献类型期刊论文
条目标识符http://ir.ciomp.ac.cn/handle/181722/67881
专题中国科学院长春光学精密机械与物理研究所
推荐引用方式
GB/T 7714
X. Tan, L. Han, H. Gong and Q. Wu. Biologically Inspired Complete Coverage Path Planning Algorithm Based on Q-Learning[J]. Sensors,2023,23(10).
APA X. Tan, L. Han, H. Gong and Q. Wu.(2023).Biologically Inspired Complete Coverage Path Planning Algorithm Based on Q-Learning.Sensors,23(10).
MLA X. Tan, L. Han, H. Gong and Q. Wu."Biologically Inspired Complete Coverage Path Planning Algorithm Based on Q-Learning".Sensors 23.10(2023).
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Biologically Inspire(2601KB)期刊论文出版稿开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[X. Tan, L. Han, H. Gong and Q. Wu]的文章
百度学术
百度学术中相似的文章
[X. Tan, L. Han, H. Gong and Q. Wu]的文章
必应学术
必应学术中相似的文章
[X. Tan, L. Han, H. Gong and Q. Wu]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Biologically Inspired Complete Coverage Path P.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。