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
- Z. G. Xiao
- H. L. Tian (ORCID: https://orcid.org/0000-0003-0585-8279)
- D.T.Y. Cheng (ORCID: https://orcid.org/0000-0002-2733-9480)
- Qiquan Wang (ORCID: https://orcid.org/0000-0001-5265-1065)
Institutions
- China Aerospace Science and Industry Corporation (China) (CN)
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