基于蚁群算法的舰载机避障路线分析  

Analysis of Obstacle Avoidance Route of Carrier Based on Ant Colony Algorithm

作　　者：张天赫 彭绍雄[1] 罗亚民 王城超 

机构地区：[1]海军航空工程学院飞行器工程系,山东烟台264001

出　　处：《兵工自动化》2017年第10期71-74,共4页Ordnance Industry Automation

摘　　要：为了使舰载机编队在突破飞行过程中保持最大的生存概率,针对具有不同威胁程度的威胁体的舰载机避障路径规划问题,提出了一种不同于V图的初始路径构图方法,通过蚁群算法得到了模型中舰载机遭遇各威胁体的避障方式,以及相同威胁度与不同威胁度情况下的避障路线,并进行仿真验证。仿真结果表明:该方法给出最优的避障路线能有效解决V图只能对相同威胁体进行规划的难题,在威胁度与距离2个问题上取得平衡,可进一步推广应用于不同威胁体的多机协同路径规划,为舰载机飞行中过程中的路径规划问题提供了理论依据。In order to make the aircraft carrier formation keeping the maximum survival probability in the breakthrough during the flight, the aircraft get a different degree of threat, obstacle avoidance and path planning problems. Put forward a kind of initial path mapping method which is different from the V diagram. Through ant algorithm, acquired obstacle avoidance method of carrier based aircraft in model, and obstacle avoidance route in the same threat degree and different threats, then carried out simulation verification. The simulation results show that the optimal method of obstacle avoidance route can effectively solve the problem of V only planning on the same threat of the balance in the two issue of the threat degree and distance, can be further generalized to multi aircraft cooperative path planning for different threats, provides a theoretical basis for the problem of path planning for ship borne in the process of flight.

关 键 词：蚁群算法 路径规划 舰载机 避障路线 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]