基于 FDA 的多机器人合作算法,用于未知环境中的多目标搜索

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Complex & Intelligent Systems Pub Date : 2024-07-31 DOI:10.1007/s40747-024-01564-3
Wenwen Ye, Jia Cai, Shengping Li
{"title":"基于 FDA 的多机器人合作算法,用于未知环境中的多目标搜索","authors":"Wenwen Ye, Jia Cai, Shengping Li","doi":"10.1007/s40747-024-01564-3","DOIUrl":null,"url":null,"abstract":"<p>Target search using a swarm of robots is a classic research topic that poses challenges, particularly in conducting multi-target searching in unknown environments. Key challenges include high communication cost among robots, unknown positions of obstacles, and the presence of multiple targets. To address these challenges, we propose a novel <b>R</b>obotic <b>F</b>low <b>D</b>irection <b>A</b>lgorithm (RFDA), building upon the modified Flow Direction Algorithm (FDA) to suit the characteristics of the robot’s motion. RFDA efficiently reduces the communication cost and navigates around unknown obstacles. The algorithm also accounts for scenarios involving isolated robots. The pipeline of the proposed RFDA method is outlined as follows: (1). <b>Learning strategy</b>: a neighborhood information based learning strategy is adopted to enhance the FDA’s position update formula. This allows swarm robots to systematically locate the target (the lowest height) in a stepwise manner. (2). <b>Adaptive inertia weighting</b>: An adaptive inertia weighting mechanism is employed to maintain diversity among robots during the search and avoid premature convergence. (3). <b>Sink-filling process</b>: The algorithm simulates the sink-filling process and moving to the aspect slope to escape from local optima. (4). <b>Isolated robot scenario</b>: The case of an isolated robot (a robot without neighbors) is considered. Global optimal information is only required when the robot is isolated or undergoing the sink-filling process, thereby reducing communication costs. We not only demonstrate the probabilistic completeness of RFDA but also validate its effectiveness by comparing it with six other competing algorithms in a simulated environment. Experiments cover various aspects such as target number, population size, and environment size. Our findings indicate that RFDA outperforms other methods in terms of the number of required iterations and the full success rate. The Friedman and Wilcoxon tests further demonstrate the superiority of RFDA.</p>","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":"29 1","pages":""},"PeriodicalIF":5.0000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A FDA-based multi-robot cooperation algorithm for multi-target searching in unknown environments\",\"authors\":\"Wenwen Ye, Jia Cai, Shengping Li\",\"doi\":\"10.1007/s40747-024-01564-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Target search using a swarm of robots is a classic research topic that poses challenges, particularly in conducting multi-target searching in unknown environments. Key challenges include high communication cost among robots, unknown positions of obstacles, and the presence of multiple targets. To address these challenges, we propose a novel <b>R</b>obotic <b>F</b>low <b>D</b>irection <b>A</b>lgorithm (RFDA), building upon the modified Flow Direction Algorithm (FDA) to suit the characteristics of the robot’s motion. RFDA efficiently reduces the communication cost and navigates around unknown obstacles. The algorithm also accounts for scenarios involving isolated robots. The pipeline of the proposed RFDA method is outlined as follows: (1). <b>Learning strategy</b>: a neighborhood information based learning strategy is adopted to enhance the FDA’s position update formula. This allows swarm robots to systematically locate the target (the lowest height) in a stepwise manner. (2). <b>Adaptive inertia weighting</b>: An adaptive inertia weighting mechanism is employed to maintain diversity among robots during the search and avoid premature convergence. (3). <b>Sink-filling process</b>: The algorithm simulates the sink-filling process and moving to the aspect slope to escape from local optima. (4). <b>Isolated robot scenario</b>: The case of an isolated robot (a robot without neighbors) is considered. Global optimal information is only required when the robot is isolated or undergoing the sink-filling process, thereby reducing communication costs. We not only demonstrate the probabilistic completeness of RFDA but also validate its effectiveness by comparing it with six other competing algorithms in a simulated environment. Experiments cover various aspects such as target number, population size, and environment size. Our findings indicate that RFDA outperforms other methods in terms of the number of required iterations and the full success rate. The Friedman and Wilcoxon tests further demonstrate the superiority of RFDA.</p>\",\"PeriodicalId\":10524,\"journal\":{\"name\":\"Complex & Intelligent Systems\",\"volume\":\"29 1\",\"pages\":\"\"},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complex & Intelligent Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s40747-024-01564-3\",\"RegionNum\":2,\"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":"Complex & Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40747-024-01564-3","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

