Design of Kill Chain Reconstruction Method Based on Particle Swarm Optimization Algorithm

In this paper, the problem of rapidly reconstructing the kill chain for tasks due to the frequent changes of battlefield situation in the current beyond-visual-range cooperative air combat is studied. The kill chain is approximated as a series of action combinations arranged in chronological order for the target. Based on the idea of sequential decision-making, the reconstruction problem is transformed into a task redistribution problem at each stage of the kill chain. When the reconstruction condition is triggered, the full-chain reconstruction is performed, which reduces the complexity of the problem. By using the improved particle swarm optimization algorithm and relying on the kill chain effectiveness evaluation as the objective function, the combat resources and combat tasks are screened and matched. Through simulation experiments, the results obtained by the algorithm are compared with the results obtained by the enumeration method, which verifies that the algorithm can improve the speed of problem solving while ensuring the effectiveness of the results.

Authors

Institutions

Publication Details

Published
2025-06-30
DOI
https://doi.org/10.1109/icca65672.2025.11129717
Primary Topic
Educational Technology and Assessment
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of Kill Chain Reconstruction Method Based on Particle Swarm Optimization Algorithm

Jian-dong Zhang, Wenli Yan, Qiming Yang, Guoqing Shi et al.
Educational Technology and Assessment
article

Design of Kill Chain Reconstruction Method Based on Particle Swarm Optimization Algorithm

Jian-dong Zhang, Wenli Yan, Qiming Yang, Guoqing Shi, Yongxin Jiang
article en

Abstract

In this paper, the problem of rapidly reconstructing the kill chain for tasks due to the frequent changes of battlefield situation in the current beyond-visual-range cooperative air combat is studied. The kill chain is approximated as a series of action combinations arranged in chronological order for the target. Based on the idea of sequential decision-making, the reconstruction problem is transformed into a task redistribution problem at each stage of the kill chain. When the reconstruction condition is triggered, the full-chain reconstruction is performed, which reduces the complexity of the problem. By using the improved particle swarm optimization algorithm and relying on the kill chain effectiveness evaluation as the objective function, the combat resources and combat tasks are screened and matched. Through simulation experiments, the results obtained by the algorithm are compared with the results obtained by the enumeration method, which verifies that the algorithm can improve the speed of problem solving while ensuring the effectiveness of the results.

Northwestern Polytechnical University (CN), AVIC Optronics (China) (CN)
Aeronautical Science Foundation of China
Openalex Percentile: Top 66%
Educational Technology and Assessment
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Design of Kill Chain Reconstruction Method Based on Particle Swarm Optimization Algorithm — Jian-dong Zhang, Wenli Yan, et al. · (2025) | TGRS Research Map | TGRS