摘要
Abstract
Aiming at the shortcomings of traditional guidance laws for air-to-air missiles in handling multiple non-linear constraints during the mid-course guidance,this paper proposes an optimization method for mid-course guidance trajectory using sequential convex programming(SCP),and designs an improved trust-region algorithm to enhance the convergence performance of the optimization.Firstly,taking the parabola-trajectory of air-to-air missile in the longitudi-nal plane as the research object,considering the endpoint constraints,path constraints and state constraints,after line-arizing and discretizing the original state equations and constraints,it establishes the standard convex optimization prob-lem model.On this basis,this paper analyzes the traditional trust-region algorithm and proposes an improved algo-rithm.It adopts a two-phase solution strategy:the first phase addresses the terminal constraint violation caused by the reference trajectories,while the second phase achieves rapid convergence to the optimal trajectory,to significantly im-prove the solving efficiency and convergence stability of the convex optimization problem.Through digital simulation ex-periments,the optimality and convergence of the proposed algorithm and pseudo-spectral method are compared and ana-lyzed.The results indicate that the proposed algorithm can quickly generate satisfactory mid-course guidance trajecto-ries,providing an effective solution for autonomous online guidance of air-to-air missiles under target maneuvering con-ditions.关键词
序列凸优化/端点约束/过程约束/状态量约束/轨迹优化/信赖域/中制导/空空导弹Key words
sequential convex programming/endpoint constraint/path constraint/state constraint/trajectory op-timization/trust-region/mid-course guidance/air-to-air missile分类
军事科技
