计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (25): 228-230.

• 工程与应用 • 上一篇    下一篇

航迹和飞行计划相关算法的改进

陈宇寒1,2,程 铭3   

  1. 1.南京理工大学 计算机科学与工程学院,南京 210094
    2.中国电子科技集团公司 第二十八研究所,南京 210007
    3.海军指挥学院 海战实验室,南京 210016
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-09-01 发布日期:2011-09-01

Improved algorithm of associating with radar track and flight plan

CHEN Yuhan1,2,CHENG Ming3   

  1. 1.School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094,China
    2.The 28th Research Institute of China Electronics Technology Group Corporation,Nanjing 210007,China
    3.Naval War Gaming Center,Navy Command College,Nanjing 210016,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-09-01 Published:2011-09-01

摘要: 针对航迹与飞行计划相关算法中出现的运算效率差和结果不稳定等问题,对航迹相关算法进行改进。减少了参与相关度计算的航线数量,提高了相关度计算的效率;采用遗传蚁群算法根据相关度对航迹与飞行计划进行整体匹配,解决了采用简单依次匹配所带来的结果不稳定性。通过仿真进行验证。

关键词: 飞行计划, 航迹, 相关, 遗传算法, 蚁群算法

Abstract: Aiming at some problems in the algorithm of associating with radar track and flight plan,for example,work efficiency is low,and the result is not stable,some improvements are taken to algorithm of track association.The number of tracks that is used for associating degree is decreased.It improves on its efficiency.According to associating degree,using Genetic Algorithm and Ant Colony Algorithm(GAACA) totally matches the radar track and flight plan.This solves the stability of simply matching by turns.A simulation example is taken to validate these improvements.

Key words: flight plan, track, association, Genetic Algorithm(GA), Ant Colony Algorithm(ACA)