系统工程与电子技术

• 电子技术 • 上一篇    下一篇

多机协同电子战规划压制干扰布阵研究

张欢1, 杨任农1, 吴军1, 李秋妮1, 傅修竹2, 孙长月3   

  1. 1. 空军工程大学航空航天工程学院, 陕西 西安 710038; 2. 中国人民解放军95889部队,
    甘肃 酒泉 735018; 3. 西安思源学院商学院, 陕西 西安 710038
  • 出版日期:2017-02-25 发布日期:2010-01-03

Research on multi-aircraft cooperative suppressing jamming embattling in electronic warfare planning

ZHANG Huan1, YANG Rennong1, WU Jun1, LI Qiuni1, FU Xiuzhu2, SUN Changyue3   

  1. 1. Air Force Engineering University Aeronautics and Astronautics of Engineering College, 
    Xian 710038, China;2. Unit 95889 of the PLA, Jiuquan 735018, China; 3. School of 
    Business, Xian Siyuan University, Xian 710038, China
  • Online:2017-02-25 Published:2010-01-03

摘要:

针对电子战任务规划中的多机协同压制敌防空雷达网的干扰布阵问题,提出了航线规划安全区概念,基于数学形态学方法对安全区最小宽度进行求解,以安全区最小宽度和各部干扰机距敌方雷达网中心距离之和作为目标函数,构建了干扰布阵的多目标优化模型,采用多目标粒子群优化算法对模型进行求解,通过仿真实验对求解出的Pareto最优解集进行分析,得出了各部干扰机压制敌雷达网的最优干扰布阵方式,验证了所建多目标优化模型的正确性,同时也表明多目标粒子群优化算法在求解多机协同电子战干扰布阵问题是可行的、有效的

Abstract:

For the jamming embattling problem of multi-aircraft cooperative suppressing enemy air defense radar network in electronic warfare mission planning. Firstly, the concept of route planning security zone is proposed and the solution to get the minimum width of security zone based on mathematical morphology is put forward. Secondly, the minimum width of security zone and the distance from each jamming aircraft to the center of radar network are regarded as the objective function, and the multi-objective optimization model of jamming embattling is built, then the multi-objective particle swarm optimization algorithm is used to solve the model. Finally, the Pareto optimal solution is analyzed by simulation, and the optimal jamming embattling way of each jamming aircraft suppressing enemy air defense radar network is obtained, which verifies the correctness of the multi-objective optimization model. It also shows that the multi-objective particle swarm optimization algorithm is feasible and effective in terms of solving the multiaircraft cooperative electronic warfare jamming embattling.