Search space pruning and global optimisation of multiple gravity assist spacecraft trajectories

Authors:
D. Izzo;V. M. Becerra;D. R. Myatt;S. J. Nasuto;J. M. Bishop
Affiliations:
Advanced Concepts Team, European Space Research and Technology Center, Noordwijk, The Netherlands 2201 AZ;School of System Engineering, The University of Reading, Reading, UK RG6 6AY;School of System Engineering, The University of Reading, Reading, UK RG6 6AY;School of System Engineering, The University of Reading, Reading, UK RG6 6AY;Department of Computing, Goldsmiths College, London, UK SE14 6NW
Venue:
Journal of Global Optimization
Year:
2007

Citing 1
Cited 7

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization

Parallel global optimisation meta-heuristics using an asynchronous island-model

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
On the impact of the migration topology on the Island Model

Parallel Computing
Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization

SIAM Journal on Optimization
A global optimization method for the design of space trajectories

Computational Optimization and Applications
Particle swarm optimisation of interplanetary trajectories from Earth to Jupiter and Saturn

Engineering Applications of Artificial Intelligence
Machine learning for global optimization

Computational Optimization and Applications
Search for a grand tour of the jupiter galilean moons

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and describe the Multiple Gravity Assist problem, a global optimisation problem that is of great interest in the design of spacecraft and their trajectories. We discuss its formalization and we show, in one particular problem instance, the performance of selected state of the art heuristic global optimisation algorithms. A deterministic search space pruning algorithm is then developed and its polynomial time and space complexity derived. The algorithm is shown to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation.