Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00687499
Contributor : Denis Arzelier Connect in order to contact the contributor
Submitted on : Friday, April 13, 2012 - 12:04:50 PM
Last modification on : Tuesday, October 19, 2021 - 11:17:53 PM
Long-term archiving on: : Saturday, July 14, 2012 - 2:27:52 AM

File

RDV_JOTA_13_04_2012.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00687499, version 1

Citation

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, Springer Verlag, 2013, 159 (1), pp. 210-230. ⟨hal-00687499⟩

Share

Metrics

Record views

556

Files downloads

566