Ascent trajectory tracking in the longitudinal plane is a class of nonaffine noncascade nonlinear system control problems with single input and multiple output, which is difficult to control by nonlinear method directly. Adaptive dynamic programming algorithm has the advantages of precise control and adaptability for general nonlinear control problem, and the time-varying quadratic adaptive dynamic programming algorithm proposed in this paper promotes the convergence and calculation speed of the traditional adaptive dynamic programming algorithm. To implement the algorithm effectively, the independent variables of ascent model are substituted in the launching coordinate, and then the model is treated as a discrete nominal trajectory tracking problem. Besides, the heuristic dynamic programming structure is used to train the processed model, and thus only the time-varying weight in the designed evaluation network needs to be updated. Simulation shows that the proposed algorithm can update the control variable online after predicting the cost function offline with the dynamic equations, which is faster than the general adaptive dynamic programming algorithm. In addition, the proposed algorithm can effectively and accurately track the nominal trajectory under the uncertainty of parameters compared with the linear quadratic regulators algorithm.
Ascent trajectory tracking method using time-varying quadratic adaptive dynamic programming
2019-09-01
12 pages
Article (Journal)
Electronic Resource
English
Ascent trajectory dispersion analysis
NTRS | 1982
Ascent Trajectory Optimization Using Genetic Algorithm
AIAA | 2009
|Adaptive Dynamic Programming for Model-free Tracking of Trajectories with Time-varying Parameters
BASE | 2020
|Optimizing RLV ascent trajectory using PSO algorithms
IEEE | 2008
|