寻求探空火箭最佳推力策略的一种直接优化方法

A Direct Method to Search out the Best Thrust Plan for Sounding Rocket

本文运用贝尔曼动态规划方法寻求探空火箭最佳推力策略,建立了解本文问题的“局部最优性”递推方程,采用区域性限制系数和非节点处的“单点插值”方案,大幅度提高了运算速度和精度,计算过程更趋稳定,使给定起飞质量的探空火箭在寻优计算中获得较之于间接方法更大的目标效益。同时,在微机IBMPC/XT上编制了计算程序,为探空火箭初步设计和方案论证提供了具有较高置信水平的理论依据。

In this paper, a direct optimal method-the method of Bellman dynamic programming has been used to search out the best thrust plan in a optimization process for sounding rocket. The recurrence formula of local optimization is set up in it, In the paper, because of using the coefficients to restrict the seeking range in each Bellman stage and the scheme of single spot insertion, the calculation speed and accuracy has been increased greatly and the inserted calculations of non-intersection parameters points have become more stable and relatively credible level can be available. Moreover, the calculation has been programed in a microcomputer IBM PC/XT. The program can be used directly for rough design of rocket. It will provide a theoretical basis with relatively credible level for the scheme proof.