检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学图像识别与人工智能研究所多谱信息处理技术国家级重点实验室,武汉430074
出 处:《宇航学报》2011年第4期756-761,共6页Journal of Astronautics
摘 要:为了提高现有航迹规划系统的实时规划能力,对基于分层策略的航迹规划方法中全局规划部分进行改进,提出了基于病毒遗传算法的快速规划方法。分层策略的航迹规划包括全局规划和局部规划,由于对不同性质的约束条件分阶段进行处理,该方法降低了航迹规划的计算复杂度。但全局规划采用的标准遗传算法仍存在早熟和局部收敛慢的问题。针对这些缺陷,采用病毒遗传算法进行改进。结合航迹规划的领域知识,给出了病毒种群的编码方法并设计了特定的病毒感染算子,使航迹寻优效率得以提高。仿真实验表明,在相同约束条件下,该方法能更快生成满足战术要求的航迹。To enhance the real time planning ability of existing system,a fast path planning method based on virus-evolutionary genetic algorithm is proposed,the proposed method is aimed at improving the global step of a path planning method based on hierarchical strategy.The hierarchical planning method is used to efficiently handle path constraints by dividing the whole planning process into two steps: global planning and local planning.Employing a hierarchical strategy,this method may reduce the computation complexity.However it is well known that problems of premature and weakness in local searching exist in the genetic algorithm used in global planning.To overcome problems,the theory of virus-evolution is introduced into the global planning step.By designing a problem-specific representation of virus solutions and its virus infection operators,the convergence performance and search efficiency are improved.Simulation results show that given the same path constraints our method can fast generate a satisfactory path.
分 类 号:V249[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117