基于改进型 NSGA-Ⅱ 的异构无人机集群多类型任务分配算法

Drones Pub Date : 2024-08-08 DOI:10.3390/drones8080384
Yunchong Zhu, Yangang Liang, Yingjie Jiao, Haipeng Ren, Kebo Li
{"title":"基于改进型 NSGA-Ⅱ 的异构无人机集群多类型任务分配算法","authors":"Yunchong Zhu, Yangang Liang, Yingjie Jiao, Haipeng Ren, Kebo Li","doi":"10.3390/drones8080384","DOIUrl":null,"url":null,"abstract":"Cluster warfare, as a disruptive technology, leverages its numerical advantage to overcome limitations such as restricted task execution types and the low resilience of single platforms, embodying a significant trend in future unmanned combat. In scenarios where only the number of known targets and their vague locations within the region are available, UAV clusters are tasked with performing missions including close-range scout, target attack, and damage assessment for each target. Consequently, taking into account constraints such as assignment, payload, task time window, task sequencing, and range, a multi-objective optimization model for task assignment was formulated. Initially, optimization objectives were set as total mission completion time, total mission revenue, and cluster damage level. Subsequently, the concept of constraint tolerance was introduced to enhance the non-dominant sorting mechanism of NSGA-II by distinguishing individuals that fail to meet constraints, thereby enabling those violating constraints with high tolerance to be retained in the next generation to participate in further evolution, thereby resolving the difficulty of achieving a convergent Pareto solution set under complex interdependent task constraints. Finally, through comparisons, the superiority of the improved NSGA-II algorithm has been verified.","PeriodicalId":507567,"journal":{"name":"Drones","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Type Task Assignment Algorithm for Heterogeneous UAV Cluster Based on Improved NSGA-Ⅱ\",\"authors\":\"Yunchong Zhu, Yangang Liang, Yingjie Jiao, Haipeng Ren, Kebo Li\",\"doi\":\"10.3390/drones8080384\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cluster warfare, as a disruptive technology, leverages its numerical advantage to overcome limitations such as restricted task execution types and the low resilience of single platforms, embodying a significant trend in future unmanned combat. In scenarios where only the number of known targets and their vague locations within the region are available, UAV clusters are tasked with performing missions including close-range scout, target attack, and damage assessment for each target. Consequently, taking into account constraints such as assignment, payload, task time window, task sequencing, and range, a multi-objective optimization model for task assignment was formulated. Initially, optimization objectives were set as total mission completion time, total mission revenue, and cluster damage level. Subsequently, the concept of constraint tolerance was introduced to enhance the non-dominant sorting mechanism of NSGA-II by distinguishing individuals that fail to meet constraints, thereby enabling those violating constraints with high tolerance to be retained in the next generation to participate in further evolution, thereby resolving the difficulty of achieving a convergent Pareto solution set under complex interdependent task constraints. Finally, through comparisons, the superiority of the improved NSGA-II algorithm has been verified.\",\"PeriodicalId\":507567,\"journal\":{\"name\":\"Drones\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Drones\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/drones8080384\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Drones","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/drones8080384","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

集群战作为一种颠覆性技术,利用其数量优势克服了任务执行类型受限、单一平台应变能力低等限制,体现了未来无人作战的重要趋势。在只有已知目标数量及其在区域内的模糊位置的情况下,无人机集群的任务是执行包括近距离侦察、目标攻击和对每个目标进行损害评估在内的任务。因此,考虑到任务分配、有效载荷、任务时间窗、任务排序和范围等约束条件,制定了任务分配的多目标优化模型。最初,优化目标被设定为任务完成总时间、任务总收入和集群损坏程度。随后,引入了约束容限的概念,通过区分未能满足约束条件的个体来增强 NSGA-II 的非优势排序机制,从而使那些违反约束条件的个体以较高的容限被保留在下一代中参与进一步的进化,从而解决了在复杂的相互依存的任务约束条件下实现帕累托解集收敛的难题。最后,通过比较,验证了改进后的 NSGA-II 算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Type Task Assignment Algorithm for Heterogeneous UAV Cluster Based on Improved NSGA-Ⅱ
Cluster warfare, as a disruptive technology, leverages its numerical advantage to overcome limitations such as restricted task execution types and the low resilience of single platforms, embodying a significant trend in future unmanned combat. In scenarios where only the number of known targets and their vague locations within the region are available, UAV clusters are tasked with performing missions including close-range scout, target attack, and damage assessment for each target. Consequently, taking into account constraints such as assignment, payload, task time window, task sequencing, and range, a multi-objective optimization model for task assignment was formulated. Initially, optimization objectives were set as total mission completion time, total mission revenue, and cluster damage level. Subsequently, the concept of constraint tolerance was introduced to enhance the non-dominant sorting mechanism of NSGA-II by distinguishing individuals that fail to meet constraints, thereby enabling those violating constraints with high tolerance to be retained in the next generation to participate in further evolution, thereby resolving the difficulty of achieving a convergent Pareto solution set under complex interdependent task constraints. Finally, through comparisons, the superiority of the improved NSGA-II algorithm has been verified.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信