• Electronics Optics & Control
  • Vol. 23, Issue 6, 34 (2016)
LIU Jing-shu1、2, JIANG Wen-zhi1, and DAI Jin-jin1
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less
    DOI: 10.3969/j.issn.1671-637x.2016.06.008 Cite this Article
    LIU Jing-shu, JIANG Wen-zhi, DAI Jin-jin. Target Allocation for Air-Defense of Key Position Under Dynamic Fire Access[J]. Electronics Optics & Control, 2016, 23(6): 34 Copy Citation Text show less

    Abstract

    Under the background of navel air-defense of key positions, analysis is made to the key influence factors of target assignment problem under Dynamic Fire Access (DFA), and the constraint conditions on time, space and resource are presented. Then the methods for calculating the ready-to-launch zone as well as the deadline of integrated firepower unit are given. The assignment problem is considered as the optimal matching among launch node, guide node and target. The Anytime algorithm based on Discrete Particle Swarm Optimization (DPSO) is designed for solving the assignment problem. Simulation result shows that the algorithm can obtain the optimal assignment scheme rapidly under given constraints of time, space and resources.
    LIU Jing-shu, JIANG Wen-zhi, DAI Jin-jin. Target Allocation for Air-Defense of Key Position Under Dynamic Fire Access[J]. Electronics Optics & Control, 2016, 23(6): 34
    Download Citation