基于改进蚁群算法和共用航段的搜索救援通道规划

针对战斗搜救任务场景中,空中搜索救援等待区至跳伞区之间的往返路径规划问题,提出一种基于改进蚁群算法和共用航段的搜索救援通道规划方法。首先,针对基本蚁群算法易出现局部极值及收敛速度慢等缺点,对启发函数、状态转移策略、信息素更新策略进行了改进。然后,针对单起点多目标点的路径规划问题,提出了设置分航点以生成共用航段的搜索救援通道规划方法,并以总路径长度表征任务准备负荷量与分别规划航路进行对比。实验结果表明,在本文测试环境下,改进蚁群算法规划的路径长度分别缩减15.4%和14.2%,搜索救援通道的任务准备负荷量减少25.4%。所提出的搜索救援通道规划方法有一定的理论和应用价值。

A Search and Rescue Channel Planning Based on Improved Ant Colony Algorithm and Shared Flight Segmen

The round-trip path planning problems remaining between the air search and rescue waiting area and the parachute jump area in the combat search and rescue mission scenario, a search and rescue channel planning method is proposed based on the improved ant colony algorithm and shared flight segments. First, in view of the shortcomings of the basic ant colony algorithm, such as local extreme values and slow convergence speed, the heuristic function, state transition strategy, and pheromone update strategy are improved, and its path planning performance is verified. And then, for the path planning problem of single starting point and multiple target points, a search and rescue channel planning method is proposed to set branch points to generate shared flight segments. The total path length is used to represent the mission preparation load and compared with separately planned routes. The experimental results show that in the test environment of this article, the path length planned is reduced by 15.4% and 14.2% respectively by the improved ant colony algorithm, and the task preparation load of the search and rescue channel is reduced by 25.4%.The proposed search and rescue channel planning method has a certain theoretical and application value.