摘要
为了快速检测空域冲突、及时进行冲突消解,针对现有空域冲突检测算法计算量大、速度慢问题,设计了一种空域冲突检测算法。该算法采用正二十面体剖分方式,将空域格网化;结合矩阵运算,大大降低了空域冲突检测运算量。该算法在大规模空域冲突检测时能够快速、准确地检测出空域冲突位置和冲突空域编号。
To rapidly detect airspace conflict and resolute conflict in time,and aimed at problem of current algorithm for airspace conflict detection about heavy and slow calculation burden,an airspace conflict detection algorithm is designed.The algorithm adopts regular icosahedron subdivision mode,and the airspace is gridded.Combined with matrix operation,the calculation amount of airspace conflict detection is greatly reduced.In large-scale airspace conflict detection,the algorithm can quickly and accurately detect the location and the number of airspace conflicts.
作者
赵顾颢
曲凯
张阳
王梦迪
韩露尧
陈金良
ZHAO Guhao;QU Kai;ZHANG Yang;WANG Mengdi;HAN Luyao;CHEN Jinliang(Air Traffic Control and Navigation College,Air Force Engineering University,Xi'an 710051,China;State Key Laboratory of Air Traffic Management System and Technology,Nanjing 210023,China;Unit 94789 of PLA,Nanjing 210023,China;Unit 94995 of PLA,Nantong 226500,Jiangsu,China;School of Aeronautics and Astronautics,Xihua University,Chengdu 610039,China)
出处
《指挥信息系统与技术》
2023年第4期70-76,90,共8页
Command Information System and Technology
基金
2021年度空中交通管理系统与技术国家重点实验室开放基金(SKLATM202106)资助项目。
关键词
空域冲突检测
格网化
全球离散格网
airspace conflict detection
gridding
global discrete grids
