Prospects on the application of necessary optimality conditions on the resolution of the Goddard problem with unknown bounded parameters using interval arithmetics
Résumé
Our goal is to address the return version of the Goddard problem, which consists in performing the landing of the first stage of a rocket while minimizing its fuel consumption, combining interval arithmetics and the necessary optimality conditions given by the application of the Pontryagin Maximum Principle. Although this goal has not been reached yet, this paper presents preliminaries results on simplified problems, exposes the challenges encountered and suggests further development.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...