Hamilton-Jacobi-Bellman approach for the climbing problem for heavy launchers

Abstract : In this paper we investigate the Hamilton-Jacobi-Bellman (HJB) approach for solving a complex real-world optimal control problem in high dimension. We consider the climbing problem for the European launcher Ariane V: The launcher has to reach the Geostationary Transfer Orbit with minimal propellant consumption under state/control constraints. In order to circumvent the well-known curse of dimensionality, we reduce the number of variables in the model exploiting the specific features concerning the dynamics of the mass. This generates a non-standard optimal control problem formulation. We show that the joint employment of the most advanced mathematical techniques for the numerical solution of HJB equations allows one to achieve practicable results in reasonable time.
Type de document :
Communication dans un congrès
20th International Symposium on Mathematical Theory of Networks and Systems, Jul 2012, Melbourne, Australia. 2012, 〈http://www.mtns2012.conference.net.au/Full%20Paper/MTNS2012_0204_paper.pdf〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00724842
Contributeur : Estelle Bouzat <>
Soumis le : mercredi 22 août 2012 - 18:14:28
Dernière modification le : vendredi 16 novembre 2018 - 01:54:57

Identifiants

  • HAL Id : hal-00724842, version 1

Citation

Olivier Bokanowski, Emiliano Cristiani, Julien Laurent-Varin, Hasnaa Zidani. Hamilton-Jacobi-Bellman approach for the climbing problem for heavy launchers. 20th International Symposium on Mathematical Theory of Networks and Systems, Jul 2012, Melbourne, Australia. 2012, 〈http://www.mtns2012.conference.net.au/Full%20Paper/MTNS2012_0204_paper.pdf〉. 〈hal-00724842〉

Partager

Métriques

Consultations de la notice

461