Guang Yang , Yadong Mo , Chengyu Lv , Ying Zhang , Jian Li , Shimin Wei
{"title":"A dual-layer task planning algorithm based on UAVs-human cooperation for search and rescue","authors":"Guang Yang , Yadong Mo , Chengyu Lv , Ying Zhang , Jian Li , 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}
引用次数: 0
Abstract
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 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.