TY - JOUR
T1 - Rapid Smooth Entry Trajectory Planning for High Lift/Drag Hypersonic Glide Vehicles
AU - Liu, Xinfu
AU - Shen, Zuojun
N1 - Publisher Copyright:
© 2015, Springer Science+Business Media New York.
PY - 2016/3/1
Y1 - 2016/3/1
N2 - This paper presents how to apply second-order cone programming, a subclass of convex optimization, to rapidly solve a highly nonlinear optimal control problem arisen from smooth entry trajectory planning of hypersonic glide vehicles with high lift/drag ratios. The common phugoid oscillations are eliminated by designing a smooth flight path angle profile. The nonconvexity terms of the optimal control problem, which include the nonlinear dynamics and nonconvex control constraints, are convexified via techniques of successive linearization, successive approximation, and relaxation. Lossless relaxation is also proved using optimal control theory. After discretization, the original nonconvex optimal control problem is converted into a sequence of second-order cone programming problems each of which can be solved in polynomial time using existing primal–dual interior-point algorithms whenever a feasible solution exists. Numerical examples are provided to show that rather smooth entry trajectory can be obtained in about 1 s on a desktop computer.
AB - This paper presents how to apply second-order cone programming, a subclass of convex optimization, to rapidly solve a highly nonlinear optimal control problem arisen from smooth entry trajectory planning of hypersonic glide vehicles with high lift/drag ratios. The common phugoid oscillations are eliminated by designing a smooth flight path angle profile. The nonconvexity terms of the optimal control problem, which include the nonlinear dynamics and nonconvex control constraints, are convexified via techniques of successive linearization, successive approximation, and relaxation. Lossless relaxation is also proved using optimal control theory. After discretization, the original nonconvex optimal control problem is converted into a sequence of second-order cone programming problems each of which can be solved in polynomial time using existing primal–dual interior-point algorithms whenever a feasible solution exists. Numerical examples are provided to show that rather smooth entry trajectory can be obtained in about 1 s on a desktop computer.
KW - Convexification
KW - Hypersonic glide vehicles
KW - Optimal control
KW - Phugoid oscillation
KW - Second-order cone programming
UR - http://www.scopus.com/inward/record.url?scp=84959179241&partnerID=8YFLogxK
U2 - 10.1007/s10957-015-0831-8
DO - 10.1007/s10957-015-0831-8
M3 - Article
AN - SCOPUS:84959179241
SN - 0022-3239
VL - 168
SP - 917
EP - 943
JO - Journal of Optimization Theory and Applications
JF - Journal of Optimization Theory and Applications
IS - 3
ER -