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 wil1 provide a theoretical basis with relatively credible level for the scheme proof.
参考文献
相似文献
引证文献
引用本文
刘冀湘,甘楚雄.寻求探空火箭最佳推力策略的一种直接优化方法[J].国防科技大学学报,1989,11(3):26-31. Liu Jixiang, Gan Chuxiong. A Direct Method to Search out the Best Thrust Plan for Sounding Rocket[J]. Journal of National University of Defense Technology,1989,11(3):26-31.