Fast Trajectory Optimization of Reentry Gliding Vehicle
Jianjun Luo
Abstract
Jianjun Luo
Abstract
In order to generate the optimal solutions of trajectories for reentry gliding vehicle in real time,this paper presents a kind of fast trajectory optimization method.When disposing the model,according to the characteristics of reentry vehicle,the reentry motion equations are simplified based on some reasonable assumptions and the equations are transformed into non-dimensional form,to make it more suitable to be solved by the numerical optimal algorithms.Then the methods of multipliers are used to deal with terminal constraints and the Conjugate-Gradient method is adopted to solve the optimal trajectory control problem.The simulation results demonstrate that an optimal reentry trajectory which satisfies the constraint conditions can be generated in 10 seconds and verifies the validity,robustness and feasibility of the algorithm.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to generate the optimal solutions of trajectories for reentry gliding vehicle in real time,this paper presents a kind of fast trajectory optimization method.When disposing the model,according to the characteristics of reentry vehicle,the reentry motion equations are simplified based on some reasonable assumptions and the equations are transformed into non-dimensional form,to make it more suitable to be solved by the numerical optimal algorithms.Then the methods of multipliers are used to deal with terminal constraints and the Conjugate-Gradient method is adopted to solve the optimal trajectory control problem.The simulation results demonstrate that an optimal reentry trajectory which satisfies the constraint conditions can be generated in 10 seconds and verifies the validity,robustness and feasibility of the algorithm.
Key concepts: Reentry, Trajectory optimization, Trajectory, Robustness (evolution), Control theory (sociology), Optimal control, Conjugate gradient method, Computer science