摘要
对飞行计划冲突预探测进行了彻底的研究,给出了相应的预探测算法。在对各种冲突类型进行研究的同时,针对航迹交叉时横向间隔的冲突探测——预探测中最困难的问题,给出了相关的探测模型,结合严密的数学理论推导,得出相关的求解公式,全面地解决了该问题。当冲突存在时,该算法确定地给出冲突时间段和冲突的航路段。实践表明,该算法是非常有效的。
Flight plan conflict advance detection was studied drastically, and an interrelated algorithm was presented. When all kinds of conflicts were studied, a method to solve the most difficult conflict detection of lateral separation of track intersection was given. In the method, it provided a detection model with strict mathematics reasoning. Finally, it gave a formula to detect this kind of conflict. When the conflict exists, the definite segment of conflict time and conflict fairway could be provided. In practice, it is effective.
出处
《计算机工程与设计》
CSCD
北大核心
2006年第3期430-432,共3页
Computer Engineering and Design
关键词
空中交通管制
飞行计划冲突
飞行问隔
航迹交叉
预探测
air traffic control
flight plan conflict
flight separation
track intersection
advance detection
