| Issue |
Volume 10, 2018
Progress in Flight Dynamics, Guidance, Navigation, and Control – Volume 10
|
|
|---|---|---|
| Page(s) | 159 - 176 | |
| DOI | https://doi.org/10.1051/eucass/201810159 | |
| Published online | 08 June 2018 | |
Optimization of the launcher ascent trajectory leading to the global optimum without any initialization: the breakthrough of the Hamilton–Jacobi–Bellman approach
1
CNES Launcher Directorate, DLA/SDT/SPC Paris 75012, France
2
Laboratoire J.-L. Lions, Université Pierre et Marie Curie Paris Cedex 75252, France
3
UFR de Mathématiques, Site Chevaleret, Université Paris-Diderot, Paris Cedex 75205, France
4
Unité des Mathématiques Appliquées (UMA), Ensta ParisTech, 828 Bd des Maréchaux, Palaiseau Cedex 91762, France
The resolution of the launcher ascent trajectory problem by the so-called Hamilton–Jacobi–Bellman (HJB) approach, relying on the Dynamic Programming Principle, has been investigated. The method gives a global optimum and does not need any initialization procedure. Despite these advantages, this approach is seldom used because of the dicculties of computing the solution of the HJB equation for high dimension problems. The present study shows that an eccient resolution is found. An illustration of the method is proposed on a heavy class launcher, for a typical GEO (Geostationary Earth Orbit) mission. This study has been performed in the frame of the Centre National d’Etudes Spatiales (CNES) Launchers Research & Technology Program.
© The Authors, published by EDP Sciences
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (http://creativecommons.org/licenses/by/4.0/).