使用一群地面机器人对未知障碍物杂乱环境的覆盖探索

IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Khalil Al-rahman Youssefi, Wilfried Elmenreich
{"title":"使用一群地面机器人对未知障碍物杂乱环境的覆盖探索","authors":"Khalil Al-rahman Youssefi,&nbsp;Wilfried Elmenreich","doi":"10.1016/j.asoc.2025.113964","DOIUrl":null,"url":null,"abstract":"<div><div>This paper introduces a coverage exploration algorithm for unknown obstacle-cluttered environments using a swarm of ground robots. A key contribution of this work is the proposed fitness function, which balances multiple exploration objectives and encourages robots to disperse effectively, avoiding excessive overlapping visits. The robots are assumed to start from a single corner of the environment, reflecting practical situations where pre-distributing them is not feasible. This setup highlights a key feature of the algorithm, as it enables self-organization and effective distribution of the robots throughout the environment. The robustness of the method is demonstrated through experiments in various environmental setups, showing its resilience to different obstacle structures and reliable performance across diverse scenarios. The approach also leverages the benefits of swarm behavior, where an increasing number of robots improves exploration efficiency through enhanced collaboration and coverage. The algorithm is evaluated against a swarm random walk approach and two multi-robot meta-heuristic methods, significantly outperforming them in terms of coverage efficiency and robustness.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"185 ","pages":"Article 113964"},"PeriodicalIF":6.6000,"publicationDate":"2025-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Coverage exploration of unknown obstacle-cluttered environments using a swarm of ground robots\",\"authors\":\"Khalil Al-rahman Youssefi,&nbsp;Wilfried Elmenreich\",\"doi\":\"10.1016/j.asoc.2025.113964\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper introduces a coverage exploration algorithm for unknown obstacle-cluttered environments using a swarm of ground robots. A key contribution of this work is the proposed fitness function, which balances multiple exploration objectives and encourages robots to disperse effectively, avoiding excessive overlapping visits. The robots are assumed to start from a single corner of the environment, reflecting practical situations where pre-distributing them is not feasible. This setup highlights a key feature of the algorithm, as it enables self-organization and effective distribution of the robots throughout the environment. The robustness of the method is demonstrated through experiments in various environmental setups, showing its resilience to different obstacle structures and reliable performance across diverse scenarios. The approach also leverages the benefits of swarm behavior, where an increasing number of robots improves exploration efficiency through enhanced collaboration and coverage. The algorithm is evaluated against a swarm random walk approach and two multi-robot meta-heuristic methods, significantly outperforming them in terms of coverage efficiency and robustness.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"185 \",\"pages\":\"Article 113964\"},\"PeriodicalIF\":6.6000,\"publicationDate\":\"2025-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625012773\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625012773","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

介绍了一种基于地面机器人群的未知障碍物干扰环境下的覆盖探测算法。这项工作的一个关键贡献是提出的适应度函数,它平衡了多个探索目标,并鼓励机器人有效地分散,避免过多的重叠访问。假设机器人从环境的一个角落开始,反映了预先分配它们是不可行的实际情况。这种设置突出了算法的一个关键特性,因为它可以在整个环境中实现机器人的自组织和有效分布。通过各种环境设置的实验证明了该方法的鲁棒性,显示了它对不同障碍物结构的弹性和在不同场景下的可靠性能。该方法还利用了群体行为的优势,即越来越多的机器人通过增强协作和覆盖范围来提高勘探效率。该算法与群随机漫步方法和两种多机器人元启发式方法进行了比较,在覆盖效率和鲁棒性方面明显优于它们。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Coverage exploration of unknown obstacle-cluttered environments using a swarm of ground robots
This paper introduces a coverage exploration algorithm for unknown obstacle-cluttered environments using a swarm of ground robots. A key contribution of this work is the proposed fitness function, which balances multiple exploration objectives and encourages robots to disperse effectively, avoiding excessive overlapping visits. The robots are assumed to start from a single corner of the environment, reflecting practical situations where pre-distributing them is not feasible. This setup highlights a key feature of the algorithm, as it enables self-organization and effective distribution of the robots throughout the environment. The robustness of the method is demonstrated through experiments in various environmental setups, showing its resilience to different obstacle structures and reliable performance across diverse scenarios. The approach also leverages the benefits of swarm behavior, where an increasing number of robots improves exploration efficiency through enhanced collaboration and coverage. The algorithm is evaluated against a swarm random walk approach and two multi-robot meta-heuristic methods, significantly outperforming them in terms of coverage efficiency and robustness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信