采用打靶法研究固体运载火箭弹道优化设计问题。针对打靶法中智能优化算法效率、优化问题中约束条件提法等方面的不足,引入序列近似优化算法,提出算法中径向基函数高斯核宽度的高效确定方法。数值仿真实验表明,提出的方法可在基本不带来计算量增加的前提下,显著提高代理模型精度,使序列近似优化算法得到改进,提高优化效率。设计固体运载火箭飞行程序。建立弹道优化设计问题数学模型,并将模型中相关等式约束合理转化为不等式约束,降低优化问题求解难度;基于改进后的序列近似优化算法完成某固体运载火箭弹道优化,原始计算模型调用308次之后便搜索到最优解,较传统智能优化算法显著提高了优化效率,优化方案末助推级液体推进剂消耗比原方案减少25.7%。 Research on the Optimization Design of Trajectory of Solid Launch Vehicle Using Shooting Method. Aimed at the shortcomings of the efficiency of intelligent optimization algorithm and the formulation of constraints in the optimization problem, a series of approximate optimization algorithms are introduced and an efficient method for determining the Gaussian kernel width of the radial basis function in the algorithm is proposed. The numerical simulation results show that the proposed method can significantly improve the accuracy of the proxy model without any increase of computational complexity, improve the sequence approximation algorithm and improve the optimization efficiency. Design solid rocket flight program. The mathematic model of the ballistic optimization design problem is established, and the constraints of the related equations in the model are transformed into the inequality constraints to reduce the difficulty of solving the optimization problem. Based on the improved sequence approximation algorithm, the trajectory optimization of a solid carrier rocket is completed. The original model is called 308 times After that, the optimal solution was searched. Compared with the traditional intelligent optimization algorithm, the optimization efficiency was significantly improved. The consumption of liquid propellants at the end of the optimization scheme was reduced by 25.7% compared with the original scheme.