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 |
| |
Institution: | (1) Advanced Concepts Team, European Space Research and Technology Center, Keplerlaan 1, 2201 AZ Noordwijk, The Netherlands;(2) School of System Engineering, The University of Reading, RG6 6AY Reading, UK;(3) Department of Computing, Goldsmiths College, SE14 6NW London, UK |
| |
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.
This work was partially funded under the Ariadna scheme of the European Space Agency, contract number 18138/04/NL/MV. |
| |
Keywords: | Multiple gravity assist Space pruning Constraint propagation Differential evolution Particle swarm Genetic algorithm GASP Global trajectory optimisation |
本文献已被 SpringerLink 等数据库收录! |
|