Search from over 60,000 research works

Advanced Search

Search space pruning and global optimisation of Multiple Gravity Assist spacecraft trajectories

Full text not archived in this repository.
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Izzo, D., Becerra, V. M., Myatt, D. R., Nasuto, S. J. orcid id iconORCID: https://orcid.org/0000-0001-9414-9049 and Bishop, 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 0925-5001 doi: 10.1007/s10898-006-9106-0

Abstract/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.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/15293
Item Type Article
Refereed Yes
Divisions Life Sciences > School of Biological Sciences > Department of Bio-Engineering
Uncontrolled Keywords Multiple Gravity Assist, space pruning, constraint propagation, differential evolution, particle swarm, genetic algorithm, GASP, global, trajectory optimisation
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar