Air defense firepower task assignment based on improved chainlike multi-population genetic algorithm

被引:0
|
作者
Tang J. [1 ]
Zhang D. [1 ]
Wang M. [2 ]
Liu L. [2 ]
机构
[1] School of Astronautics, Northwestern Polytechnical University, Xi'an
[2] Shaanxi Key Laboratory of Aerospace Flight Vehicle Design (Northwestern Polytechnical University), Xi'an
关键词
Air defense firepower task assignment; Chainlike multi-population; Diversity maintenance; Genetic algorithm; Hierarchical selection;
D O I
10.11918/202101056
中图分类号
学科分类号
摘要
In view of the threat of enemy air attack and the efficiency of solving the task assignment problem of medium-scale air defense firepower, a chainlike multi-population genetic algorithm (CMPGA) with superior performance was proposed. First, an improved air defense firepower task allocation model was established, which comprehensively investigates the threat degree of target and the interceptability judgment. The target threat degree was studied in terms of the threat factors such as the height, speed, range, and relative distance of the target. The time constraints, space constraints, and performance constraints were considered in the interceptability judgment, which was integrated into the kill probability to simplify the constraints of the model. Then, the CMPGA algorithm was proposed to solve the optimal allocation scheme of medium-scale air defense firepower. The algorithm utilized the strategy of limiting the number of repetitive individuals in the population, the cross mutation strategy of individuals with similar fitness, the deletion strategy of partial optimal solution when falling into local extremum, and the transfer strategy of the current optimal solution in the chain link. Combining the advantages of multi-population parallel search, the algorithm could speed up convergence speed, maintain the diversity of population, and avoid falling into local extremum. In the simulation of standard test function and the application to air defense firepower task allocation problem, the proposed algorithm was compared with several typical optimization algorithms. Results show that the CMPGA algorithm had advantageous performance and could quickly find the optimal solution with high probability, which indicates the effectiveness and superiority of the algorithm. Copyright ©2022 Journal of Harbin Institute of Technology.All rights reserved.
引用
收藏
页码:19 / 27
页数:8
相关论文
共 17 条
  • [11] LI Xiaoyang, ZHOU Deyun, PANQian, Et al., Weapon-target assignment problem by multi-objective evolutionary algorithm based on decomposition, Complexity, (2018)
  • [12] FENG Chao, JING Xiaoning, Weapon target assignment at multiple interception opportunities in composite strikes, Acta Aeronautica et Astronautica Sinica, 37, 11, (2016)
  • [13] HAO Kun, ZHAO Jiale, YU Kaicheng, Et al., Path planning of mobile robots based on a multi-population migration genetic algorithm, Sensors, 20, 20, (2020)
  • [14] SHI Xiaoqiu, LONG Wei, LI Yanyan, Et al., Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems, PLOS ONE, 15, 5, (2020)
  • [15] XIE Yongjie, Research on task assignment and cooperative guidance of multi-platform air defense missile, (2019)
  • [16] DEB K, PRATAP K, AGARWAL K, Et al., A fast and elitist multi-objective genetic algorithm: NSGA-Ⅱ, IEEE Trans on Evolutionary Computation, 6, 2, (2002)
  • [17] DONG Hao, LI Ye, Research on optimization of virtual machine deployment based on multi-population genetic algorithm, Control Engineering of China, 27, 2, (2020)