基于K-近邻的自由飞行冲突探测研究

交通运输系统工程与信息 ›› 2013, Vol. 13 ›› Issue (6): 169-175.

基于K-近邻的自由飞行冲突探测研究

赵元棣^*a，孙禾^b，王洁宁^b

中国民航大学 a.天津市空管运行规划与安全技术重点实验室； b. 空中交通管理研究基地，天津 300300

收稿日期:2013-05-30 修回日期:2013-07-13 出版日期:2013-12-24 发布日期:2014-01-14
作者简介:赵元棣(1983－)，男，天津人，助理研究员，博士.
基金资助:
国家自然科学基金重点项目（61039001）；中央高校基本科研业务费专项资金资助项目（ZXH2012N004, 3122013P008, ZXH2012D002）；中国民航大学科研启动基金（2012QD02X）.

Research on Free Flight Conflict Detection Based on K-Nearest Neighbor

ZHAO Yuan-di^a, SUN He^b, WANG Jie-ning^b

a. Tianjin Air Traffic Management Operational Planning and Safety Technology Laboratory; b. Air Traffic Management Research Base, Civil Aviation University of China, Tianjin 300300, China

Received:2013-05-30 Revised:2013-07-13 Online:2013-12-24 Published:2014-01-14

摘要/Abstract

摘要：

在三维空间中，针对自由飞行条件下航空器间的冲突探测问题，提出一种基于K-近邻的冲突探测方法.利用K-近邻方法建立距离矩阵，在此基础上通过冲突判定规则，对存在冲突的航空器进行探测.本文方法能够同时探测多架航空器间的冲突，并且计算复杂度仅为O(n)，相比于传统方法提高了计算效率.当空域内有航空器发生位置变化时，只需局部修改距离矩阵即可重新探测冲突.此外，本文还给出K值的自适应计算方法，避免了不必要的距离探测.通过对空域内若干架航空器进行仿真实验，表明本文方法能够快速、准确地探测出存在冲突的航空器，有效减轻管制员的工作负荷.

关键词: 航空运输, 冲突探测, K-近邻, 自由飞行, 距离矩阵

Abstract:

In order to detect aircraft conflicts under the condition of free flight in three-dimensional space, a conflict detection method based on K-Nearest Neighbor is proposed. On the basis of establishing distance matrix by K-Nearest Neighbor, the aircraft conflicts are detected according to the conflict decision rules. The presented method can detect conflicts among several aircraft simultaneously with computation complexity O(n), which improves the computational efficiency compared with traditional methods. The distance matrix only needs to be modified locally in order to redetect conflicts when the positions of some aircraft change. Besides, an adaptive calculation method of K is proposed for avoiding unnecessary distance detection. Simulation experiments on many aircraft in the airspace demonstrate that the proposed method can detect the aircraft conflicts rapidly and accurately, so it can reduce the workload of controllers effectively.

Key words: air transportation, conflict detection, K-Nearest Neighbor, free flight, distance matrix

中图分类号:

赵元棣，孙禾，王洁宁. 基于K-近邻的自由飞行冲突探测研究[J]. 交通运输系统工程与信息, 2013, 13(6): 169-175.

ZHAO Yuan-di, SUN He, WANG Jie-ning. Research on Free Flight Conflict Detection Based on K-Nearest Neighbor[J]. Journal of Transportation Systems Engineering and Information Technology, 2013, 13(6): 169-175.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/abstract/abstract18695.shtml

http://www.tseit.org.cn/CN/Y2013/V13/I6/169

参考文献

[1]Final report of RTCA task force 3-free flight implementation[R]. Washington DC: RTCA Inc, 1995.

[2]周向华. 冲突探测与解脱技术在未来空中交通管理中的应用[D]. 南京: 南京航空航天大学. 2009. [ZHOU X H. Research on technologies of the conflict detection and resolution for future air traffic management[D]. Nanjing: Nanjing University of Aeronautics and Astronautics, 2009.]

[3] Alliot J M,Gruber H,Joly G,et,et al. Geneticalgorithms for solving air traffic control conflicts[C]//The Ninth Conference on Artificial Intelligence for Applications, 1993: 338-344.

