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.
|Title of host publication||2007 IEEE Congress on Evolutionary Computation, Vols 1-10, Proceedings|
|Place of Publication||New York|
|Number of pages||8|
|Publication status||Published - 2007|
|Name||IEEE Congress on Evolutionary Computation|