Hamilton-Jacobi-Bellman approach for the climbing problem for heavy launchers - Centre de mathématiques appliquées (CMAP) Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-00724842 , version 1 (22-08-2012)

Identifiants

  • HAL Id : hal-00724842 , version 1

Citer

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. ⟨hal-00724842⟩
238 Consultations
1 Téléchargements

Partager

Gmail Facebook X LinkedIn More