[4]Krozel J, Mueller T, Hunter G. Free flight conflict detection and resolution analysis[C]//AIAA Guidance, Navigation and Control Conference, San Diego, California USA, July, 1996.

[5]Versteegt H H, Visser H G. Traffic complexity based conflictresolution[J]. Air Traffic Control Quarterly, 2003, 11(2): 103-122.

[6]靳学梅, 自由飞行行空域中多机冲突探测与解脱技术研究[D]. 南京: 南京航空航天大学. 2004. [JIN X M. The research of technologies on the conflict detection and resolution among multi-aircraft in free flight airspace[D]. Nanjing: Nanjing University of Aeronautics and Astronautics, 2004.]

[7]程丽媛. 自由飞行空域中多机冲突探测与解脱技术研究[D]. 南京: 南京航空航天大学. 2005. [CHENG L Y. Research on technologies of the conflict detection and resolution among multi-aircraft in free flight airspace[D]. Nanjing: Nanjing University of Aeronautics and Astronautics, 2005.]

[8]刘星, 胡明华, 韩松臣. 自由飞条件下的冲突探测与解脱方法[J]. 南京理工大学学报, 2002, 26(增刊): 56-60. [LIU X, HU M H, HAN S C. The study on flight conflicts detection and solving[J]. Journal of Nanjing University of Science and Technology, 2002, 26(Supp): 56-60.]

[9]刘星, 韩松臣. 用于自由飞行冲突探测的Delaunay方法[J]. 数据采集与处理, 2002, 17(4): 446-449. [LIU X, HAN S C. Delaunay method for free flight conflict detection[J]. Journal of Data Acquisition & Processing, 2002, 17(4): 446-449.]

[10]刘昕. 基于计算几何方法的飞行冲突检测[J]. 电子测量技术, 2007, 30(4): 87-89. [LIU X. Conflict detection in free flight based on computational geometry method[J]. Electronic Measurement Technology, 2007, 30(4): 87-89.]

[11] T M Cover, P E Hart. Nearest neighbor pattern classification[J]. IEEE Transactions on Information Theory, 1967, 13(1): 21-27.

[12]刘晓红. 基于支持向量机和K近邻的联合分类研究[D]. 哈尔滨: 哈尔滨工程大学. 2011. [LIU X H. Research on the joint classification based on support vector machine and K-nearest neighbor[D]. Harbin: Harbin Engineering University, 2011.]

[13]周而重, 逄玉俊. 一种改进的K近邻法在模式识别中的应用[J]. 沈阳师范大学学报（自然科学版）, 2007, 25(4): 475-478. [ZHOU E Z, PANG Y J. Application of an improved K-nearest neighbor approach in pattern recognition[J]. Journal of Shenyang Normal University (Natural Science), 2007, 25(4): 475-478.]

[14]V Vaidehi, S Vasuhi, R Kayalvizhi, et al. Person authentication using face recognition[C]//Proceedings of the World Congress on Engineering and Computer Science, 2008.

[15]徐晓艳. 基于K近邻算法的中文文本分类研究[D]. 合肥: 安徽大学. 2012. [XU X Y. Research of Chinese text classification based on K neighbor algorithm[D]. Hefei: Anhui University, 2012.]

[16]鲁婷. K-近邻中文文本分类方法的研究[D]. 合肥: 合肥工业大学. 2010. [LU T. The research on K-nearest neighbor Chinese text categorization algorithm[D]. Hefei: HeFei University of Technology, 2012.]

[17]于滨, 邬珊华, 王明华,等. K近邻短时交通流预测模型[J]. 交通运输工程学报, 2012, 12(2): 105-111. [YU B, WU S H, WANG M H, et al. K-nearest neighbor model of short-term traffic flow forecast[J]. Journal of Traffic and Transportation Engineering, 2012, 12(2): 105-111.]

[18]杨小运. 约束Delaunay三角剖分算法的研究与应用[D]. 武汉: 武汉科技大学. 2012. [YANG X Y. The research and application of the delaunay triangulations algorithm[D]. Wuhan: Wuhan University of Science and Technology, 2012.]