Multi-Stage Dynamic Target Assignment Method Based on Improved Discrete PSO Algorithm

With regard to the problem of uncertainty of interception results in the dynamic weapon target assignment in modern warfare, a multi-stage dynamic target assignment model with the objective of minimizing the overall threat degree of the targets is established. An improved discrete particle swarm optimization algorithm is designed, which firstly generates the initial population according to the threat degree of the surviving targets combining both ordered allocation and random allocation. Then the inertia weights are controlled in the form of Sigmoid function to balance the global and local search ability of the particles in the pre and post search process; the acceleration coefficients are controlled in the form of hyperbolic tangent function to reduce the probability of falling into the local optimal solution. Finally, the target assignment model is solved by the inverse-order recursion method of stochastic dynamic programming to obtain the sequence of weapon target assignment scheme. Results show that the model and algorithm are significantly superior to the single-phase static target assignment in terms of the overall threat expectation of the targets.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icus61736.2024.10840088
Primary Topic
Military Defense Systems Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Stage Dynamic Target Assignment Method Based on Improved Discrete PSO Algorithm

Z. G. Xiao, H. L. Tian, D.T.Y. Cheng, Qiquan Wang
1 links
Military Defense Systems Analysis
article

Multi-Stage Dynamic Target Assignment Method Based on Improved Discrete PSO Algorithm

Z. G. Xiao, H. L. Tian, D.T.Y. Cheng, Qiquan Wang
article en

Abstract

With regard to the problem of uncertainty of interception results in the dynamic weapon target assignment in modern warfare, a multi-stage dynamic target assignment model with the objective of minimizing the overall threat degree of the targets is established. An improved discrete particle swarm optimization algorithm is designed, which firstly generates the initial population according to the threat degree of the surviving targets combining both ordered allocation and random allocation. Then the inertia weights are controlled in the form of Sigmoid function to balance the global and local search ability of the particles in the pre and post search process; the acceleration coefficients are controlled in the form of hyperbolic tangent function to reduce the probability of falling into the local optimal solution. Finally, the target assignment model is solved by the inverse-order recursion method of stochastic dynamic programming to obtain the sequence of weapon target assignment scheme. Results show that the model and algorithm are significantly superior to the single-phase static target assignment in terms of the overall threat expectation of the targets.

China Aerospace Science and Industry Corporation (China) (CN)
Openalex Percentile: Top 56%
Military Defense Systems Analysis
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.

Multi-Stage Dynamic Target Assignment Method Based on Improved Discrete PSO Algorithm — Z. G. Xiao, H. L. Tian, et al. · (2024) | TGRS Research Map | TGRS