A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem - Université Toulouse 1 Capitole Accéder directement au contenu
Article Dans Une Revue Journal of Optimization Theory and Applications Année : 2013

A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem

Résumé

The optimal fuel impulsive time-fixed rendezvous problem is reviewed. In a linear setting, it may be reformulated as a non convex polynomial optimization problem for a pre-specified fixed number of velocity increments. Relying on variational results previously published in the literature, an improved mixed iterative algorithm is defined to address the issue of optimization over the number of impulses. Revisiting the primer vector theory, it combines variational tests with sophisticated numerical tools from algebraic geometry to solve polynomial necessary and sufficient conditions of optimality. Numerical examples under circular and elliptic assumptions show that this algorithm is efficient and can be integrated into a rendezvous planning tool.
Fichier principal
Vignette du fichier
RDV_JOTA_13_04_2012.pdf (466.73 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00687499 , version 1 (13-04-2012)

Identifiants

  • HAL Id : hal-00687499 , version 1

Citer

Denis Arzelier, Christophe Louembet, Aude Rondepierre, Mounir Kara-Zaitri. A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem. Journal of Optimization Theory and Applications, 2013, 159 (1), pp. 210-230. ⟨hal-00687499⟩
224 Consultations
260 Téléchargements

Partager

Gmail Facebook X LinkedIn More