遗传算法在多机飞行冲突解脱中的应用  

Conflict Resolution of Multi-aircraft Flight Based on Genetic Algorithm

作　　者：姚成 林琳[1] 李妮锶 YAO Cheng;LIN Lin;LI Nisi(Academy of Flight Technology and Safety,Civil Aviation Flight University of China,Guanghan 618300,China)

机构地区：[1]中国民用航空飞行学院,民航飞行技术与飞行安全科研基地,四川广汉618300

出　　处：《微型电脑应用》2022年第5期28-31,共4页Microcomputer Applications

基　　金：四川省科技计划资助(2021YFG0180)。

摘　　要：为了应对自由飞行时飞机间的冲突解脱问题,利用遗传算法具有的简单、应用范围广以及扩展性强等显著特点,提出了一种基于遗传算法得到最优冲突解脱航迹的路径规划算法。仿真结果表明,对于两机间以及多机间的飞行冲突解脱问题,该算法均能通过改变飞行航向快速有效地得出最优冲突解脱路径,达到解脱的目的。In order to solve the problem of conflict resolution between aircrafts in free flight,a conflict resolution path planning method based on genetic algorithm was proposed by taking advantage of the obvious characteristics of genetic algorithm such as simplicity,wide application range and strong expansibility.The simulation results show that the algorithm can quickly and effectively obtain the optimal conflict resolution path by changing the flight direction for both two aircraft and multiple aircraft to achieve the purpose of conflict resolution.

关 键 词：自由飞行 冲突解脱 遗传算法 路径规划 

分 类 号：V35[航空宇航科学与技术—人机与环境工程]