A Trajectory Generation Algorithm for a Re-Entry Gliding Vehicle Based on Convex Optimization in the Flight Range Domain and Distributed Grid Points Adjustment

Abstract

Optimal trajectory generation for the guidance of re-entry glide vehicles is of great significance. To realize a faster generation speed and consistency with the guidance mechanism, an improved convex optimization trajectory generation algorithm based on the flight range domain for the re-entry glide vehicles is proposed in this paper. Firstly, according to the definition of the range-to-go, the projected range-to-go of the re-entry glide vehicle is presented when the dynamic model is converted to the flight range domain. Then, the attack angle and bank angle are expanded to the state variables and the change rate, which is designed as a new control variable. When the dynamic models and constraints are convexificated and discretized, the vehicle trajectory discrete convex model in the flight range domain is proposed. In order to further improve the generation speed and accuracy, an initial trajectory generation method that is close to the guidance requirements is proposed by the landing points of different control laws. In addition, by analyzing the nonlinear illegal degree of grid points, the probability density of grid points and the adjustment strategy of grid points are proposed. Finally, the ablation experiment shows that the initial trajectory generation and distributed grid points method works. With different target points, different no-fly zones, different initial states, and the Monte Carlo experiment, our method can effectively and robustly complete the generation. The lateral and longitudinal generation error is less than 1 km. And compared with the Gaussian pseudo-spectral method, our method obtained comparable accuracy and faster speed.

Keywords

• trajectory generation for re-entry glide vehicle
• sequence convex optimization
• dynamic model in the fight range domain
• distributed grid points adjustment