首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于进化计算的无人飞行器多航迹规划
引用本文:郑昌文,李磊,徐帆江,丁明跃,苏康.基于进化计算的无人飞行器多航迹规划[J].宇航学报,2005,26(2):223-227,235.
作者姓名:郑昌文  李磊  徐帆江  丁明跃  苏康
作者单位:1. 中国科学院软件研究所通用软件实验室,北京,100080
2. 华中科技大学图像识别与人工智能研究所,武汉,430074
3. 中国航天科工集团三院研发中心,北京,100074
基金项目:中国博士后科学基金(20040350424)
摘    要:针对飞行器多航迹规划问题展开研究。在分析多峰值函数优化问题的基础上,提出了一种基于进化计算的飞行器多航迹规划方法。该方法通过使用特定的染色体表示方法和进化算子,可以有效利用各种环境信息,处理各种航迹约束。同时,通过引入聚类算法,将种群中的个体按其空间分布进行聚类,生成若干个不同子种群。在进化过程中,所有个体只在各自的子种群内部进化。当进化结束时,每个子种群将分别生成一条各自的最优航迹,从而为飞行器生成多条不同的可选航迹。仿真结果表明了该方法的有效性。

关 键 词:无人飞行器  多航迹规划  进化计算  聚类
文章编号:1000-1328(2005)02-00223-05

Multiple Routes Planning for Unmanned Air Vehicle Based on Evolutionary Computation
ZHENG Chang-wen,LI Lei,XU Fan-jiang,DING Ming-yue,SU Kang.Multiple Routes Planning for Unmanned Air Vehicle Based on Evolutionary Computation[J].Journal of Astronautics,2005,26(2):223-227,235.
Authors:ZHENG Chang-wen  LI Lei  XU Fan-jiang  DING Ming-yue  SU Kang
Institution:ZHENG Chang-wen~1,LI Lei~1,XU Fan-jiang~1,DING Ming-yue~2,SU Kang~3
Abstract:The multiple routes planning problem of UAVs is studied. Based on the analysis of multi-modal function optimization using evolutionary computation, a new multiple routes planner for unmanned air vehicles is proposed. With a problem-specific real-value representation of candidate solutions and genetic operators, the algorithm can take into account different kinds of environmental information, and handle various mission constraints. By introducing the clustering technical, the individuals 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 sub-population. 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.
Keywords:Unmanned air vehicles  Multiple routes planning  Evolutionary computation  Clustering  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号