Skip to main content
Log in

Rapid Smooth Entry Trajectory Planning for High Lift/Drag Hypersonic Glide Vehicles

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Harpold, J.C., Graves, C.A.: Shuttle entry guidance. J. Astronaut. Sci. 27(3), 239–268 (1979)

    Google Scholar 

  2. Roenneke, A.J., Markl, A.: Re-entry control of a drag-vs-energy profile. J. Guid. Control Dyn. 17(5), 916–920 (1994)

    Article  Google Scholar 

  3. Lu, P.: Entry guidance and trajectory control for reusable launch vehicle. J. Guid. Control Dyn. 20(1), 143–149 (1997)

    Article  MATH  Google Scholar 

  4. Lu, P.: Entry guidance for the X-33 vehicle. J. Spacecr. Rocket. 35(3), 342–349 (1998)

    Article  Google Scholar 

  5. Mease, K.D., Chen, D.T., Teufel, P., Schoenenberger, H.: Reduced-order entry trajectory planning for acceleration guidance. J. Guid. Control Dyn. 25(2), 257–266 (2002)

    Article  Google Scholar 

  6. Saraf, A., Leavitt, A., Chen, D.T., Mease, K.D.: Design and evaluation of an acceleration guidance algorithm for entry. J. Guid. Control Dyn. 41(6), 986–996 (2004)

    Google Scholar 

  7. Leavitt, J.A., Mease, K.D.: Feasible trajectory generation for atmospheric entry guidance. J. Guid. Control Dyn. 30(2), 473–481 (2007)

    Article  Google Scholar 

  8. Shen, Z., Lu, P.: Onboard generation of three-dimensional constrained entry trajectories. J. Guid. Control Dyn. 26(1), 111–121 (2003)

    Article  MathSciNet  Google Scholar 

  9. Zimmerman, C., Dukeman, G., Hanson, J.: Automated method to compute orbital reentry trajectories with heating constraints. J. Guid. Control Dyn. 26(4), 523–529 (2003)

    Article  Google Scholar 

  10. Hanson, J.M., Jones, R.E.: Test results for entry guidance methods for space vehicles. J. Guid. Control Dyn. 27(6), 960–966 (2004)

    Article  Google Scholar 

  11. Rao, A.V., Clarke, K.A.: Performance optimization of a maneuvering re-entry vehicle using a Legendre pseudospectral method. In: AIAA Paper 2002–2231 (2002)

  12. Josselyn, S., Ross, I.M.: Rapid verification method for the trajectory optimization of reentry vehicles. J. Guid. Control Dyn. 26(3), 505–508 (2003)

    Article  Google Scholar 

  13. Bollino, K.P.: High-fidelity real-time trajectory optimization for reusable launch vehicles. Ph.D. thesis, Naval Postgraduate School (2006)

  14. Shaffer, P.J., Ross, I.M., Oppenheimer, M.W., Doman, D.B., Bollino, K.B.: Fault-tolerant optimal trajectory generation for reusable launch vehicles. J. Guid. Control Dyn. 30(6), 1794–1802 (2007)

    Article  Google Scholar 

  15. Jorris, T.R., Cobb, R.G.: Multiple method 2-D trajectory optimization satisfying waypoints and no-fly zone constraints. J. Guid. Control Dyn. 31(3), 543–553 (2008)

    Article  Google Scholar 

  16. Jorris, T.R., Cobb, R.G.: Three-dimensional trajectory optimization satisfying waypoint and no-fly zone constraints. J. Guid. Control Dyn. 32(2), 551–572 (2009)

    Article  Google Scholar 

  17. Phillips, T.H.: A common aero vehicle (CAV) model, description, and employment guide. In: Schafer Corporation for AFRL and AFSPC (2003)

  18. Vinh, N.X., Chern, J.S., Lin, C.F.: Phugoid oscillations in optimal reentry trajectories. Acta Astronaut. 8(4), 311–324 (1981)

    Article  MATH  Google Scholar 

  19. Vinh, N.X.: Optimal Trajectories in Atmospheric Flight. Elsevier, New York (1981)

    Google Scholar 

  20. Zhang, K., Chen, W.: Reentry vehicle constrained trajectory optimization. In: AIAA Paper 2011–2231 (2011)

  21. Lu, P., Forbes, S., Baldwin, M.: Gliding guidance of high L/D hypersonic vehicles. In: AIAA Paper 2013–4648 (2013)

  22. Lu, P.: Entry guidance: a unified method. J. Guid. Control Dyn. 37(3), 713–728 (2014)

    Article  Google Scholar 

  23. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)

    Book  MATH  Google Scholar 

  24. Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22(1), 1–42 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  25. Sturm, J.F.: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim. Method Softw. 17(6), 1105–1154 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  26. Andersen, E.D., Roos, C., Terlaky, T.: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Progr. 95(2), 249–277 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  27. Acikmese, B., Ploen, S.R.: Convex programming approach to powered descent guidance for mars landing. J. Guid. Control Dyn. 30(5), 1353–1366 (2007)

    Article  Google Scholar 

  28. Blackmore, L., Acikmese, B., Scharf, D.P.: Minimum landing error powered descent guidance for mars landing using convex optimization. J. Guid. Control Dyn. 33(4), 1161–1171 (2010)

    Article  Google Scholar 

  29. Acikmese, B., Blackmore, L.: Lossless convexification for a class of optimal problems with non-convex control constraints. Automatica 47(2), 341–347 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  30. Acikmese, B., Carson, J., Blackmore, L.: Lossless convexification of nonconvex control bound and pointing constraints of the soft landing optimal control problem. IEEE Trans. Control Syst. Technol. 21(6), 2104–2113 (2013)

    Article  Google Scholar 

  31. Harris, M.W., Acikmese, B.: Maximum divert for planetary landing using convex optimization. J. Optim. Theory Appl. 162(3), 975–995 (2013)

    Article  MathSciNet  Google Scholar 

  32. Lu, P., Liu, X.: Autonomous trajectory planning for rendezvous and proximity operations by conic optimization. J. Guid. Control Dyn. 36(2), 375–389 (2013)

    Article  Google Scholar 

  33. Liu, X., Lu, P.: Robust trajectory optimization for highly constrained rendezvous and proximity operations. In: AIAA Paper 2013–4720, (Aug. 2013)

  34. Liu, X.: Autonomous trajectory planning by convex optimization. Ph.D. thesis, Iowa State University (2013). http://lib.dr.iastate.edu/etd/13137

  35. Liu, X., Lu, P.: Solving nonconvex optimal control problems by convex optimization. J. Guid. Control Dyn. 37(3), 750–765 (2014)

    Article  Google Scholar 

  36. Domahidi, A., Chu, E., Boyd, S.: ECOS: an SOCP solver for embedded system. In: European Control Conference, Zurich, Switzerland (2013)

  37. Chu, E., Parikh, N., Domahidi, A., Boyd, S.: Code generation for embedded second-order cone programming. In: European Control Conference, Zurich, Switzerland (2013)

  38. Dueri, D., Zhang, J., Acikmese, B.: Automated custom code generation for embedded, real-time second order cone programming. In: IFAC World Congress (2014)

  39. Acikmese, B., Casoliva, J., Moha, S., Johnson, A.: Flight testing of trajectories computed by G-FOLD: fuel optimal large divert guidance algorithm for planetary landing. In: The 23rd AAS/AIAA Space Flight Mechanics Meeting (2013)

  40. Scharf, D.P., Regehr, M.W., Dueri, D., Acikmese, B., Vaughan, G.M., Benito, J., et al.: ADAPT: demonstrations of onboard large-divert guidance with a reusable launch vehicle. In: Submitted to IEEE Aerospace Conference (2014)

  41. Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Progr. 95(1), 3–51 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  42. Liu, X., Shen, Z., Lu, P.: Entry trajectory optimization by second-order cone programming. J. Guid. Control Dyn (2015). doi:10.2514/1.G001210

  43. Carson, J.M., Acikmese, B.: A model predictive control technique with guaranteed resolvability and required thruster silent times for small-body proximity operations. In: AIAA 2006–6780 (2006)

  44. Hartl, R., Sethi, S., Vickson, R.: A survey of the maximum principles for optimal control problems with state constraints. SIAM Rev. 37(2), 181–218 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  45. Harris, M.W., Acikmese, B.: Minimum time rendezvous of multiple spacecraft using differential drag. J. Guid. Control Dyn. 37(2), 365–373 (2014)

    Article  Google Scholar 

  46. Löfberg, J.: Yalmip: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei (2004)

