一种基于蜂群智能的高效多机器人合作方法,用于在未知危险环境中搜索目标

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Expert Systems with Applications Pub Date : 2024-11-02 DOI:10.1016/j.eswa.2024.125609
{"title":"一种基于蜂群智能的高效多机器人合作方法,用于在未知危险环境中搜索目标","authors":"","doi":"10.1016/j.eswa.2024.125609","DOIUrl":null,"url":null,"abstract":"<div><div>To solve target searching problems for multi-robot cooperation with inaccurate target distance perception in unknown hazardous environments, a hybrid adaptive robotic particle swarm optimizer (RPSO) and grey wolf optimizer (GWO) based algorithm with continuous virtual target guidance is proposed for high effective path planning in the searching. In the initial searching stages, both the wolf behavior-generated position and the <em>gbest</em> position and the <em>pbesti</em> positions from RPSO are employed to guide the motions of robots. With the information provided by these initial robot movement paths, a geometric model is established to generate potential targets. The K-means cluster algorithm is introduced to estimate a virtual target position online from potential targets, with new robot-presenting route information to update the history path information. Then the virtual position is employed as one of the direction components to help the robots approach the actual target. In addition, to avoid mobile robots falling into local convergence, a heuristic moving direction determination scheme is utilized to make robots circumvent obstacles in swarm motions, as well as a mutual repulsion algorithm to keep them in a scattering state. Simulation experiments on different types of unknown environments with varied robot numbers and adaptability testing for a dynamic target are carried out to verify the feasibility of the proposed target searching method with comparisons to the other three famous target searching algorithms. It is verified from the results that the presented method can not only contribute a 100% success rate in all runs of searching for a stochastic dynamic target under a limited maximal velocity, but also produce both the shortest path length and minimum iterations in terms of statistical metrics over the comparative methods.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":null,"pages":null},"PeriodicalIF":7.5000,"publicationDate":"2024-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A high-effective swarm intelligence-based multi-robot cooperation method for target searching in unknown hazardous environments\",\"authors\":\"\",\"doi\":\"10.1016/j.eswa.2024.125609\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>To solve target searching problems for multi-robot cooperation with inaccurate target distance perception in unknown hazardous environments, a hybrid adaptive robotic particle swarm optimizer (RPSO) and grey wolf optimizer (GWO) based algorithm with continuous virtual target guidance is proposed for high effective path planning in the searching. In the initial searching stages, both the wolf behavior-generated position and the <em>gbest</em> position and the <em>pbesti</em> positions from RPSO are employed to guide the motions of robots. With the information provided by these initial robot movement paths, a geometric model is established to generate potential targets. The K-means cluster algorithm is introduced to estimate a virtual target position online from potential targets, with new robot-presenting route information to update the history path information. Then the virtual position is employed as one of the direction components to help the robots approach the actual target. In addition, to avoid mobile robots falling into local convergence, a heuristic moving direction determination scheme is utilized to make robots circumvent obstacles in swarm motions, as well as a mutual repulsion algorithm to keep them in a scattering state. Simulation experiments on different types of unknown environments with varied robot numbers and adaptability testing for a dynamic target are carried out to verify the feasibility of the proposed target searching method with comparisons to the other three famous target searching algorithms. It is verified from the results that the presented method can not only contribute a 100% success rate in all runs of searching for a stochastic dynamic target under a limited maximal velocity, but also produce both the shortest path length and minimum iterations in terms of statistical metrics over the comparative methods.</div></div>\",\"PeriodicalId\":50461,\"journal\":{\"name\":\"Expert Systems with Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2024-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Expert Systems with Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S095741742402476X\",\"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":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S095741742402476X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

为了解决在未知危险环境中目标距离感知不准确的多机器人合作目标搜索问题,提出了一种基于自适应机器人粒子群优化器(RPSO)和灰狼优化器(GWO)的混合算法,该算法具有连续虚拟目标引导功能,可在搜索过程中实现高效路径规划。在初始搜索阶段,灰狼行为生成的位置和 RPSO 得出的 gbest 位置和 pbesti 位置都用于指导机器人的运动。利用这些初始机器人运动路径提供的信息,建立几何模型,生成潜在目标。引入 K-means 聚类算法,从潜在目标中在线估算出虚拟目标位置,并利用新的机器人运动路径信息更新历史路径信息。然后将虚拟位置作为方向分量之一,帮助机器人接近实际目标。此外,为避免移动机器人陷入局部收敛,还采用了启发式移动方向确定方案,使机器人在蜂群运动中绕过障碍物,并采用互斥算法使机器人处于散射状态。为了验证所提出的目标搜索方法的可行性,与其他三种著名的目标搜索算法进行了比较。结果证明,所提出的方法不仅在有限最大速度下搜索随机动态目标的所有运行中都能达到 100%的成功率,而且在统计指标上比比较方法的路径长度最短、迭代次数最少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A high-effective swarm intelligence-based multi-robot cooperation method for target searching in unknown hazardous environments
To solve target searching problems for multi-robot cooperation with inaccurate target distance perception in unknown hazardous environments, a hybrid adaptive robotic particle swarm optimizer (RPSO) and grey wolf optimizer (GWO) based algorithm with continuous virtual target guidance is proposed for high effective path planning in the searching. In the initial searching stages, both the wolf behavior-generated position and the gbest position and the pbesti positions from RPSO are employed to guide the motions of robots. With the information provided by these initial robot movement paths, a geometric model is established to generate potential targets. The K-means cluster algorithm is introduced to estimate a virtual target position online from potential targets, with new robot-presenting route information to update the history path information. Then the virtual position is employed as one of the direction components to help the robots approach the actual target. In addition, to avoid mobile robots falling into local convergence, a heuristic moving direction determination scheme is utilized to make robots circumvent obstacles in swarm motions, as well as a mutual repulsion algorithm to keep them in a scattering state. Simulation experiments on different types of unknown environments with varied robot numbers and adaptability testing for a dynamic target are carried out to verify the feasibility of the proposed target searching method with comparisons to the other three famous target searching algorithms. It is verified from the results that the presented method can not only contribute a 100% success rate in all runs of searching for a stochastic dynamic target under a limited maximal velocity, but also produce both the shortest path length and minimum iterations in terms of statistical metrics over the comparative methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Expert Systems with Applications
Expert Systems with Applications 工程技术-工程:电子与电气
CiteScore
13.80
自引率
10.60%
发文量
2045
审稿时长
8.7 months
期刊介绍: Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.
期刊最新文献
CE-DCVSI: Multimodal relational extraction based on collaborative enhancement of dual-channel visual semantic information Learning face super-resolution through identity features and distilling facial prior knowledge Identification of gene regulatory networks associated with breast cancer patient survival using an interpretable deep neural network model A high-effective swarm intelligence-based multi-robot cooperation method for target searching in unknown hazardous environments A new look of dispatching for multi-objective interbay AMHS in semiconductor wafer manufacturing: A T–S fuzzy-based learning approach
×
引用
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