Target Selection for Multi-domain Combat SoS Breaking with Operational Constraints

Chaoxiong Ma, Yan Liang, Hongfeng Xu
{"title":"Target Selection for Multi-domain Combat SoS Breaking with Operational Constraints","authors":"Chaoxiong Ma, Yan Liang, Hongfeng Xu","doi":"10.1109/ICARM58088.2023.10218837","DOIUrl":null,"url":null,"abstract":"Modern warfare has become increasingly expensive as a result of its multi-domain joint systematic combat model. To achieve the purpose of stopping war with war and maintaining the safety of people's lives and property, paralyzing the target system of systems (SoS) operational capability maximally under constraints, such as battlefield resources and environment, has become an urgent research topic. This paper addresses the problem of fast search for the optimal solution of the strike target selection task, which considers operational constraints, dynamic coupling of node states, and dimensional explosion. Firstly, a capability aggregation-based target SoS operational capability calculation model and an operational constraint-based strike target selection model are established. Then, an adaptive genetic simulated annealing algorithm (AGSA) is proposed for fast model solving. The algorithm is carefully designed to address the constraints of the strike target selection task, which enables it to accomplish individual selection and coding updates, improve population diversity, and ensure search performance. Eventually, the simulation results under three different scenarios demonstrate the effectiveness of AGSA.","PeriodicalId":220013,"journal":{"name":"2023 International Conference on Advanced Robotics and Mechatronics (ICARM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Advanced Robotics and Mechatronics (ICARM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARM58088.2023.10218837","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Modern warfare has become increasingly expensive as a result of its multi-domain joint systematic combat model. To achieve the purpose of stopping war with war and maintaining the safety of people's lives and property, paralyzing the target system of systems (SoS) operational capability maximally under constraints, such as battlefield resources and environment, has become an urgent research topic. This paper addresses the problem of fast search for the optimal solution of the strike target selection task, which considers operational constraints, dynamic coupling of node states, and dimensional explosion. Firstly, a capability aggregation-based target SoS operational capability calculation model and an operational constraint-based strike target selection model are established. Then, an adaptive genetic simulated annealing algorithm (AGSA) is proposed for fast model solving. The algorithm is carefully designed to address the constraints of the strike target selection task, which enables it to accomplish individual selection and coding updates, improve population diversity, and ensure search performance. Eventually, the simulation results under three different scenarios demonstrate the effectiveness of AGSA.
突破作战约束的多域作战SoS目标选择
现代战争的多域联合系统作战模式使其成本日益高昂。为达到以战止战、维护人民生命财产安全的目的,在战场资源、环境等约束条件下,最大限度地瘫痪系统目标系统(SoS)的作战能力,已成为迫切需要研究的课题。考虑了作战约束、节点状态动态耦合和维度爆炸等因素,研究了打击目标选择任务最优解的快速搜索问题。首先,建立了基于能力聚合的目标SoS作战能力计算模型和基于作战约束的打击目标选择模型;然后,提出了一种自适应遗传模拟退火算法(AGSA)来快速求解模型。该算法经过精心设计,解决了打击目标选择任务的约束条件,使其能够完成个体选择和编码更新,提高种群多样性,保证搜索性能。最后,通过三种不同场景下的仿真结果验证了AGSA的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信