Download references

Acknowledgments

The first author acknowledges the support to this research by China Postdoctoral Science Foundation under Grant No. 2014M550592. We thank the Associate Editor and two anonymous reviewers for their valuable suggestions which helped improve the overall presentation of this work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xinfu Liu.

Additional information

Communicated by Kenneth D. Mease.

Appendix: Continued Proof of Theorem 3.1

Appendix: Continued Proof of Theorem 3.1

Case 2

(\(\eta ^*>0\)): Assume that there exists a finite interval \([e_m,e_n]\subseteq [e_i,e_j]\) where \([u_1^*(e)]^2 + [u_2^*(e)]^2<1\). As discussed in Case 1, we can also obtain \(p_{\psi }=p_{\theta }=p_{\phi }=0\) by using the same method.

When \(\eta ^*=|\gamma ^*-\hat{\gamma }|>0\), it implies that one of the constraints \(\gamma ^*-\hat{\gamma }\ge -\eta ^*\) and \(\gamma ^*-\hat{\gamma }\le \eta ^*\) is inactive but the other one is active. Without loss of generality, suppose \(\gamma ^*-\hat{\gamma }\ge -\eta ^*\) is inactive and \(\gamma ^*-\hat{\gamma }\le \eta ^*\) is active. Then, we have \(\mu _2^-=0\) by Eq. (51). The condition \(\partial _{\eta }L=0\) in Eq. (53) becomes \(p_0c_{\gamma }+\mu _2^+=0\), that is

