Publications
Sort:
Open Access Issue
Max-Max type entry trajectory optimization for testing vehicle by successive difference-of-convex programming
Journal of National University of Defense Technology 2026, 48(1): 183-195
Published: 01 February 2026
Abstract PDF (3.2 MB) Collect
Downloads:2
Objective

Employing the DC (difference-of-convex) programming method, a study is conducted on the extreme performance of the testing entry vehicle in terms of peak heat flux.

Methods

Successive DC programming method; big-M method; mixed-integer nonlinear programming

Results

Numerical examples show that the DC relaxation based model has higher approximation accuracy for Max-Max type entry trajectory optimization problems than the linearization based model, and performs better in numerical stability, convergence characteristics, and optimality. It is suitable for high-precision entry heat trajectory planning tasks and can provide reference for vehicle heat testing. Due to the addition of more linear and nonlinear constraints to DC relaxation based model, the speed of solving DC relaxation based model is significantly slower than solving the linearization based model.

Conclusions

To evaluate the force and heat performance of entry vehicles and provide testing references for material, aerodynamic, and structural design departments, this paper uses the successive DC programming method to study a Max-Max type entry trajectory optimization problems. The main contribution of this article lies in: (1) Combining DC decomposition and penalty function method to derive a Max-Max type cost function DC relaxation model with higher approximation accuracy than the linearized model, which solves the problem of cost function oscillation or non-convergence during the iteration process of the linearized model; (2) The Max-Max type trajectory optimization problem is transformed into a solvable mixed integer programming subproblem employing the Big-M method, and an improved successive DC programming method based on the DC relaxation model is proposed. Taking the optimization problem of peak heat flux entry trajectory as the research object, numerical experiments show that the maximum peak heat flux trajectory optimization method based on DC relaxation model is 0.5781% higher in optimality than the linearization model method, and the terminal latitude and longitude accuracy is 2 orders of magnitude higher. The proposed method has high stability, convergence, and optimality.

Open Access Issue
Peak-heat-flux entry test trajectory optimization by disjunctive programming
Chinese Journal of Aeronautics 2025, 38(11)
Published: 27 June 2025
Abstract Collect

To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase, entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex constraints are essential. A significant obstacle is the uncertainty of passage time or energy states of the maximum peak entry heat flux point and waypoints. This paper showcases an endeavour to leverage disjunctive programming and combinatorial theory for the max-max type (maximum peak-heat-flux) Entry Trajectory Optimization (ETO) problems with complex constraints such as dynamic pressure, normal load, waypoints, and no-fly zones. The concept of a “generalized waypoint” is introduced, and the maximum peak-heat-flux point is regarded as a “generalized waypoint”. Through the application of propositional calculus rules, the derivation of generalized waypoints incorporating various physical quantities and magnitudes such as heat flux density, longitude, and latitude is actualized in one disjunctive normal form, enabling resolution via a unified method. Consequently, a novel method based on combinatorial prior rules is proposed, utilizing Successive Mixed-Integer Nonlinear Programming (SMINLP) to optimize various heat entry test flight trajectories. Numerical experiments are provided to show the computational accuracy, stability, and adaptability of the proposed method in solving max-max type entry optimal control problems.

Total 2