In this paper the preliminary design of multiple gravity-assist trajectories is formulated as a global optimization problem. An analysis of the structure of the solution space reveals a strong multimodality, which is strictly dependent on the complexity of the model. On the other hand it is shown how an oversimplification could prevent finding potentially interesting solutions. A trajectory model, which represents a compromise between model completeness and optimization problem complexity is then presented. The exploration of the resulting solution space is performed through a novel global search approach, which hybridizes an evolutionary based algorithm with a systematic branching strategy. This approach allows an efficient exploration of complex solution domains by automatically balancing local convergence and global search. A number of difficult multiple gravity-assist trajectory design cases demonstrates the effectiveness of the proposed methodology

In this work, we consider multiobjective space mission design problems. We will start from the need, from a practical point of view, to consider in addition to the (Pareto) optimal solutions also nearly optimal ones. In fact, extending the set of solutions for a given mission to those nearly optimal significantly increases the number of options for the decision maker and gives a measure of the size of the launch windows corresponding to each optimal solution, i.e., a measure of its robustness. Whereas the possible loss of such approximate solutions compared to optimal—and possibly even ‘better’—ones is dispensable. For this, we will examine several typical problems in space trajectory design—a biimpulsive transfer from the Earth to the asteroid Apophis and two low-thrust multigravity assist transfers—and demonstrate the possible benefit of the novel approach. Further, we will present a multiobjective evolutionary algorithm which is designed for this purpose

In this paper, we define a discrete dynamical system that governs the evolution of a population of agents. From the dynamical system, a variant of differential evolution (DE) is derived. It is then demonstrated that, under some assumptions on the differential mutation strategy and on the local structure of the objective function, the proposed dynamical system has fixed points toward which it converges with probability one for an infinite number of generations. This property is used to derive an algorithm that performs better than standard DE on some space trajectory optimization problems. The novel algorithm is then extended with a guided restart procedure that further increases the performance, reducing the probability of stagnation in deceptive local minima.

This paper presents a general framework for the development of shape-based approaches to low-thrust trajectory design. A novel shaping method, based on a three-dimensional description of the trajectory in spherical coordinates, is developed within this general framework. Both the exponential sinusoid and the inverse polynomial shaping are demonstrated to be particular two-dimensional cases of the spherical one. The pseudoequinoctial shaping is revisited within the new framework, and the nonosculating nature of the pseudoequinoctial elements is analyzed. A two step approach is introduced to solve the time of flight constraint, related to the design of low-thrust arcs with boundary constraints for both spherical and pseudoequinoctial shaping. The solution derived from the shaping approach is improved with a feedback linear-quadratic controller and compared against a direct collocation method based on finite elements in time. The new shaping approach and the combination of shaping and linear-quadratic controller are tested on three case studies: a mission to Mars, a mission to asteroid 1989ML, a mission to comet Tempel-1, and a mission to Neptune

This paper presents an analysis of optimal impact strategies to deflect potentially dangerous asteroids. To compute the increase in the minimum orbit intersection distance of the asteroid due to an impact with a spacecraft, simple analytical formulas are derived from proximal motion equations. The proposed analytical formulation allows for an analysis of the optimal direction of the deviating impulse transferred to the asteroid. This ideal optimal direction cannot be achieved for every asteroid at any time; therefore, an analysis of the optimal launch opportunities for deviating a number of selected asteroids was performed through the use of a global optimization procedure. The results in this paper demonstrate that the proximal motion formulation has very good accuracy in predicting the actual deviation and can be used with any deviation method because it has general validity. Furthermore, the characterization of optimal launch opportunities shows that a significant deviation can be obtained even with a small spacecraft. Copyright © 2007 by Massimiliano Vasile and Camilla Colombo. Published by the American Institute of Aeronautics and Astronautics, Inc