IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v168y2016i3d10.1007_s10957-015-0831-8.html
   My bibliography  Save this article

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

Author

Listed:
  • Xinfu Liu

    (Beihang University)

  • Zuojun Shen

    (Beihang University)

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.

Suggested Citation

  • Xinfu Liu & Zuojun Shen, 2016. "Rapid Smooth Entry Trajectory Planning for High Lift/Drag Hypersonic Glide Vehicles," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 917-943, March.
    • Handle: RePEc:spr:joptap:v:168:y:2016:i:3:d:10.1007_s10957-015-0831-8
    DOI: 10.1007/s10957-015-0831-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0831-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-015-0831-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.
    2. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Discussion Paper 2002-73, Tilburg University, Center for Economic Research.
    3. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Other publications TiSEM b25faf5d-0142-4e14-b598-a, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zohrizadeh, Fariba & Josz, Cedric & Jin, Ming & Madani, Ramtin & Lavaei, Javad & Sojoudi, Somayeh, 2020. "A survey on conic relaxations of optimal power flow problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 391-409.
    2. Stinstra, Erwin & den Hertog, Dick, 2008. "Robust optimization using computer experiments," European Journal of Operational Research, Elsevier, vol. 191(3), pages 816-837, December.
    3. Stinstra, E., 2006. "The meta-model approach for simulation-based design optimization," Other publications TiSEM 713f828a-4716-4a19-af00-e, Tilburg University, School of Economics and Management.
    4. Anand, C. & Sotirov, R. & Terlaky, T. & Zheng, Z., 2007. "Magnetic resonance tissue density estimation using optimal SSFP pulse-sequence design," Other publications TiSEM 371b5075-1085-4bf5-bd55-4, Tilburg University, School of Economics and Management.
    5. Stinstra, E. & den Hertog, D., 2005. "Robust Optimization Using Computer Experiments," Other publications TiSEM 69d6e378-c9f9-44e8-9602-f, Tilburg University, School of Economics and Management.
    6. Appino, Riccardo Remo & González Ordiano, Jorge Ángel & Mikut, Ralf & Faulwasser, Timm & Hagenmeyer, Veit, 2018. "On the use of probabilistic forecasts in scheduling of renewable energy sources coupled to storages," Applied Energy, Elsevier, vol. 210(C), pages 1207-1218.
    7. Zhao, Shuaidong & Zhang, Kuilin, 2020. "A distributionally robust stochastic optimization-based model predictive control with distributionally robust chance constraints for cooperative adaptive cruise control under uncertain traffic conditi," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 144-178.
    8. Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
    9. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Other publications TiSEM 949fb20a-a2c6-4d87-85ea-8, Tilburg University, School of Economics and Management.
    10. Robert Chares & François Glineur, 2008. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 383-405, December.
    11. B.V. Halldórsson & R.H. Tütüncü, 2003. "An Interior-Point Method for a Class of Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 559-590, March.
    12. G. Q. Wang & Y. Q. Bai, 2012. "A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 966-985, September.
    13. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.
    14. E. A. Yıldırım, 2003. "An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 649-676, November.
    15. Vasile L. Basescu & John E. Mitchell, 2008. "An Analytic Center Cutting Plane Approach for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 529-551, August.
    16. G. Q. Wang & Y. Q. Bai & X. Y. Gao & D. Z. Wang, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Interior-Point Methods for Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 242-262, April.
    17. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.
    18. Mehdi Karimi & Levent Tunçel, 2020. "Primal–Dual Interior-Point Methods for Domain-Driven Formulations," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 591-621, May.
    19. Changhe Liu & Hongwei Liu, 2012. "A new second-order corrector interior-point algorithm for semidefinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(2), pages 165-183, April.
    20. Behrouz Kheirfam, 2015. "A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 246-260, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:168:y:2016:i:3:d:10.1007_s10957-015-0831-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.