摘要
为了解决自由飞行时飞机间的冲突解脱问题,提出了一种能够快速准确解算最优航路的算法.遗传算法具有简单通用、鲁棒性强等特点,应用遗传算法通过改变飞行航向和飞行速度2种方式解决了两机及多机间自由飞行冲突解脱问题,同时还探讨了多机相对飞行时冲突解脱的有效飞行机制.仿真结果表明,无论是改变飞行航向还是改变飞行速度,算法均能够较快地得出最优冲突解脱路线,同时当多机在一点处存在冲突时,采用改变航向的解脱方式具有更好的适用性.
In order to resolve the conflict among airplanes in free flight, the study proposed to examine a genetic al- gorithm to quickly solve the best route. The genetic algorithm was considered to be a simplification, generalization and strong robustness. By applying the genetic algorithm, the conflict relief among multi-planes can be resolved respectively by altering the heading, speed, and the effective flight mechanism when multiple airplanes are flying relatively at the same time. The simulation results show that the algorithm can achieve the optimal conflict relief route quickly by utilizing both methods, and if there is a conflict at a point among multi-planes, using the method of changing the heading is more applicable.
出处
《智能系统学报》
CSCD
北大核心
2013年第1期16-20,共5页
CAAI Transactions on Intelligent Systems
基金
国家自然科学基金资助项目(61079017)
关键词
多机
自由飞行
遗传算法
冲突解脱
飞行机制
multiple airplanes
free flight
genetic algorithm
conflict relief
flight mechanism
