摘要
有危险区域约束的无人机巡航路径问题实际上是带有约束条件的TSP问题,为此考虑了多边形和圆盘两种危险区域约束。首先用Floyd算法求出各顶点之间的避开危险区域的最短路径值,然后利用改良圈算法求得一个较好的初始种群,再应用遗传算法就可以求得一个较满意的解。最后利用Matlab7.12对算法进行仿真,验证了算法的实时性和可行性。
The cruise route problem of unmanned aerial vehicle（UAV） with dangerous zone constraint is actually the TSP problem with constraint conditions.In this paper we consider two dangerous zone constraints,polygon and disk.First,we employ the Floyd algorithm to get the shortest paths between each pair vertexes which avoid the risky zone.Then we find a preferable primitive population using circle modification algorithm,and by applying genetic algorithm the satisfactory solution can then be achieved.Finally the simulation is done by Matlab 7.12.The property of real time and feasibility for the algorithm is verified.
出处
《计算机应用与软件》
CSCD
北大核心
2012年第9期271-273,共3页
Computer Applications and Software
关键词
FLOYD算法
改良圈算法
遗传算法
Floyd algorithm ,Circle modification algorithm ,Genetic algorithm
