• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

多机器人协作全覆盖路径规划。

Collaborative Complete Coverage and Path Planning for Multi-Robot Exploration.

机构信息

Department of Electrical Engineering, Advanced Institute of Manufacturing with High-Tech Innovation, National Chung Cheng University, Chiayi 621, Taiwan.

Department of Electrical Engineering, National Chung Cheng University, Chiayi 621, Taiwan.

出版信息

Sensors (Basel). 2021 May 26;21(11):3709. doi: 10.3390/s21113709.

DOI:10.3390/s21113709
PMID:34073565
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC8198857/
Abstract

In mobile robotics research, the exploration of unknown environments has always been an important topic due to its practical uses in consumer and military applications. One specific interest of recent investigation is the field of complete coverage and path planning (CCPP) techniques for mobile robot navigation. In this paper, we present a collaborative CCPP algorithms for single robot and multi-robot systems. The incremental coverage from the robot movement is maximized by evaluating a new cost function. A goal selection function is then designed to facilitate the collaborative exploration for a multi-robot system. By considering the local gains from the individual robots as well as the global gain by the goal selection, the proposed method is able to optimize the overall coverage efficiency. In the experiments, our CCPP algorithms are carried out on various unknown and complex environment maps. The simulation results and performance evaluation demonstrate the effectiveness of the proposed collaborative CCPP technique.

摘要

在移动机器人研究中,由于其在消费和军事应用中的实际用途,探索未知环境一直是一个重要的课题。最近的研究特别关注移动机器人导航的全覆盖和路径规划(CCPP)技术领域。在本文中,我们提出了一种用于单机器人和多机器人系统的协作 CCPP 算法。通过评估新的成本函数,最大化了机器人运动的增量覆盖范围。然后设计了一个目标选择函数,以方便多机器人系统的协作探索。通过考虑单个机器人的局部收益以及目标选择的全局收益,所提出的方法能够优化整体覆盖效率。在实验中,我们的 CCPP 算法在各种未知和复杂的环境地图上进行了测试。仿真结果和性能评估证明了所提出的协作 CCPP 技术的有效性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/2345c9ed21cd/sensors-21-03709-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/cc499fa48bd1/sensors-21-03709-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/944e8831daef/sensors-21-03709-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/bccfde114b4b/sensors-21-03709-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/41966dc9282b/sensors-21-03709-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/efbc1ce9b3ae/sensors-21-03709-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/b9b745eec22a/sensors-21-03709-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/8c26e44de3e5/sensors-21-03709-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/2345c9ed21cd/sensors-21-03709-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/cc499fa48bd1/sensors-21-03709-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/944e8831daef/sensors-21-03709-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/bccfde114b4b/sensors-21-03709-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/41966dc9282b/sensors-21-03709-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/efbc1ce9b3ae/sensors-21-03709-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/b9b745eec22a/sensors-21-03709-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/8c26e44de3e5/sensors-21-03709-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/eeee/8198857/2345c9ed21cd/sensors-21-03709-g008.jpg

相似文献

1
Collaborative Complete Coverage and Path Planning for Multi-Robot Exploration.多机器人协作全覆盖路径规划。
Sensors (Basel). 2021 May 26;21(11):3709. doi: 10.3390/s21113709.
2
Path planning and collision avoidance methods for distributed multi-robot systems in complex dynamic environments.复杂动态环境下分布式多机器人系统的路径规划与避碰方法
Math Biosci Eng. 2023 Jan;20(1):145-178. doi: 10.3934/mbe.2023008. Epub 2022 Sep 30.
3
A Convex Optimization Approach to Multi-Robot Task Allocation and Path Planning.凸优化方法在多机器人任务分配与路径规划中的应用。
Sensors (Basel). 2023 May 26;23(11):5103. doi: 10.3390/s23115103.
4
A layered goal-oriented fuzzy motion planning strategy for mobile robot navigation.一种用于移动机器人导航的分层目标导向模糊运动规划策略。
IEEE Trans Syst Man Cybern B Cybern. 2005 Dec;35(6):1214-24. doi: 10.1109/tsmcb.2005.850177.
5
LF-ACO: an effective formation path planning for multi-mobile robot.LF-ACO:一种用于多移动机器人的有效编队路径规划方法。
Math Biosci Eng. 2022 Jan;19(1):225-252. doi: 10.3934/mbe.2022012. Epub 2021 Nov 9.
6
Mobile robot path planning with reformative bat algorithm.基于改进蝙蝠算法的移动机器人路径规划。
PLoS One. 2022 Nov 4;17(11):e0276577. doi: 10.1371/journal.pone.0276577. eCollection 2022.
7
Hitchhiking Robots: A Collaborative Approach for Efficient Multi-Robot Navigation in Indoor Environments.搭便车机器人:一种用于室内环境中高效多机器人导航的协作方法。
Sensors (Basel). 2017 Aug 15;17(8):1878. doi: 10.3390/s17081878.
8
Smooth Complete Coverage Trajectory Planning Algorithm for a Nonholonomic Robot.非完整约束机器人的平滑全覆盖轨迹规划算法。
Sensors (Basel). 2022 Nov 28;22(23):9269. doi: 10.3390/s22239269.
9
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.
10
Grid-Based Mobile Robot Path Planning Using Aging-Based Ant Colony Optimization Algorithm in Static and Dynamic Environments.基于栅格的移动机器人路径规划在静态和动态环境中使用基于老化的蚁群优化算法。
Sensors (Basel). 2020 Mar 28;20(7):1880. doi: 10.3390/s20071880.

引用本文的文献

1
Coverage Planning for UVC Irradiation: Robot Surface Disinfection Based on Swarm Intelligence Algorithm.紫外线C辐照的覆盖规划:基于群体智能算法的机器人表面消毒
Sensors (Basel). 2024 May 26;24(11):3418. doi: 10.3390/s24113418.
2
Multi-Robot Exploration of Unknown Space Using Combined Meta-Heuristic Salp Swarm Algorithm and Deterministic Coordinated Multi-Robot Exploration.多机器人未知空间探索:基于混合启发式沙蚕群算法和确定性协同多机器人探索
Sensors (Basel). 2023 Feb 14;23(4):2156. doi: 10.3390/s23042156.
3
An Algorithm for Task Allocation and Planning for a Heterogeneous Multi-Robot System to Minimize the Last Task Completion Time.

本文引用的文献

1
Coverage Path Planning Using Reinforcement Learning-Based TSP for hTetran-A Polyabolo-Inspired Self-Reconfigurable Tiling Robot.基于强化学习的旅行商问题算法在hTetran - A多角形启发的自重构平铺机器人覆盖路径规划中的应用
Sensors (Basel). 2021 Apr 7;21(8):2577. doi: 10.3390/s21082577.
2
Evolutionary Algorithm-Based Complete Coverage Path Planning for Tetriamond Tiling Robots.基于进化算法的 Tetriamond 铺砖机器人全覆盖路径规划
Sensors (Basel). 2020 Jan 13;20(2):445. doi: 10.3390/s20020445.
一种用于最小化最后一个任务完成时间的异构多机器人系统的任务分配和规划算法。
Sensors (Basel). 2022 Jul 28;22(15):5637. doi: 10.3390/s22155637.