采用二阶动态规划算法的火力分配  

Firepower Allotment Based on Two-Rank Dynamic Programming Algorithm

作　　者：王弘扬[1] 王兴春[1] 

机构地区：[1]防空兵指挥学院研究生管理大队17队,河南郑州450052

出　　处：《兵工自动化》2006年第8期8-9,共2页Ordnance Industry Automation

摘　　要：采用二阶动态规划算法的火力分配,通过目标分群并计算各群目标的价值系数和单发毁伤概率,第一阶动态规划对群目标分配火力,第二阶动态规划对各群内目标分配火力,最后综合各群的分配方案,得出火力分配问题的解。其仿真证明,该方法可解决在来袭目标较多时动态规划求解火力分配计算量太大的问题,提高了计算速度。The firepower allotment adopted two-rank dynamic programming algorithm, divided cluster through target and calculated the value coefficients of each target cluster and single bullet damage probability. The first rank dynamic programming distributed firepower for the cluster target; and the second rank dynamic programming distributed firepower for each target inside cluster; at last, the allotment scheme of every cluster was integrated to achieve solving of firepower allotment questions. The simulation showed that this method could to solve dynamic power allotment calculation too big problem, and increase calculation speed.

关 键 词：火力分配 目标分群 二阶动态规划 群目标 群内目标 

分 类 号：TJ3[兵器科学与技术—火炮、自动武器与弹药工程]