使用机器人群进行目标搜索是一个经典的研究课题,它带来了各种挑战,尤其是在未知环境中进行多目标搜索时。主要挑战包括机器人之间的通信成本高、障碍物位置未知以及存在多个目标。为了应对这些挑战,我们提出了一种新颖的机器人流向算法(RFDA),该算法以改进的流向算法(FDA)为基础,以适应机器人的运动特性。RFDA 可有效降低通信成本,并绕过未知障碍物。该算法还考虑到了涉及孤立机器人的情况。RFDA 方法的流程概述如下:(1).学习策略:采用基于邻域信息的学习策略来增强 FDA 的位置更新公式。这样,蜂群机器人就能以循序渐进的方式系统地定位目标(最低高度)。(2).自适应惯性加权:采用自适应惯性加权机制,以保持搜索过程中机器人之间的多样性,避免过早收敛。(3).水槽填充过程:该算法模拟了下沉填充过程,并向斜面移动,以摆脱局部最优状态。(4).孤立机器人情况:考虑孤立机器人(没有邻居的机器人)的情况。只有当机器人处于孤立状态或正在进行水槽填充过程时,才需要全局最优信息,从而降低了通信成本。我们不仅证明了 RFDA 的概率完备性,还通过在模拟环境中与其他六种竞争算法进行比较来验证其有效性。实验涉及目标数量、种群规模和环境规模等多个方面。我们的研究结果表明,RFDA 在所需迭代次数和完全成功率方面都优于其他方法。Friedman 和 Wilcoxon 检验进一步证明了 RFDA 的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A FDA-based multi-robot cooperation algorithm for multi-target searching in unknown environments

Target search using a swarm of robots is a classic research topic that poses challenges, particularly in conducting multi-target searching in unknown environments. Key challenges include high communication cost among robots, unknown positions of obstacles, and the presence of multiple targets. To address these challenges, we propose a novel Robotic Flow Direction Algorithm (RFDA), building upon the modified Flow Direction Algorithm (FDA) to suit the characteristics of the robot’s motion. RFDA efficiently reduces the communication cost and navigates around unknown obstacles. The algorithm also accounts for scenarios involving isolated robots. The pipeline of the proposed RFDA method is outlined as follows: (1). Learning strategy: a neighborhood information based learning strategy is adopted to enhance the FDA’s position update formula. This allows swarm robots to systematically locate the target (the lowest height) in a stepwise manner. (2). Adaptive inertia weighting: An adaptive inertia weighting mechanism is employed to maintain diversity among robots during the search and avoid premature convergence. (3). Sink-filling process: The algorithm simulates the sink-filling process and moving to the aspect slope to escape from local optima. (4). Isolated robot scenario: The case of an isolated robot (a robot without neighbors) is considered. Global optimal information is only required when the robot is isolated or undergoing the sink-filling process, thereby reducing communication costs. We not only demonstrate the probabilistic completeness of RFDA but also validate its effectiveness by comparing it with six other competing algorithms in a simulated environment. Experiments cover various aspects such as target number, population size, and environment size. Our findings indicate that RFDA outperforms other methods in terms of the number of required iterations and the full success rate. The Friedman and Wilcoxon tests further demonstrate the superiority of RFDA.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Complex & Intelligent Systems
Complex & Intelligent Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
9.60
自引率
10.30%
发文量
297
期刊介绍: Complex & Intelligent Systems aims to provide a forum for presenting and discussing novel approaches, tools and techniques meant for attaining a cross-fertilization between the broad fields of complex systems, computational simulation, and intelligent analytics and visualization. The transdisciplinary research that the journal focuses on will expand the boundaries of our understanding by investigating the principles and processes that underlie many of the most profound problems facing society today.
期刊最新文献
Large-scale multiobjective competitive swarm optimizer algorithm based on regional multidirectional search Towards fairness-aware multi-objective optimization Low-frequency spectral graph convolution networks with one-hop connections information for personalized tag recommendation A decentralized feedback-based consensus model considering the consistency maintenance and readability of probabilistic linguistic preference relations for large-scale group decision-making A dynamic preference recommendation model based on spatiotemporal knowledge graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1