A Time-Driven Dynamic Weapon Target Assignment Method

被引:3
作者
Liu, Chang [1 ,2 ]
Li, Jiang [1 ]
Wang, Ye [1 ,2 ]
Yu, Yang [1 ]
Guo, Lihong [1 ]
Gao, Yuan [1 ,2 ]
Chen, Yang [1 ]
Zhang, Feng [1 ,3 ]
机构
[1] Chinese Acad Sci, Changchun Inst Opt Fine Mech & Phys, Changchun 130033, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[3] Aviat Univ Air Force, Sch Aviat Operat & Serv, Changchun 130022, Peoples R China
基金
中国国家自然科学基金;
关键词
Heuristic algorithms; Missiles; Discrete wavelet transforms; Reinforcement learning; Computational modeling; Optimization; Real-time systems; Weapons; Object detection; Dynamic weapon target assignment; simulation model; reinforcement learning; heuristic algorithm; PPO algorithm; ALGORITHM; ALLOCATION;
D O I
10.1109/ACCESS.2023.3332513
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The traditional dynamic weapon target assignment model is a combination of multiple static weapon target assignment stages. The assignment of the next stage is carried out after the result of the previous static weapon target assignment is settled. However, between two static weapon target assignment stages, the threat ranking of multiple targets may change with time, and the traditional dynamic weapon target assignment model does not take this time issue into consideration. This paper proposes a "time sampling dynamic weapon assignment model". This model divides the decision-making stage by setting the time interval of data collection, and it can capture the real-time changes in the target threat degree and make timely decisions. With this model, this study designed a dynamic weapon target assignment method based on the reinforcement learning algorithm. Additionally, according to this method, a comparative experiment with different sampling time divisions was designed, and a better sampling time division method was obtained. Finally, a comparative experiment between the reinforcement learning algorithm and the traditional heuristic algorithm was designed in this study. The simulation results show that, compared with the traditional heuristic algorithm, the proposed assignment model and the reinforcement learning algorithm are better in terms of decision-making timeliness and global considerations.
引用
收藏
页码:129623 / 129639
页数:17
相关论文
共 35 条
[1]   Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming [J].
Ahner, Darryl K. ;
Parson, Carl R. .
OPTIMIZATION LETTERS, 2015, 9 (08) :1689-1701
[2]   Exact and heuristic algorithms for the weapon-target assignment problem [J].
Ahuja, Ravindra K. ;
Kumar, Arvind ;
Jha, Krishna C. ;
Orlin, James B. .
OPERATIONS RESEARCH, 2007, 55 (06) :1136-1146
[3]   Butterfly optimization algorithm: a novel approach for global optimization [J].
Arora, Sankalap ;
Singh, Satvir .
SOFT COMPUTING, 2019, 23 (03) :715-734
[4]   INTEGER PRIM-READ SOLUTIONS TO A CLASS OF TARGET DEFENSE PROBLEMS [J].
BURR, SA ;
FALK, JE ;
KARR, AF .
OPERATIONS RESEARCH, 1985, 33 (04) :726-745
[5]   Solving the dynamic weapon target assignment problem by an improved artificial bee colony algorithm with heuristic factor initialization [J].
Chang, Tianqing ;
Kong, Depeng ;
Hao, Na ;
Xu, Kehu ;
Yang, Guozhen .
APPLIED SOFT COMPUTING, 2018, 70 :845-863
[6]  
Cheng Q., 2021, P IEEE INT C UNM SYS, P908
[7]   Approximate dynamic programming for missile defense interceptor fire control [J].
Davis, Michael T. ;
Robbins, Matthew J. ;
Lunday, Brian J. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 259 (03) :873-886
[8]  
Eckler A.R., 1972, Mathematical models of target coverage and missile allocation
[9]   Weapon-Target Assignment for Multi-to-Multi Interception With Grouping Constraint [J].
Guo, Dong ;
Liang, Zixuan ;
Jiang, Peng ;
Dong, Xiwang ;
Li, Qingdong ;
Ren, Zhang .
IEEE ACCESS, 2019, 7 :34838-34849
[10]   Harris hawks optimization: Algorithm and applications [J].
Heidari, Ali Asghar ;
Mirjalili, Seyedali ;
Faris, Hossam ;
Aljarah, Ibrahim ;
Mafarja, Majdi ;
Chen, Huiling .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 97 :849-872