检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]空军工程大学导弹学院,陕西三原713800 [2]空军装备研究院总体所,北京100076
出 处:《电光与控制》2008年第4期66-69,共4页Electronics Optics & Control
摘 要:为保证巡航导弹低空突防的成功率,在航迹规划时必须设计出以最小代价的可接受航程为目标的航迹。提出一种基于混合优化策略的航迹优化方法。该方法通过用退火机制来减轻遗传算法中的选择压力,将模拟退火和遗传算法相结合用于航迹优化,增强了航迹优化算法的全局收敛性和提高了算法的收敛速度。同时方法中还采用了聚类算法,将各条航迹按照其空间分布,化成不同的多个种群,进化后可得到不同区域的优化航迹,从而有效地保持了解的多样性,能一次生成多条航迹,可满足通常航迹优化过程中生成多条航迹的要求。最后的仿真结果表明了该方法的可行性和有效性。To guarantee the successful low-altitude penetration of cruise missiles, an acceptable route with the minimum cost should be taken as the goal in route planning. A method of route optimization based on mixed optimized strategy is put forward. A new evolutionary algorithm which combining Simulated Annealing with Genetic Algorithms (GASA) is proposed.The algorithm avoids the premature convergence problem existed in genetic algorithms, enhances the global convergence, and improves the convergence velocity. By introducing the clustering technique, the individuals (here is the route) of the population are clustered according their distribution in the space, and form a number of sub-populations. In the evolutionary process, all routes evolve only in their own subpopulation. At the end of the evolution, each sub-population provides an optimal route, and thus the algorithm generates multiple routes for the vehicle. The simulation results demonstrated the feasibility of the approach.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249