TY - JOUR
T1 - Weapon-Target Assignment for Multi-to-Multi Interception with Grouping Constraint
AU - Guo, Dong
AU - Liang, Zixuan
AU - Jiang, Peng
AU - Dong, Xiwang
AU - Li, Qingdong
AU - Ren, Zhang
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2019
Y1 - 2019
N2 - This paper presents a weapon-target assignment (WTA) method for a multi-to-multi interception with fixed and adaptive grouping constraints. First, to get a better evaluation of the interception performance, the miss-distance under heading error, the time-to-go, and the line-of-sight rate are used to construct an interception probability function which considers the interception efficiency and the required energy. Second, to provide good engagement conditions for cooperative guidance in the case of multiple missiles against multiple targets, and meanwhile, to ensure that each target is allocated with appropriate interception resources, a fixed grouping strategy and an adaptive grouping strategy based on penalty function are proposed for the WTA problem. Then, the artificial bee colony algorithm is employed to solve the WTA problem with grouping constraints. Finally, two scenarios of multi-to-multi interception are simulated to verify the proposed WTA method. Results indicate that the method can realize the optimal allocation schemes which satisfy both the fixed and the adaptive grouping constraints.
AB - This paper presents a weapon-target assignment (WTA) method for a multi-to-multi interception with fixed and adaptive grouping constraints. First, to get a better evaluation of the interception performance, the miss-distance under heading error, the time-to-go, and the line-of-sight rate are used to construct an interception probability function which considers the interception efficiency and the required energy. Second, to provide good engagement conditions for cooperative guidance in the case of multiple missiles against multiple targets, and meanwhile, to ensure that each target is allocated with appropriate interception resources, a fixed grouping strategy and an adaptive grouping strategy based on penalty function are proposed for the WTA problem. Then, the artificial bee colony algorithm is employed to solve the WTA problem with grouping constraints. Finally, two scenarios of multi-to-multi interception are simulated to verify the proposed WTA method. Results indicate that the method can realize the optimal allocation schemes which satisfy both the fixed and the adaptive grouping constraints.
KW - Weapon-target assignment
KW - artificial bee colony algorithm
KW - cooperative attack
KW - grouping constraint
KW - multi-to-multi interception
UR - http://www.scopus.com/inward/record.url?scp=85063893001&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2019.2898874
DO - 10.1109/ACCESS.2019.2898874
M3 - Article
AN - SCOPUS:85063893001
SN - 2169-3536
VL - 7
SP - 34838
EP - 34849
JO - IEEE Access
JF - IEEE Access
M1 - 8640033
ER -