Optimal Maneuver Trajectory for Hypersonic Missiles in Dive Phase Using Inverted Flight

Tan, Shili; Lei, Humin; Liu, Tao

doi:10.1109/access.2019.2916464

Cited by 7 publications

(4 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the proposed method is sub-optimal. Notice that U in (3) includes the control history and the time step length, and thus, a trajectory can be generated by propagating the system dynamics in (1). Though the number of time steps is fixed in the paper, the total control vector can be easily mapped to a different number of time steps using e.g., linear interpolation.…”

Section: Trajectory Generation For Transition Maneuversmentioning

confidence: 99%

“…Straight lines, constant slopes, and arcs are commonly seen components of a flight trajectory, representing different kinds of steady flight conditions. Between those segments are transition phases, where an appropriate smooth design is crucial for accurate trajectory following [1]- [3]. This paper addresses the sub-optimal, constrained, efficient, and smooth trajectory generation problem for these transition maneuvers.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Smooth Sub-Optimal Trajectory Generation for Transition Maneuvers

et al. 2020

View full text Add to dashboard Cite

In this paper, a sub-optimal trajectory optimization method is developed to generate trajectories for transition phases connecting two steady flights. Both control histories as well as the time step length that specify the trajectory for a transition maneuver are calculated as a root of an underdetermined system. Here, the unknowns are computed by a series of Newton iterations for finding the root, where explicit closed-form expressions are utilized within the algorithm to ensure computational efficiency. Moreover, a line-search strategy is incorporated to enhance the robustness. The terminal hard output constraints are guaranteed by the root finding, and the terminal control constraints are realized by using a time-varying weighting matrix in the cost function. Numerical simulations investigate multiple scenarios of transition phases, which show the effectiveness of the proposed method.

show abstract

Section: Trajectory Generation For Transition Maneuversmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Smooth Sub-Optimal Trajectory Generation for Transition Maneuvers

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Liang et al [21] introduced the concept of maneuver coefficient and designed a three-dimensional trajectory planning method for decoupling the longitudinal and lateral planes by using the maneuver coefficient to describe the strength of lateral maneuver. For the longitudinal maneuver strategy, Tan et al [22] used the adaptive pseudospectral method to obtain the optimal dive trajectory considering the path constraints. An et al [23] applied predictive correction guidance methods to longitudinal trajectory design and obtained the gliding phase ballistic trajectory form through offline calculations.…”

Section: Introductionmentioning

confidence: 99%

Multiple Leap Maneuver Trajectory Design and Tracking Method Based on Prescribed Performance Control during the Gliding Phase of Vehicles

Zhang,

Shen

et al. 2024

International Journal of Aerospace Engineering

View full text Add to dashboard Cite

A novel standard trajectory design and tracking guidance used in the multiple active leap maneuver mode for hypersonic glide vehicles (HGVs) is proposed in this paper. First, the dynamic equation and multiconstraint model are first established in the flight path coordinate system. Second, the reference drag acceleration-normalized energy (D-e) profile of the multiple active leap maneuver mode is quickly determined by the Newton iterative algorithm with a single design parameter. The range to go error is corrected by the drag acceleration profile update algorithm, and the drag acceleration error of the gliding terminal is corrected by the aerodynamic parameter estimation algorithm. Then, the reference drag acceleration tracking guidance law is designed based on the prescribed performance control method. Finally, the CAV-L vehicle model is used for numerical simulation. The results show that the proposed method can satisfy the design requirements of drag acceleration under multiple active leap maneuver modes, and the reference drag acceleration can be tracked precisely. The adaptability and robustness of the proposed method are verified by the Monte Carlo simulations under various combined deviation conditions.

show abstract

“…Pseudospectral methods is widely used in the numerical solution of nonlinear optimal control problem [1], whose examples range from missiles' dive phase trajectory maneuver [2], control of wave energy converters [3], trajectory optimization of boost-glide vehicle [4], trajectory design for lunar landing [5], etc. One of the key points for the wide application of pseudospectral method is the spectral accuracy of exponential convergence in differential approximation theory [6].…”

Section: Introductionmentioning

confidence: 99%

A pk-Adaptive Mesh Refinement for Pseudospectral Method to Solve Optimal Control Problem

Huang

Liu

et al. 2019

IEEE Access

View full text Add to dashboard Cite

In this paper, a pk-adaptive mesh refinement of pseudospectral method is proposed for solving optimal control problem by using collocation at Legendre-Gauss-Lobatto (LGL) points, motivated by reducing the redundant collocation points in the state-of-art mesh refinement methods to improve the time efficiency. The proposed method involves three phases, i.e., the determination of the polynomial degree, the determination of increasing intervals or nodes, and the optimization of the locations of segment breaks in each interval. First, determines the polynomial degree by the error estimation between the dynamics and the differentiation approximation of state variables according to the spectral matrix. Second, the maximum allowed polynomial degree in an interval is used to decide whether to segment interval or not. Third, the locations of segment points are obtained as the optimal design parameters of optimal control method. The terminology ''pk-adaptive'' or ''p-then-k adaptive'' is used because the polynomial degree is preferentially adaptive variation, then increases the segments by adding the optimal knots in each mesh interval. Finally, the residual of solutions, number of segments, number of nodes, CPU time, convergence of iteration, and parameters of the method have been analyzed in the comparing test to discuss the advantages of pk-adaptive mesh refinement. The discussions performed in two examples and demonstrated that the pk-adaptive method has the ability of optimizing nodes distribution to keep fewer nodes requirement and higher time efficiency than the hp-or ph-based pseudospectral methods while achieving the equivalent accuracy. INDEX TERMS Optimal control, mesh refinement, pseudospectral, collocation methods, optimal knotting.

show abstract

Optimal Maneuver Trajectory for Hypersonic Missiles in Dive Phase Using Inverted Flight

Cited by 7 publications

References 37 publications

Smooth Sub-Optimal Trajectory Generation for Transition Maneuvers

Smooth Sub-Optimal Trajectory Generation for Transition Maneuvers

Multiple Leap Maneuver Trajectory Design and Tracking Method Based on Prescribed Performance Control during the Gliding Phase of Vehicles

A pk-Adaptive Mesh Refinement for Pseudospectral Method to Solve Optimal Control Problem

Contact Info

Product

Resources

About