多机器人覆盖探测中障碍物诱导环境复杂性评估准则。

IF 2.6 3区 综合性期刊 Q1 MULTIDISCIPLINARY SCIENCES
PLoS ONE Pub Date : 2025-05-16 eCollection Date: 2025-01-01 DOI:10.1371/journal.pone.0323112
Khalil Al-Rahman Youssefi Darmian, Reza Abbaszadeh Darban, Gregor Kastner, Wilfried Elmenreich
{"title":"多机器人覆盖探测中障碍物诱导环境复杂性评估准则。","authors":"Khalil Al-Rahman Youssefi Darmian, Reza Abbaszadeh Darban, Gregor Kastner, Wilfried Elmenreich","doi":"10.1371/journal.pone.0323112","DOIUrl":null,"url":null,"abstract":"<p><p>In many applications, such as coverage exploration and search and rescue missions, accurately assessing environmental complexity is valuable for performance evaluation and algorithm adjustments. Despite this, in the context of multi-robot systems, quantifying environmental complexity caused by obstacles when using autonomous ground robots presents significant challenges. This research proposes a criterion for measuring environments' obstacle-induced complexity in the context of autonomous multi-robot coverage exploration. The criterion rates the environment's complexity numerically, where 0 denotes obstacle-free setups, and the value increases with obstacle-related effects, reaching a maximum of 1, representing the highest measurable complexity for the criterion. The proposed criterion is independent of robot hardware specifications and algorithm-specific aspects. Furthermore, it is independent of the environment's size and the ratio of the area occupied by obstacles, enabling comparisons across various environments. Statistical analysis shows the metric performs well both on average and in single-case comparisons.</p>","PeriodicalId":20189,"journal":{"name":"PLoS ONE","volume":"20 5","pages":"e0323112"},"PeriodicalIF":2.6000,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12083827/pdf/","citationCount":"0","resultStr":"{\"title\":\"A criterion for assessing obstacle-induced environmental complexity in multi-robot coverage exploration.\",\"authors\":\"Khalil Al-Rahman Youssefi Darmian, Reza Abbaszadeh Darban, Gregor Kastner, Wilfried Elmenreich\",\"doi\":\"10.1371/journal.pone.0323112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>In many applications, such as coverage exploration and search and rescue missions, accurately assessing environmental complexity is valuable for performance evaluation and algorithm adjustments. Despite this, in the context of multi-robot systems, quantifying environmental complexity caused by obstacles when using autonomous ground robots presents significant challenges. This research proposes a criterion for measuring environments' obstacle-induced complexity in the context of autonomous multi-robot coverage exploration. The criterion rates the environment's complexity numerically, where 0 denotes obstacle-free setups, and the value increases with obstacle-related effects, reaching a maximum of 1, representing the highest measurable complexity for the criterion. The proposed criterion is independent of robot hardware specifications and algorithm-specific aspects. Furthermore, it is independent of the environment's size and the ratio of the area occupied by obstacles, enabling comparisons across various environments. Statistical analysis shows the metric performs well both on average and in single-case comparisons.</p>\",\"PeriodicalId\":20189,\"journal\":{\"name\":\"PLoS ONE\",\"volume\":\"20 5\",\"pages\":\"e0323112\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2025-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12083827/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PLoS ONE\",\"FirstCategoryId\":\"103\",\"ListUrlMain\":\"https://doi.org/10.1371/journal.pone.0323112\",\"RegionNum\":3,\"RegionCategory\":\"综合性期刊\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"Q1\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PLoS ONE","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.1371/journal.pone.0323112","RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q1","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

摘要

在许多应用中,如覆盖探测和搜救任务,准确评估环境复杂性对性能评估和算法调整具有重要价值。尽管如此,在多机器人系统的背景下,当使用自主地面机器人时,量化障碍物引起的环境复杂性提出了重大挑战。在自主多机器人覆盖探索的背景下,提出了一种测量环境障碍复杂性的准则。该标准以数字方式评估环境的复杂性,其中0表示无障碍设置,该值随着障碍相关效果的增加而增加,达到最大值1,代表该标准的最高可测量复杂性。所提出的标准独立于机器人硬件规格和算法特定方面。此外,它独立于环境的大小和障碍物所占面积的比例,可以在各种环境中进行比较。统计分析表明,该指标在平均和单例比较中都表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A criterion for assessing obstacle-induced environmental complexity in multi-robot coverage exploration.

A criterion for assessing obstacle-induced environmental complexity in multi-robot coverage exploration.

A criterion for assessing obstacle-induced environmental complexity in multi-robot coverage exploration.

A criterion for assessing obstacle-induced environmental complexity in multi-robot coverage exploration.

In many applications, such as coverage exploration and search and rescue missions, accurately assessing environmental complexity is valuable for performance evaluation and algorithm adjustments. Despite this, in the context of multi-robot systems, quantifying environmental complexity caused by obstacles when using autonomous ground robots presents significant challenges. This research proposes a criterion for measuring environments' obstacle-induced complexity in the context of autonomous multi-robot coverage exploration. The criterion rates the environment's complexity numerically, where 0 denotes obstacle-free setups, and the value increases with obstacle-related effects, reaching a maximum of 1, representing the highest measurable complexity for the criterion. The proposed criterion is independent of robot hardware specifications and algorithm-specific aspects. Furthermore, it is independent of the environment's size and the ratio of the area occupied by obstacles, enabling comparisons across various environments. Statistical analysis shows the metric performs well both on average and in single-case comparisons.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
PLoS ONE
PLoS ONE 生物-生物学
CiteScore
6.20
自引率
5.40%
发文量
14242
审稿时长
3.7 months
期刊介绍: PLOS ONE is an international, peer-reviewed, open-access, online publication. PLOS ONE welcomes reports on primary research from any scientific discipline. It provides: * Open-access—freely accessible online, authors retain copyright * Fast publication times * Peer review by expert, practicing researchers * Post-publication tools to indicate quality and impact * Community-based dialogue on articles * Worldwide media coverage
×
引用
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学术官方微信