基于无人机-人协同的搜救双层任务规划算法

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Guang Yang , Yadong Mo , Chengyu Lv , Ying Zhang , Jian Li , Shimin Wei
{"title":"基于无人机-人协同的搜救双层任务规划算法","authors":"Guang Yang ,&nbsp;Yadong Mo ,&nbsp;Chengyu Lv ,&nbsp;Ying Zhang ,&nbsp;Jian Li ,&nbsp;Shimin Wei","doi":"10.1016/j.asoc.2025.113488","DOIUrl":null,"url":null,"abstract":"<div><div>To address the issues of low efficiency and difficult localization in search and rescue, a dual-layer task planning algorithm based on UAVs-human cooperation for search and rescue is proposed, which mainly includes the search layer for UAVs and the execution layer for rescuers. Firstly, in the search layer, to solve the problems of uneven task allocation and redundant coverage paths of heterogeneous UAVs, a coverage path optimization based on cluster algorithm (CPOC) is adopted. It applies the K-means algorithm with the proportional constraint to allocate the appropriate task-area for each UAV, and uses the non-redundant exact cellular decomposition method to achieve more efficient planning of the subregion coverage paths, meanwhile, those paths are connected by the Min-Max Ant System. Secondly, in the execution layer, the Rapidly-exploring Random Tree star with dynamic guidance mechanism (DG-RRT*) is introduced to improve the performance of path planning for rescuers in the indoor environment. By comparing the different levels of the target locations, this mechanism guides the RRT to explore purposefully to avoid the algorithm being trapped in the local optimum. Finally, compared with the classical algorithm, the total task time of CPOC in the two examples is reduced by 7.3 % and 27.8 % respectively. DG-RRT* can obtain the effective solution in a shorter time under the premise of ensuring the optimal path length. The results indicate that our algorithm can improve the efficiency of search and rescue route planning as well as the accuracy of the solutions.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"181 ","pages":"Article 113488"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dual-layer task planning algorithm based on UAVs-human cooperation for search and rescue\",\"authors\":\"Guang Yang ,&nbsp;Yadong Mo ,&nbsp;Chengyu Lv ,&nbsp;Ying Zhang ,&nbsp;Jian Li ,&nbsp;Shimin Wei\",\"doi\":\"10.1016/j.asoc.2025.113488\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>To address the issues of low efficiency and difficult localization in search and rescue, a dual-layer task planning algorithm based on UAVs-human cooperation for search and rescue is proposed, which mainly includes the search layer for UAVs and the execution layer for rescuers. Firstly, in the search layer, to solve the problems of uneven task allocation and redundant coverage paths of heterogeneous UAVs, a coverage path optimization based on cluster algorithm (CPOC) is adopted. It applies the K-means algorithm with the proportional constraint to allocate the appropriate task-area for each UAV, and uses the non-redundant exact cellular decomposition method to achieve more efficient planning of the subregion coverage paths, meanwhile, those paths are connected by the Min-Max Ant System. Secondly, in the execution layer, the Rapidly-exploring Random Tree star with dynamic guidance mechanism (DG-RRT*) is introduced to improve the performance of path planning for rescuers in the indoor environment. By comparing the different levels of the target locations, this mechanism guides the RRT to explore purposefully to avoid the algorithm being trapped in the local optimum. Finally, compared with the classical algorithm, the total task time of CPOC in the two examples is reduced by 7.3 % and 27.8 % respectively. DG-RRT* can obtain the effective solution in a shorter time under the premise of ensuring the optimal path length. The results indicate that our algorithm can improve the efficiency of search and rescue route planning as well as the accuracy of the solutions.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"181 \",\"pages\":\"Article 113488\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-06-15\",\"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/S1568494625007999\",\"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/S1568494625007999","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

针对搜救效率低、定位难的问题,提出了一种基于无人机-人协同的双层搜救任务规划算法,该算法主要包括针对无人机的搜索层和针对救援人员的执行层。首先,在搜索层,针对异构无人机任务分配不均和覆盖路径冗余的问题,采用基于聚类算法(CPOC)的覆盖路径优化。采用带比例约束的K-means算法为每架无人机分配合适的任务区域,采用非冗余精确元胞分解方法实现更高效的子区域覆盖路径规划,同时利用最小-最大蚁群系统连接子区域覆盖路径。其次,在执行层,引入带有动态引导机制的快速探索随机树星(DG-RRT*),提高室内环境下救援人员路径规划的性能。该机制通过比较不同层次的目标位置,引导RRT有目的地进行探索,避免算法陷入局部最优。最后,与经典算法相比,两例CPOC的总任务时间分别缩短了7.3 %和27.8 %。DG-RRT*在保证最优路径长度的前提下,可以在更短的时间内得到有效解。结果表明,该算法能够提高搜救路线规划的效率和求解的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A dual-layer task planning algorithm based on UAVs-human cooperation for search and rescue
To address the issues of low efficiency and difficult localization in search and rescue, a dual-layer task planning algorithm based on UAVs-human cooperation for search and rescue is proposed, which mainly includes the search layer for UAVs and the execution layer for rescuers. Firstly, in the search layer, to solve the problems of uneven task allocation and redundant coverage paths of heterogeneous UAVs, a coverage path optimization based on cluster algorithm (CPOC) is adopted. It applies the K-means algorithm with the proportional constraint to allocate the appropriate task-area for each UAV, and uses the non-redundant exact cellular decomposition method to achieve more efficient planning of the subregion coverage paths, meanwhile, those paths are connected by the Min-Max Ant System. Secondly, in the execution layer, the Rapidly-exploring Random Tree star with dynamic guidance mechanism (DG-RRT*) is introduced to improve the performance of path planning for rescuers in the indoor environment. By comparing the different levels of the target locations, this mechanism guides the RRT to explore purposefully to avoid the algorithm being trapped in the local optimum. Finally, compared with the classical algorithm, the total task time of CPOC in the two examples is reduced by 7.3 % and 27.8 % respectively. DG-RRT* can obtain the effective solution in a shorter time under the premise of ensuring the optimal path length. The results indicate that our algorithm can improve the efficiency of search and rescue route planning as well as the accuracy of the solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信