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

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 heuris...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization 2007-06, Vol.38 (2), p.283-296
Main Authors: Izzo, D, Becerra, V M, Myatt, D R, Nasuto, S J, Bishop, J M
Format: Article
Language:English
Subjects:
Algorithms
Boundary value problems
Complexity
Control
Earth
Genetic algorithms
Global optimization
Gravity
Optimization
Pluto
Polynomials
Searching
Spacecraft
Spacecraft design
Spacecraft trajectories
Studies
Velocity
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. [PUBLICATION ABSTRACT]
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-006-9106-0