基于遗传算法的巡飞器路径规划  

Path Plan for Loitering Unit Based on Genetic Algorithm

作　　者：王玥[1] 李东光[1] 申强[1] 

机构地区：[1]北京理工大学宇航科学技术学院,北京100081

出　　处：《弹道学报》2007年第3期38-40,共3页Journal of Ballistics

摘　　要：分析和对比了可应用于巡飞器路径规划的几种主要研究方法,提出了基于遗传算法的巡飞器巡飞路径规划方法.针对出现的多目标优化问题,采用分时分目标的优化方法,减小了计算量,有效地加快了解向期望值的收敛速度.针对探测阶段的定高度和变高度巡飞路径进行了规划,得到了满足要求的优化结果,给出了所需要的最小航程,为后续的巡飞器推力方案设计和气动外形设计提供了依据.Several main research methods used for path plan of loitering unit were analyzed and compared. A path plan method of loitering unit based on Genetic Algorithm was proposed. Aiming at the multitarget optimization problem, optimization method that different target was optimized at different period was adopted. It reduces calculation quantity and accelerates the convergence of solution to expectation value effectively. Loitering path planning for fixed and variant altitude was carried out, and satisfactory optimization results were achieved. The minimum loitering range needed was obtained. These results provide theoretical basis for thrust scheme design and aerodynamic shape design of loitering unit.

关 键 词：巡飞 遗传算法 路径规划 

分 类 号：TJ012.3[兵器科学与技术—兵器发射理论与技术]