$$\begin{aligned} \mu _2^+ = -c_{\gamma }p_0 \end{aligned}$$
(80)

When \(\gamma ^*-\hat{\gamma }=\eta ^*\), an optimal control \(u_1^*\) can be found to generate the corresponding optimal flight path angle profile \(\gamma ^*\), and \(r^*\) can also be determined. The value of \(u_1^*\) could make the constraints in Eq. (37) either active or inactive. In the following, we will consider two scenarios on whether the control constraints in Eq. (37) are active or not and prove \(p_0=p_r=p_{\gamma }=\mu _1^-=\mu _1^+=\mu _2^+=\nu _1=\nu _2=0\).

  1. (1)

    Neither of the constraints \(u_1^*\ge \varsigma _l\) and \(u_1^*\le \varsigma _h\) is active. Then, we have \(\mu _1^-=\mu _1^+=0\) based on Eq. (50). The condition \(\partial _{u_1}L=0\) can be used to get the relation between \(p_{\gamma }\) and \(p_0\) as previously seen in Eq. (64), and the relation between \(\dot{p}_{\gamma }\) and \(p_0\) in Eq. (65) can also be obtained here.

For the constraints \(r^*\ge l_1\) and \(r^*\le l_2\) in Eq. (39), at most one of them is active. Let us suppose that at least the constraint \(r^*\le l_2\) is inactive without loss of generality. Then, we have \(\nu _2=0\) by using Eq. (52), while \(\nu _1\) can be either zero or a positive value. Since \(p_{\psi }=p_{\theta }=p_{\phi }=0\), \(\nu _2=0\), \(\mu _2^-=0\), and \(\mu _2^+ = -c_{\gamma }p_0\), the costate differential equations for \(p_{r}\) and \(p_{\gamma }\) in Eqs. (44) and (47) can be rewritten as

$$\begin{aligned}&\dot{p}_r=-a_{11}p_r - a_{41}p_{\gamma } - \nu _1 \end{aligned}$$
(81)
$$\begin{aligned}&\dot{p}_{\gamma } =-a_{14}p_r - a_{44}p_{\gamma } - c_{\gamma }p_0 \end{aligned}$$
(82)

