Search space pruning and global optimization of multiple gravity assist trajectories with deep space manoeuvers

Tools

Becerra, Victor M. and Nasuto, Slawomir J. and Anderson, James D. and Ceriotti, M. and Bombardelli, Claudio (2007) Search space pruning and global optimization of multiple gravity assist trajectories with deep space manoeuvers. In: IEEE Congress on Evolutionary Computation (CEC), 2007-09-25 - 2007-09-28.

[thumbnail of strathprints020156.pdf]
Preview
 PDF. Filename: strathprints020156.pdf
Download (252kB)| Preview

Abstract

This paper deals with the design of optimal multiple gravity assist trajectories with deep space manoeuvres. A pruning method which considers the sequential nature of the problem is presented. The method locates feasible vectors using local optimization and applies a clustering algorithm to find reduced bounding boxes which can be used in a subsequent optimization step. Since multiple local minima remain within the pruned search space, the use of a global optimization method, such as Differential Evolution, is suggested for finding solutions which are likely to be close to the global optimum. Two case studies are presented.

CORE (COnnecting REpositories)