An incremental algorithm for fast optimisation of multiple gravity assist trajectories

Multiple gravity assist (MGA) trajectories are essential to reach high gravity targets with low propellant consumption. In mathematical terms, the problem of finding a good first guess solution for the design of a MGA trajectory can be seen as a global optimisation problem. The dimension of the search space, and of the possible alternative solutions, increases exponentially with the number of swing-bys, and the problem is even more complex if deep space manoeuvres are considered. This makes the search for a globally optimal transfer quite difficult. The proposed approach aims at decomposing the main problem into smaller sub-problems, solved incrementally. In fact, starting from the departure planet and flying to the first swing-by planet, only a limited set of transfers are feasible, for example with respect to the maximum achievable. Therefore, when a second leg is added to the trajectory, only the feasible set for the first leg is considered and the search space is reduced. The process iterates by adding one leg at a time and pruning the unfeasible portion of the solution space. The algorithm has been applied to two test cases - an E-E-M transfer and an E-E-V-V-Me transfer - to investigate the efficiency of the exploration of each sub-problem, and the reliability of the space pruning. A comparison to the direct global optimisation of the whole trajectory is shown.

[1]  Michael Cupples,et al.  Interplanetary Mission Design Using Differential Evolution , 2007 .

[2]  Robert W. Farquhar,et al.  Trajectory design and maneuver strategy for the MESSENGER mission to mercury , 2006 .

[3]  Robert H. Leary,et al.  Global Optimization on Funneling Landscapes , 2000, J. Glob. Optim..

[4]  J. L. Cano,et al.  1st ACT Global Trajectory Optimisation Competition: Results found at DEIMOS Space , 2007 .

[5]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[6]  Arnold Neumaier,et al.  Global Optimization by Multilevel Coordinate Search , 1999, J. Glob. Optim..

[7]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[8]  R. Battin An introduction to the mathematics and methods of astrodynamics , 1987 .

[9]  John W. Hartmann,et al.  OPTIMAL INTERPLANETARY SPACECRAFT TRAJECTORIES VIA A PARETO GENETIC ALGORITHM , 1998 .

[10]  Pini Gurfil,et al.  Niching genetic algorithms-based characterization of geocentric orbits in the 3D elliptic restricted three-body problem , 2002 .

[11]  Bernd Dachwald,et al.  Optimization of interplanetary solar sailcraft trajectories using evolutionary neurocontrol , 2004 .

[12]  Nathan J. Strange,et al.  Graphical Method for Gravity-Assist Trajectory Design , 2002 .

[13]  Massimiliano Vasile,et al.  Preliminary analysis of interplanetary trajectories with aerogravity and gravity assist manoeuvres , 2003 .

[14]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[15]  Philippe Louarn,et al.  LAPLACE: A mission to Europa and the Jupiter System for ESA’s Cosmic Vision Programme , 2009 .

[16]  Massimiliano Vasile,et al.  A hybrid multiagent approach for global trajectory optimization , 2009, J. Glob. Optim..