The value of the Hamiltonian H is a constant, i.e.,

$$\begin{aligned} H=p_r \dot{r} + p_{\gamma }\dot{\gamma }+p_0c_{\gamma }\eta + p_0c_u u_1 = c \end{aligned}$$
(83)

where c is a constant and the superscript (\(^*\)) is suppressed again for simplicity. Taking the derivative of H results in

$$\begin{aligned} \dot{H}=\dot{p}_r\dot{r}+p_r \ddot{r}+\dot{p}_{\gamma }\dot{\gamma }+p_{\gamma }\ddot{\gamma } +p_0c_{\gamma }\dot{\eta }+p_0 c_u \dot{u}_1=0 \end{aligned}$$
(84)

Now we have five Eqs. (64)–(65), (81)–(82) and (84), which will be used to prove \(p_r=p_{\gamma }=p_0=\nu _1=0\). First, by making use of Eqs. (64)–(65) and (81)–(82), we can obtain both \(p_r\) and \(\nu _1\) as a function of \(p_0\) as follows

$$\begin{aligned} p_r=k_rp_0,\quad \nu _1=k_{\nu }p_0 \end{aligned}$$
(85)

where \(k_r=(-\dot{k}_{\gamma }-a_{44}k_{\gamma }-c_{\gamma } )/a_{14}\) and \(k_{\nu }=-\dot{k}_r-a_{11}k_r-a_{41}k_{\gamma }\) with \(\dot{k}_r:=\partial k_r/\partial e\). Then, substituting Eqs. (64)–(65) and (85) into Eq. (84) yields

$$\begin{aligned} (\dot{k}_r\dot{r} + k_r\ddot{r} + \dot{k}_{\gamma }\dot{\gamma }+k_{\gamma }\ddot{\gamma } + c_{\gamma }\dot{\eta } + c_u\dot{u}_1 )p_0 = 0 \end{aligned}$$
(86)

Similarly, the above equation implies \(p_0=0\) because its coefficient is time-varying and not a constant zero. With \(p_0=0\), we can directly get \(p_{\gamma }=p_r=\nu _1=0\) by using Eqs. (64) and (85) and get \(\mu _2^+=0\) by using Eq. (80).

  1. (2)

    Either \(u_1^*\ge \varsigma _l\) or \(u_1^*\le \varsigma _h\) is active. Without loss of generality, suppose that \(u_1^*\ge \varsigma _l\) is active. Then, we have \(\nu _1=\nu _2=0\) based on Assumption 3.3 and the condition in Eq. (52). In addition, since the constraint \(u_1^*\le \varsigma _h\) is inactive, we have \(\mu _1^+=0\) by using Eq. (50). The condition \(\partial _{u_1}L=0\) becomes

    $$\begin{aligned} \mu _1^- = -b_{41}p_{\gamma } - c_up_0 \end{aligned}$$
    (87)

    The above equation indicates that we no longer have a specific relation between \(p_{\gamma }\) and \(p_0\) as in Case 1 and the first scenario of this case. Nevertheless, we will still be able to show \(p_r=p_{\gamma }=p_0=\mu _1^-=\mu _2^+=0\) in the following by making use of several equations.

First, the costate differential equations for \(p_r\) and \(p_{\gamma }\) in Eqs. (44) and (47) become

$$\begin{aligned}&\dot{p}_r=-a_{11}p_r - a_{41}p_{\gamma } \end{aligned}$$
(88)
$$\begin{aligned}&\dot{p}_{\gamma } =-a_{14}p_r - a_{44}p_{\gamma } - c_{\gamma }p_0 \end{aligned}$$
(89)

which are obtained by using \(p_{\psi }=p_{\theta }=p_{\phi }=\mu _2^-=0\) and Eq. (80). As before, H is a constant along the optimal solution, i.e.,

$$\begin{aligned} H=p_r \dot{r} + p_{\gamma }\dot{\gamma }+p_0c_{\gamma }\eta + p_0c_u u_1 = c \end{aligned}$$
(90)

where c is a constant and the superscript (\(^*\)) is suppressed for simplicity. Taking the derivative of H results in

