• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于 Q-learning 的生物启发式全覆盖路径规划算法。

Biologically Inspired Complete Coverage Path Planning Algorithm Based on Q-Learning.

机构信息

CAS Key Laboratory of On-Orbit Manufacturing and Integration for Space Optics System, Chinese Academy of Sciences, Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China.

Research Center for Materials and Optoelectronics, University of Chinese Academy of Sciences, Beijing 100049, China.

出版信息

Sensors (Basel). 2023 May 11;23(10):4647. doi: 10.3390/s23104647.

DOI:10.3390/s23104647
PMID:37430561
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10222496/
Abstract

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.

摘要

完整覆盖路径规划要求移动机器人遍历环境地图中的所有可到达位置。针对传统生物启发神经网络算法完整覆盖路径规划中存在的局部最优路径和高路径覆盖率问题,提出了一种基于 Q-learning 的完整覆盖路径规划算法。该算法通过强化学习方法引入全局环境信息。此外,在可访问路径点发生变化的位置使用 Q-learning 方法进行路径规划,优化了原始算法在这些障碍物附近的路径规划策略。仿真结果表明,该算法可以在环境地图中自动生成有序路径,并以较低的路径重复率实现 100%的覆盖率。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/764ae507f543/sensors-23-04647-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/8a6ac48cb2e7/sensors-23-04647-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/1c4697019fb5/sensors-23-04647-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/64dba379423c/sensors-23-04647-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/7390f8fe56c9/sensors-23-04647-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/eec2b600a3ba/sensors-23-04647-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/91ed67e61e8e/sensors-23-04647-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/7a3051593232/sensors-23-04647-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/08ee7216d9de/sensors-23-04647-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/ef56079b8ca5/sensors-23-04647-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/54a4ec2b0195/sensors-23-04647-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/722e2dccfa00/sensors-23-04647-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/764ae507f543/sensors-23-04647-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/8a6ac48cb2e7/sensors-23-04647-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/1c4697019fb5/sensors-23-04647-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/64dba379423c/sensors-23-04647-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/7390f8fe56c9/sensors-23-04647-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/eec2b600a3ba/sensors-23-04647-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/91ed67e61e8e/sensors-23-04647-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/7a3051593232/sensors-23-04647-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/08ee7216d9de/sensors-23-04647-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/ef56079b8ca5/sensors-23-04647-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/54a4ec2b0195/sensors-23-04647-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/722e2dccfa00/sensors-23-04647-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0e35/10222496/764ae507f543/sensors-23-04647-g012.jpg

相似文献

1
Biologically Inspired Complete Coverage Path Planning Algorithm Based on Q-Learning.基于 Q-learning 的生物启发式全覆盖路径规划算法。
Sensors (Basel). 2023 May 11;23(10):4647. doi: 10.3390/s23104647.
2
The Path Planning of Mobile Robot by Neural Networks and Hierarchical Reinforcement Learning.基于神经网络和分层强化学习的移动机器人路径规划
Front Neurorobot. 2020 Oct 2;14:63. doi: 10.3389/fnbot.2020.00063. eCollection 2020.
3
Smooth Complete Coverage Trajectory Planning Algorithm for a Nonholonomic Robot.非完整约束机器人的平滑全覆盖轨迹规划算法。
Sensors (Basel). 2022 Nov 28;22(23):9269. doi: 10.3390/s22239269.
4
CLSQL: Improved Q-Learning Algorithm Based on Continuous Local Search Policy for Mobile Robot Path Planning.CLSQL:基于连续局部搜索策略的移动机器人路径规划改进Q学习算法
Sensors (Basel). 2022 Aug 8;22(15):5910. doi: 10.3390/s22155910.
5
An Improved Dyna-Q Algorithm Inspired by the Forward Prediction Mechanism in the Rat Brain for Mobile Robot Path Planning.一种受大鼠大脑前向预测机制启发的改进型Dyna-Q算法用于移动机器人路径规划
Biomimetics (Basel). 2024 May 23;9(6):315. doi: 10.3390/biomimetics9060315.
6
Path Planning for Wheeled Mobile Robot in Partially Known Uneven Terrain.轮式移动机器人在部分未知非均匀地形中的路径规划。
Sensors (Basel). 2022 Jul 12;22(14):5217. doi: 10.3390/s22145217.
7
A path planning approach for mobile robots using short and safe Q-learning.基于短程且安全 Q-学习的移动机器人路径规划方法。
PLoS One. 2022 Sep 26;17(9):e0275100. doi: 10.1371/journal.pone.0275100. eCollection 2022.
8
Reinforcement Learning-Based Complete Area Coverage Path Planning for a Modified hTrihex Robot.基于强化学习的改进 hTrihex 机器人全覆盖路径规划
Sensors (Basel). 2021 Feb 4;21(4):1067. doi: 10.3390/s21041067.
9
SLP-Improved DDPG Path-Planning Algorithm for Mobile Robot in Large-Scale Dynamic Environment.基于 SLP 的改进 DDPG 路径规划算法在大规模动态环境下的移动机器人应用
Sensors (Basel). 2023 Mar 28;23(7):3521. doi: 10.3390/s23073521.
10
A Generalized Laser Simulator Algorithm for Mobile Robot Path Planning with Obstacle Avoidance.一种用于移动机器人路径规划与避障的广义激光模拟器算法
Sensors (Basel). 2022 Oct 25;22(21):8177. doi: 10.3390/s22218177.

引用本文的文献

1
AntBot-EX: Enhancing robot search efficiency in complex post-disaster environments.AntBot-EX:提高机器人在复杂灾后环境中的搜索效率。
PLoS One. 2025 May 22;20(5):e0322980. doi: 10.1371/journal.pone.0322980. eCollection 2025.

本文引用的文献

1
Exact and Heuristic Multi-Robot Dubins Coverage Path Planning for Known Environments.精确和启发式多机器人 Dubins 覆盖路径规划用于已知环境。
Sensors (Basel). 2023 Feb 25;23(5):2560. doi: 10.3390/s23052560.
2
A Novel Path Planning Strategy for a Cleaning Audit Robot Using Geometrical Features and Swarm Algorithms.一种基于几何特征和群智能算法的清洁审计机器人的新型路径规划策略。
Sensors (Basel). 2022 Jul 16;22(14):5317. doi: 10.3390/s22145317.
3
Novel Bioinspired Approach Based on Chaotic Dynamics for Robot Patrolling Missions with Adversaries.
基于混沌动力学的新型仿生方法用于有对手情况下的机器人巡逻任务
Entropy (Basel). 2018 May 18;20(5):378. doi: 10.3390/e20050378.
4
Neural network approaches to dynamic collision-free trajectory generation.用于动态无碰撞轨迹生成的神经网络方法。
IEEE Trans Syst Man Cybern B Cybern. 2001;31(3):302-18. doi: 10.1109/3477.931512.
5
A neural network approach to complete coverage path planning.一种用于完全覆盖路径规划的神经网络方法。
IEEE Trans Syst Man Cybern B Cybern. 2004 Feb;34(1):718-25. doi: 10.1109/tsmcb.2003.811769.
6
A quantitative description of membrane current and its application to conduction and excitation in nerve. 1952.膜电流的定量描述及其在神经传导与兴奋中的应用。1952年。
Bull Math Biol. 1990;52(1-2):25-71; discussion 5-23. doi: 10.1007/BF02459568.