A Novel Method for Multi-UAV Cooperative Reconnaissance Mission Planning in Denied Environment

Jingyu Liu, Yanfei Liu, Mingzhi Cong, Zhong Wang, Jieling Wang
{"title":"A Novel Method for Multi-UAV Cooperative Reconnaissance Mission Planning in Denied Environment","authors":"Jingyu Liu, Yanfei Liu, Mingzhi Cong, Zhong Wang, Jieling Wang","doi":"10.1109/ISCSIC54682.2021.00012","DOIUrl":null,"url":null,"abstract":"The traditional swarm intelligence algorithm to solve the path planning in single combat style of unmanned aerial vehicle (UAV) can no longer meet the requirements of multi-UAV cooperative reconnaissance mission planning (MUCRMP) problem in denied environment for its slow convergence rate, ignorance of complex constraints and guidance to local optimization. A novel method for multi-UAV cooperative reconnaissance mission planning in denied environment (MUCRMP-DE) based on an improved synthetic heuristic algorithm is proposed to tackle these. In this paper, a hierarchical model is established with the global optimization goal of UAV's minimum radar detection time at first, including the planning of reconnaissance sequence between and within target groups, as well as relative position to targets. Then an improved synthetic heuristic algorithm is proposed to solve the model, which obtains valuable reconnaissance mission plan. For an application example of reconnaissance mission involving 68 targets, the simulation results show that the improved synthetic heuristic algorithm can suit the needs of the mission, particularly in effectively evading the detection of multiple radars. While it can also give better anti-radar attributes to the UA V and efficiently improved the convergence speed in the specific reconnaissance mission.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSIC54682.2021.00012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The traditional swarm intelligence algorithm to solve the path planning in single combat style of unmanned aerial vehicle (UAV) can no longer meet the requirements of multi-UAV cooperative reconnaissance mission planning (MUCRMP) problem in denied environment for its slow convergence rate, ignorance of complex constraints and guidance to local optimization. A novel method for multi-UAV cooperative reconnaissance mission planning in denied environment (MUCRMP-DE) based on an improved synthetic heuristic algorithm is proposed to tackle these. In this paper, a hierarchical model is established with the global optimization goal of UAV's minimum radar detection time at first, including the planning of reconnaissance sequence between and within target groups, as well as relative position to targets. Then an improved synthetic heuristic algorithm is proposed to solve the model, which obtains valuable reconnaissance mission plan. For an application example of reconnaissance mission involving 68 targets, the simulation results show that the improved synthetic heuristic algorithm can suit the needs of the mission, particularly in effectively evading the detection of multiple radars. While it can also give better anti-radar attributes to the UA V and efficiently improved the convergence speed in the specific reconnaissance mission.
拒绝环境下多无人机协同侦察任务规划新方法
传统的求解无人机单兵作战方式路径规划的群智能算法由于收敛速度慢、忽略复杂约束条件和导向局部优化等问题,已不能满足拒绝环境下多无人机协同侦察任务规划问题的要求。针对这些问题,提出了一种基于改进的综合启发式算法的多无人机协同侦察任务规划新方法。本文首先以无人机最小雷达探测时间为全局优化目标,建立了一种分层模型,包括目标群之间和目标群内部的侦察顺序规划以及与目标的相对位置规划。然后提出了一种改进的综合启发式算法对模型进行求解,得到了有价值的侦察任务规划。以68个目标的侦察任务为例,仿真结果表明,改进的综合启发式算法能够满足侦察任务的需要,特别是能够有效规避多雷达的探测。同时,它还能赋予无人侦察机更好的反雷达属性,有效提高其在特定侦察任务中的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信