$$\begin{aligned} \dot{H}=\dot{p}_r\dot{r}+p_r \ddot{r}+\dot{p}_{\gamma }\dot{\gamma }+p_{\gamma }\ddot{\gamma } +p_0c_{\gamma }\dot{\eta }=0 \end{aligned}$$
(91)

where \(\dot{u}_1=\dot{\varsigma }_l=0\) is used. Next, Eq. (90) can be used to get

$$\begin{aligned} p_r=-(\dot{\gamma }/\dot{r})p_{\gamma }-[(c_{\gamma }\eta +c_u u_1)/\dot{r}]p_0+c/\dot{r} \end{aligned}$$
(92)

which, together with Eqs. (88)–(89), are then substituted into Eq. (91) to get

$$\begin{aligned} p_{\gamma }=k_{\gamma }p_0 + \alpha _{\gamma }c \end{aligned}$$
(93)

where \(k_{\gamma }=[c_{\gamma }\dot{\gamma }-c_{\gamma }\dot{\eta }-(c_{\gamma }\eta +c_u u_1)(a_{11}\dot{r}+a_{14}\dot{\gamma }-\ddot{r} )/\dot{r} ] /\beta \) and \(\alpha _{\gamma }=(a_{11}\dot{r}+a_{14}\dot{\gamma }-\ddot{r} )/(\dot{r}\beta )\) with \(\beta =(a_{11}\dot{r}+a_{14}\dot{\gamma }-\ddot{r} )\dot{\gamma }/\dot{r}-a_{41}\dot{r}-a_{44}\dot{\gamma }+\ddot{\gamma }\). When the above equation is substituted into Eq. (92), we have

$$\begin{aligned} p_r=k_rp_0 + \alpha _r c \end{aligned}$$
(94)

where \(k_r=-(\dot{\gamma }/\dot{r})k_{\gamma }-(c_{\gamma }\eta +c_u u_1)/\dot{r}\) and \(\alpha _r=-(\dot{\gamma }/\dot{r})\alpha _{\gamma }+1/\dot{r}\). Now we have got both \(p_r\) and \(p_{\gamma }\) as a function of \(p_0\) and c as given in Eqs. (93)–(94). Next, they are substituted into Eq. (88) to get a relation between \(p_0\) and c as follows

$$\begin{aligned} (\dot{k}_r + a_{11}k_r + a_{41}k_{\gamma } )p_0 = (-\dot{\alpha }_r - a_{11}\alpha _r - a_{41}\alpha _{\gamma } )c \end{aligned}$$
(95)

In the above equation, \(p_0\) has a varying coefficient. When it is not zero, the above equation can be rewritten as

$$\begin{aligned} p_0 = k_p c \end{aligned}$$
(96)

where \(k_p=(-\dot{\alpha }_r - a_{11}\alpha _r - a_{41}\alpha _{\gamma } )/(\dot{k}_r + a_{11}k_r + a_{41}k_{\gamma } )\). Note that the value of \(k_p\) is also time-varying. If c is a nonzero constant, \(k_p c\) must not be a constant, which will violate Eq. (96) since \(p_0\) is a constant. Therefore, c must be zero, and as a result \(p_0=0\). When \(p_0=c=0\), it becomes straightforward to obtain \(p_r=p_{\gamma }=0\) by using Eqs. (93) and (94) and \(\mu _2^+=0\) by using Eq. (80). Substituting \(p_{\gamma }=p_0=0\) into Eq. (87), we have \(\mu _1^-=0\).

In this case, first we have proven \(p_{\psi }=p_{\theta }=p_{\phi }=\mu _2^-=0\) and then have proven \(p_r=p_{\gamma }=p_0=\mu _1^-=\mu _1^+=\mu _2^+=\nu _1=\nu _2=0\) in the above two scenarios, which obviously violate the condition in Eq. (41). \(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, X., Shen, Z. Rapid Smooth Entry Trajectory Planning for High Lift/Drag Hypersonic Glide Vehicles. J Optim Theory Appl 168, 917–943 (2016). https://doi.org/10.1007/s10957-015-0831-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-015-0831-8

Keywords

Navigation