Logo
Logo

Goldsmiths - University of London

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

Izzo, Dario; Becerra, Victor M.; Myatt, Darren; Nasuto, Slawomir and Bishop, Mark (J. M.). 2007. Search space pruning and global optimisation of multiple gravity assist spacecraft trajectories. Journal of Global Optimization, 38(2), pp. 283-296. ISSN 15732916 [Article]

No full text available

Abstract or Description

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.

Item Type: Article

Identification Number (DOI):

https://doi.org/10.1007/s10898-006-9106-0

Departments, Centres and Research Units:

Media and Communications

Dates:

DateEvent
June 2007Submitted

Item ID:

997

Date Deposited:

12 Mar 2009 15:41

Last Modified:

20 Jun 2017 09:39

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI: http://research.gold.ac.uk/id/eprint/997
Edit Record Edit Record (login required)