Review of Research Methods for Hypersonic Vehicle Reentry Trajectory Planning
DOI:
https://doi.org/10.54097/fcis.v2i1.3343Keywords:
Hypersonic flight vehicle, Reentry trajectory planning, Reinforcement Learning, Imitation learningAbstract
Hypersonic vehicle has many advantages, such as wide range of maneuver, strong penetration ability, high strike accuracy, and so on. Reentry trajectory planning is one of the key technologies to support hypersonic vehicle systems. It is necessary to plan feasible or optimal trajectory under the process constraints such as heat flux, dynamic pressure, overload, and terminal constraints such as altitude and velocity. At present, traditional methods are difficult to meet the task requirements of trajectory planning and online trajectory generation under complex conditions with multiple constraints. As an artificial intelligence method, reinforcement learning has strong robustness and the characteristics of "offline training and online deployment", which can make up for the shortcomings of traditional methods and show great potential in trajectory planning. This paper introduces the current research status of traditional trajectory planning methods and reinforcement learning methods, and proposes that the reentry trajectory planning methods will be intelligent in the future.
Downloads
References
R He , “Study of all-course trajectory planning approach for hypersonic boost-glide vehicles,” National University of Defense Technology, Changsha, Hunan, China.
Z Shen, P Lu, “On-board entry trajectory planning for sub-orbital flight,” Acta Astronautica, 2005, 56(6): 573-591.
Mease K D, D Chen, Schonenberger H, “Reduced-order entry trajectory planning for acceleration guidance,” Journal of Guidance, Control, and Dynamics, 2002,25(2):257-266.
Leavitt J, Saraf A, Chen D, “Performance of evolved acceleration guidance logic for entry,” Proceedings of AIAA Guidance, Navigation, and Control Conference and Exhibit, AIAA-2002-4456,2002.
Y Zhang, “Research on entry trajectory generation for hypersonic glide vehicles based on three-dimensional profile,” National University of Defense Technology, Changsha, Hunan, China.
C Xie, Y Zhang, M Gao, “Automatic control principle,” Nanjing Southeast University Press,201812.268.
Hull, David G, “Conversion of Optimal Control Problems into Parameter Optimization Problems,” Journal of guidance, control, and dynamics, 1997, 20(1): 57-60.
Fahroo F, Ross I M, “Direct Trajectory Optimization by a Chebyshev Pseudospectral Method,” American Control Conference 2000.
Vinh N X, Lu P, “Chebyshev minimax problems for skip trajectories,” Journal of the astronautical sciences, 1988.
Barron R L, Chick C M, “Improved Indirect Method for Air-Vehicle Trajectory Optimization,” Journal of Guidance Control & Dynamics, 2006, 29(3): 643-652.
Hull, David G, “Conversion of Optimal Control Problems into Parameter Optimization Problems,” Journal of guidance, control, and dynamics, 1997, 20(1): 57-60.
Betts J T, Frank P D, “A sparse nonlinear optimization algorithm,” Journal of Optimization Theory & Applications, 1994, 82(3): 519-541.
Fisch F, Sewerin F, Holzapfel F, “Approach Trajectory Optimization including a Tunnel Track Constraint,” Aiaa Atmospheric Flight Mechanics Conference, 2011.
Hargraves C R, Paris S W, “ Direct trajectory optimization using nonlinear programming and collocation,” Journal of guidance, control, and dynamics, 1986, 10(4): 338-342.
Elnagar G, Kazemi M A, Razzaghi M, “The pseudospectral Legendre method for discretizing optimal control problems,” IEEE Transactions on Automatic Control, 2002, 40(10): 1793-1796.
Fahroo F, Ross I M, “Direct Trajectory Optimization by a Chebyshev Pseudospectral Method,” American Control Conference, 2000.
Fahroo F, Doman D, “ A Direct Method for Approach and Landing Trajectory Reshaping with Failure Effect Estimation,” AIAA Guidance, Navigation, and Control Conference and Exhibit, 2004.
Corrigendum, “GPOPS, a MATLAB software for solving multiple phase optimal control problems using the gauss pseudospectral method,” Acm Transactions on Mathematical Software, 2011, 38(2): 1-2.
Benson D A, Huntington G T, Thorvaldsen T P, “ Direct Trajectory Optimization and Costate Estimation via an Orthogonal Collocation Method,” Journal of Guidance Control & Dynamics, 2006, 29(6): 1435-1439.
Gill P E, Murray W, Saunders M A, “SNOPT: An SQP algorithm for large-scale constrained optimization,” SIAM review, 2005, 47(1): 99-131.
Gill P E, Murray W, Saunders M A, “NPSOL (Version 4.0): A Fortran Package for Nonlinear Programming,” User's Guide, 1986.
G Tang, Y Luo, E Yong, “Theory, method and application of spacecraft trajectory optimization”, Science Press, 2012.
Hong D, Kim M, Park S, “ Study on Reinforcement Learning-Based Missile Guidance Law,” Applied Sciences, 2020, 10(18): 6567.
J Wang, R Su, L Liu, “Cooperative Interception Guiding Law Based on Reinforcement Learning of Q-learning,” Navigation Positioning & Timing, 2022, 9(05):84-90.
Hovell K, Ulrich S. Deep reinforcement learning for spacecraft proximity operations guidance[J]. Journal of spacecraft and rockets, 2021, 58(2): 254-264.
Z Ren, D Zhang, S Tang, “Improved three-dimensional A* algorithm of real-time path planning based on reinforcement learning”, Systems Engineering and Electronics, 1-11.
Y Lv, “Research on Q-Learning Path Planning Method for Hypersonic Vehicles,” University of Electronic Science and Technology of China, Chengdu, Sichuan, China.
J Zhu, C Zhao, X Li , ” Multi constraint optimal intelligent gliding guidance via reinforcement learning”, Journal of National University of Defense Technology, 2022,44(04):116-124.
T Wu, H Wang, Y Liu, “A Reentry Guidance Algorithm Based on Deep Reinforcement Learning and Altitude Rate Feedback”, Unmanned Systems Technology, 2022,5(04):1-13.
J Song, Y Luo, M Zhao, “Fault-Tolerant Integrated Guidance and Control Design for Hypersonic Vehicle Based on PPO,” Mathematics, 2022, 10(18): 3401.
J Hui, R Wang, Q Yu, “Research of generating new quality flight corridor for reentry aircraft based on reinforcement learning,” Acta Aeronautica et Astronautica Sinica, 2022,43(09):623-635.
