高空飞艇航迹规划的多种随机搜索算法  

Random Searching Algorithms of Route Planning for High Altitude Airships

作　　者：胡正东[1] 夏青[1] 蔡洪[1] 

机构地区：[1]国防科技大学航天与材料工程学院,湖南长沙410073

出　　处：《计算机仿真》2007年第7期55-58,共4页Computer Simulation

摘　　要：针对高空飞艇的航迹规划问题进行了分析和计算。考虑到高空飞艇的飞行特征,首先对其航迹规划问题进行了适当简化,转变为求解巡回旅行商问题(TSP),并给出相应的数学描述;然后在此基础上介绍遗传算法、蚁群算法和模拟退火算法,并运用这三种随机搜索算法求解高空飞艇最优航迹;最后通过仿真算例简要地分析和比较了各个随机搜索算法的性能。仿真结果表明以上三种随机搜索算法对于解决规模较大的高空飞艇航迹规划问题是行之有效的,求解效率高于传统搜索算法。Analysis and calculation of route planning of high altitude airship are carries out in the paper. Firstly, considering high altitude airships＇flight characteristics, this paper transforms properly the route planning problems into TSP and puts forward a corresponding mathematical description. Then, the main approaches respectively based on genetic algorithm, ant colony algorithm and simulated annealing algorithm are presented for searching optimal route . And finally the performance of each algorithm is analyzed briefly by a simulated experiment. The effectiveness of the three random searching algorithms for solving large - scale route planning problems is illustrated through simulated results, and their efficiency is higher than that of traditional random searching algorithms.

关 键 词：高空飞艇 航迹规划 巡回旅行商问题 随机搜索算法 遗传算法 蚁群算法 模拟退火算法 

分 类 号：TP83[自动化与计算机技术—检测技术与自动化装置]