基于序列凸规划的拦截弹中制导轨迹优化  

Midcourse Guidance Trajectory Optimization of InterceptorMissile Based on Sequential Convex Programming

作　　者：李炯[1] 张锦林 邵雷[1] 李万礼 贺杨超 Li Jiong;Zhang Jinlin;Shao Lei;Li Wanli;He Yangchao(Air and Missile Defense College,Air Force Engineering University,Xi’an 710051,China)

机构地区：[1]空军工程大学防空反导学院,西安710051

出　　处：《航空兵器》2023年第1期37-43,共7页Aero Weaponry

基　　金：国家自然科学基金项目(62173339,61873278,61773398)。

摘　　要：针对强非线性多约束条件下拦截弹中制导轨迹优化问题,基于序列凸规划方法和捕获区域,提出一种针对固定时间约束下的轨迹优化算法。序列凸优化方法求解复杂多项式具有高效的计算效率,但在轨迹优化问题中应用序列凸规划有控制变量的强非线性和固定时间内终端约束难以收敛两大难点。首先,采用仿射变量将问题转化为仿射系统,并将仿射系统进行凸化与离散化,来解决非线性问题,然后,提出一种终端约束加权松弛化方法来解决固定时间内终端约束难以收敛问题,并将中制导问题转化为序列凸规划问题。仿真结果表明,所提算法能较快地生成符合多约束条件的拦截弹中制导轨迹。Aiming at the trajectory optimization problem of interceptor midcourse guidance under strong nonlinear multi-constraint conditions,a trajectory optimization algorithm for fixed time constraints is proposed based on sequential convex programming method and capture region.Sequential convex optimization method has high computational efficiency for solving complex polynomials.However,in trajectory optimization problems,the strong nonlinearity of control variables and the convergence difficulty of fixed time terminal constraints are two main difficulties.Firstly,the problem is transformed into an affine system by using affine variables,and the affine system is convexized and discretized to solve the nonlinearity.Then,aiming at the problem that terminal constraints are difficult to converge in a fixed time,a weighted relaxation method of terminal constraints is proposed to transform the midcourse guidance problem into a sequence convex programming problem.The simulation results show that the proposed algorithm can quickly generate the midcourse guidance trajectory of interceptor that meets multiple constraints.

关 键 词：序列凸规划 中制导 轨迹优化 捕获区域 多约束 高超声速 拦截弹 

分 类 号：TJ765[兵器科学与技术—武器系统与运用工程]