巡飞器攻击阶段弹道规划方法  

Path Planning for the Attack Stage of a Loitering Unit

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

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

出　　处：《北京理工大学学报》2008年第1期8-10,共3页Transactions of Beijing Institute of Technology

基　　金：国家部委预研项目(0201001)

摘　　要：为了使攻击阶段巡飞器沿最优弹道飞向目标点并与之交会,完成攻击任务,提出了三维弹道规划分解算法.将三维弹道的规划问题分解为二维平面飞行路径和对应的高度值,分别计算,减少了计算量;在此基础上应用遗传算法对分解后的二维平面路径进行规划,得到了满意解.仿真结果表明,算法能有效地减少计算量,解决计算精度与计算量的矛盾.To make the loitering unit fly from its current point to the target point in shortest way and meet the target finally on the attack stage, a disassemble planning method of three-dimensional ballistic trajectory is put forward. The problem of three-dimensional ballistic trajectory planning is separated to planar path planning and corresponding altitude. Quantity of computation is reduced, and the planning of planar path after separation is carried out. The result shows that the algorithm can effectively reduce the amount of computation and thus solve the contradiction of necessary precision and quantity of computation.

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

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