Optimal trajectory design for interplanetary space missions is an extremely hard problem, mostly because of the very large number of local minimizers that real problems present. Despite the challenges of the task, it is possible, in the preliminary phase, to design low-cost high-energy trajectories with little or no human supervision. In many cases, the discovered paths are as cheap, or even cheaper, as the ones found by experts through lengthy and difficult processes. More interestingly, many of the tricks that experts used to design the trajectories, like, e.g., traveling along an orbit in fractional resonance with a given planet, naturally emerge from the computed solutions, despite neither the model nor the solver have been explicitly designed in order to exploit such knowledge. In this chapter we will analyze the modelling techniques that computational experiments have shown to be most successful, along with some of the algorithms that might be used to solve such problems.
Global Optimization Approaches for Optimal Trajectory Planning / Andrea Cassioli; Dario Izzo; David Di Lorenzo; Marco Locatelli; Fabio Schoen. - STAMPA. - (2013), pp. 111-140. [10.1007/978-1-4614-4469-5_5]
Global Optimization Approaches for Optimal Trajectory Planning
CASSIOLI, ANDREA;SCHOEN, FABIO
2013
Abstract
Optimal trajectory design for interplanetary space missions is an extremely hard problem, mostly because of the very large number of local minimizers that real problems present. Despite the challenges of the task, it is possible, in the preliminary phase, to design low-cost high-energy trajectories with little or no human supervision. In many cases, the discovered paths are as cheap, or even cheaper, as the ones found by experts through lengthy and difficult processes. More interestingly, many of the tricks that experts used to design the trajectories, like, e.g., traveling along an orbit in fractional resonance with a given planet, naturally emerge from the computed solutions, despite neither the model nor the solver have been explicitly designed in order to exploit such knowledge. In this chapter we will analyze the modelling techniques that computational experiments have shown to be most successful, along with some of the algorithms that might be used to solve such problems.File | Dimensione | Formato | |
---|---|---|---|
bib.bib
Accesso chiuso
Tipologia:
Altro
Licenza:
Tutti i diritti riservati
Dimensione
1.38 kB
Formato
Unknown
|
1.38 kB | Unknown | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.