Journal of Global Optimization

, Volume 38, Issue 2, pp 283–296

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

  • D. Izzo
  • V. M. Becerra
  • D. R. Myatt
  • S. J. Nasuto
  • J. M. Bishop
Original Paper

DOI: 10.1007/s10898-006-9106-0

Cite this article as:
Izzo, D., Becerra, V.M., Myatt, D.R. et al. J Glob Optim (2007) 38: 283. doi:10.1007/s10898-006-9106-0

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.

Keywords

Multiple gravity assist Space pruning Constraint propagation Differential evolution Particle swarm Genetic algorithm GASP Global trajectory optimisation 

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • D. Izzo
    • 1
  • V. M. Becerra
    • 2
  • D. R. Myatt
    • 2
  • S. J. Nasuto
    • 2
  • J. M. Bishop
    • 3
  1. 1.Advanced Concepts TeamEuropean Space Research and Technology CenterNoordwijkThe Netherlands
  2. 2.School of System EngineeringThe University of ReadingReadingUK
  3. 3.Department of ComputingGoldsmiths CollegeLondonUK