###
工程科学与技术:2016,48(5):98-104
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
基于二次代码集的飞行计划配对算法研究
(视觉合成图形图像技术国家重点学科实验室,国家空管自动化系统技术重点实验室)
Study on Algorithm for Flight Plan Pairing Based on SSR Code Set
(Notional Key Lab. of Fundamental Sci. on Synthetic Vision,National Key Lab. of Air Traffic Control Automatization System Technol)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1436次   下载 380
投稿时间:2016-02-26    修订日期:2016-05-23
中文摘要: 针对包含空域飞行阶段且不存在二次代码的飞行计划配对问题,首次提出一种基于“二次代码集”的飞行计划与航迹配对方法。该方法首先利用边界搜索算法提取航迹轨迹轮廓,然后将其与计划轨迹分为航路飞行阶段和空域飞行阶段计算配对置信度,并将配对置信度与事先设定的置信度阈值相比较确定是否配对;同时针对长期计划的计划轨迹不变性提出一种基于航迹历史轨迹时间序列分类学习的方法处理其配对问题。通过某大型流量系统应用实践证明,提出的飞行计划配对方法不仅能解决常规计划配对问题,也能较好地适应当前系统中存在的二次代码缺失的飞行计划配对问题。
Abstract:Aiming at the pairing issue for flight plan which contains a airspace phase but without SSR(secondary surveillance radar) code,a novel method based on SSR code set for matching plan and track was proposed.Firstly,the boundary search algorithm was used to extract the contour of track,then for computing the matching confident factor the planned trajectory of flight plan was splited into route phase and airspace phase,and compared with the presettable threshold to determine the partnership between flight plan and track.At the same time,a novel time series classification learning method based on the trajectory of historical track was presented to deal with the issue of long term flight plan because of its property of invariance plan trajectory.The result of the application of a large scaled flow management system proved that the proposed algorithm can not only solve the pairing problems of the general flight plan,but also solve the flight plan without SSR code with a good adaptability.
文章编号:201600149     中图分类号:    文献标志码:
基金项目:军民航空管联合运行一体化模拟训练技术研究(GKG201403004)
作者简介:
引用文本:
林毅,张建伟,刘洪.基于二次代码集的飞行计划配对算法研究[J].工程科学与技术,2016,48(5):98-104.
Lin Yi,Zhang Jianwei,Liu Hong.Study on Algorithm for Flight Plan Pairing Based on SSR Code Set[J].Advanced Engineering Sciences,2016,48(5):98-104.