基于改进Fish-Search算法的机弹协同航线规划

Airplane Route Planning for Plane-missile Cooperation Using Improved Fish-Search Algorithm

文中提出利用改进的鱼群算法解决一类机弹协同问题中飞机协同航线规划问题的方法。首先对此类协同问题进行了数学描述,综合考虑了机弹协同中的可通视性、航线危险代价、最大协同距离和机弹相对方位等多种关键因素,建立了机弹协同规划中飞机航线的约束条件和评价指标;针对此类规划问题的特点,提出了利用鱼群算法进行求解的方法;通过对鱼群算法进行禁忌公告和生存机制等改进,提高了规划算法的收敛速度,对改进前后的算法进行了仿真对比;最后,通过仿真证明文中所提出的改进算法能够解决此类机弹协同航线规划问题。

An improved Fish-Search algorithm was proposed for airplane route planning of a class of plane-missile cooperation. The mathematical description of this class of cooperation was introduced. Comprehensively considered such key factors of the cooperation as visibility, threat, maximum distance and relative orientation, the constraint conditions and evaluation index were constructed. According to the characteristics of the problem, the Fish-Search algorithm was used to solve the problem, and was improved by introducing a tabu bulletin board and the survival mechanism. As is shown in the comparison of the simulation results of the original and the improved algorithm, the convergence rate was improved. Finally,it was proved by simulation that the proposed algorithm is suitable for solving the discussed problem.