The availability of electric engines as primary sources of propulsion has opened the doors to new scenarios for future interplanetary missions, but has increased the complexity of trajectory design.… Expand

A novel shaping method, based on a three-dimensional description of the trajectory in spherical coordinates, is developed within this general framework, and both the exponential sinusoid and the inverse polynomial shaping are demonstrated to be particular two-dimensional cases of the spherical one.Expand

This work proposes to formulate the complete automated design of a multiple gravity assist trajectory as an autonomous planning and scheduling problem and proposes the use of a two-dimensional trajectory model in which pairs of celestial bodies are connected by transfer arcs containing one DSM.Expand

This paper presents an analysis of an asteroid deflection method based on multiple solar concentrators. A model of the deflection through the sublimation of the surface material of an asteroid is… Expand

The method, which actually aims at finding not only the global minimizer but a whole set of low-lying local minimizers (corresponding to a set of different design options), is based on a domain decomposition technique where each subdomain is evaluated through a procedure based on the evolution of a population of agents.Expand

This work 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 present a multiobjective evolutionary algorithm which is designed for this purpose.Expand

In this paper a comparative assessment of the effectiveness of different deviation methods for Near Earth Objects is presented. Specifically, solar collector, nuclear interceptor, kinetic impactor,… Expand

The attempt here is to assess if commonly encountered problems in mission analysis are solvable in polynomial time, thus allowing a simple desktop solution; and to determine if a solution is available, if the global optimality of this solution can be verified inPolynomialTime, thus guaranteeing the goodness and repeatability of the result.Expand

It is 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.Expand

In this paper we discuss the procedures to test a global search algorithm applied to a space trajectory design problem. Then, we present some performance indexes that can be used to evaluate the… Expand