A Hypersonic Vehicle Trajectory Planning Method Based on an Improved Conservative Convex Separable Approximation
Aiming at the requirements of online trajectory planning of hypersonic vehicles,an improved conserved convex separable approximations programming method is proposed to solve the nonconvergence issue called solution chattering of the current sequence convex optimization.Firstly,based on the methods of sequence convexity,relaxation variables,penalty functions and others,the non-convex original problem of hypersonic vehicle trajectory planning is transformed into a convex subproblem.Secondly,aiming at the problem of oscillation non-convergence in convex optimization,a trust region update strategy is proposed to make the iterative sequence tend to converge,and it is verified that the strategy can effectively avoid the"crawling phenomenon"in the middle and late stages of iteration.Furthermore,with the improved trust domain update strategy,a trajectory planning method based on improved conservative convex separable approximation is proposed,and the equivalence and convergence analysis of the algorithm are carried out to prove that the algorithm can converge to a station point of the original problem.Finally,taking the hypersonic vehicle trajectory planning problem under complex constraints as an example,the simulation verification is carried out by two working conditions:random initial guess value and random endpoint,one of them is compared with the planning results of the sequential quadratic programming method,the results show that the proposed algorithm has fast solution speed,good convergence and robustness under the condition of satisfying the requirements of solution accuracy.
Online trajectory planningSequential convex programmingConservative convex separable approximationsTrust region
NETL
NSTL
万方数据
