A Global Optimisation Toolbox for Massively Parallel Engineering Optimisation

A software platform for global optimisation, called PaGMO, has been developed within the Advanced Concepts Team (ACT) at the European Space Agency, and was recently released as an open-source project. PaGMO is built to tackle high-dimensional global optimisation problems, and it has been successfully used to find solutions to real-life engineering problems among which the preliminary design of interplanetary spacecraft trajectories - both chemical (including multiple flybys and deep-space maneuvers) and low-thrust (limited, at the moment, to single phase trajectories), the inverse design of nano-structured radiators and the design of non-reactive controllers for planetary rovers. Featuring an arsenal of global and local optimisation algorithms (including genetic algorithms, differential evolution, simulated annealing, particle swarm optimisation, compass search, improved harmony search, and various interfaces to libraries for local optimisation such as SNOPT, IPOPT, GSL and NLopt), PaGMO is at its core a C++ library which employs an object-oriented architecture providing a clean and easily-extensible optimisation framework. Adoption of multi-threaded programming ensures the efficient exploitation of modern multi-core architectures and allows for a straightforward implementation of the island model paradigm, in which multiple populations of candidate solutions asynchronously exchange information in order to speed-up and improve the optimisation process. In addition to the C++ interface, PaGMO's capabilities are exposed to the high-level language Python, so that it is possible to easily use PaGMO in an interactive session and take advantage of the numerous scientific Python libraries available.Comment: To be presented at 'ICATT 2010: International Conference on Astrodynamics Tools and Techniques

Analysis of interplanetary solar sail trajectories with attitude dynamics

We present a new approach to the problem of optimal control of solar sails for low-thrust trajectory optimization. The objective was to find the required control torque magnitudes in order to steer a solar sail in interplanetary space. A new steering strategy, controlling the solar sail with generic torques applied about the spacecraft body axes, is integrated into the existing low-thrust trajectory optimization software InTrance. This software combines artificial neural networks and evolutionary algorithms to find steering strategies close to the global optimum without an initial guess. Furthermore, we implement a three rotational degree-of-freedom rigid-body attitude dynamics model to represent the solar sail in space. Two interplanetary transfers to Mars and Neptune are chosen to represent typical future solar sail mission scenarios. The results found with the new steering strategy are compared to the existing reference trajectories without attitude dynamics. The resulting control torques required to accomplish the missions are investigated, as they pose the primary requirements to a real on-board attitude control system

Optimal Trajectories for Near-Earth-Objects Using Solar Electric Propulsion (SEP) and Gravity Assisted Maneuver

The future interplanetary missions will probably use the conventional chemical rockets to leave the sphere of influence of the Earth, and solar electric propulsion (SEP) to accomplish the other maneuvers of the mission. In this work the optimization of interplanetary missions using solar electric propulsion and Gravity Assisted Maneuver to reduce the costs of the mission, is considered. The high specific impulse of electric propulsion makes a Gravity Assisted Maneuver 1 year after departure convenient. Missions for several Near Earth Asteroids will be considered. The analysis suggests criteria for the definition of initial solutions demanded for the process of optimization of trajectories. Trajectories for the asteroid 2002TC70 are analyzed. Direct trajectories, trajectories with 1 gravity assisted from the Earth and with 2 gravity assisted from the Earth and either Mars are present. An indirect optimization method will be used in the simulations

Optimum transfer to Mars via Venus

Thrust maneuver at Venus for optimum Earth-Mars rendezvous trajectory in flyby missio

Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO

The design of spacecraft trajectories for missions visiting multiple celestial bodies is here framed as a multi-objective bilevel optimization problem. A comparative study is performed to assess the performance of different Beam Search algorithms at tackling the combinatorial problem of finding the ideal sequence of bodies. Special focus is placed on the development of a new hybridization between Beam Search and the Population-based Ant Colony Optimization algorithm. An experimental evaluation shows all algorithms achieving exceptional performance on a hard benchmark problem. It is found that a properly tuned deterministic Beam Search always outperforms the remaining variants. Beam P-ACO, however, demonstrates lower parameter sensitivity, while offering superior worst-case performance. Being an anytime algorithm, it is then found to be the preferable choice for certain practical applications.Comment: Code available at https://github.com/lfsimoes/beam_paco__gtoc

MGA trajectory planning with an ACO-inspired algorithm

Given a set of celestial bodies, the problem of finding an optimal sequence of gravity assist manoeuvres, deep space manoeuvres (DSM) and transfer arcs connecting two or more bodies in the set is combinatorial in nature. The number of possible paths grows exponentially with the number of celestial bodies. Therefore, the design of an optimal multiple gravity assist (MGA) trajectory is a NP-hard mixed combinatorial-continuous problem, and its automated solution would greatly improve the assessment of multiple alternative mission options in a shorter time. This work proposes to formulate the complete automated design of a multiple gravity assist trajectory as an autonomous planning and scheduling problem. The resulting scheduled plan will provide the planetary sequence for a multiple gravity assist trajectory and a good estimation of the optimality of the associated trajectories. We propose the use of a two-dimensional trajectory model in which pairs of celestial bodies are connected by transfer arcs containing one DSM. The problem of matching the position of the planet at the time of arrival is solved by varying the pericentre of the preceding swing-by, or the magnitude of the launch excess velocity, for the first arc. By using this model, for each departure date we can generate a full tree of possible transfers from departure to destination. Each leaf of the tree represents a planetary encounter and a possible way to reach that planet. An algorithm inspired by Ant Colony Optimization (ACO) is devised to explore the space of possible plans. The ants explore the tree from departure to destination adding one node at the time: every time an ant is at a node, a probability function is used to select one of the remaining feasible directions. This approach to automatic trajectory planning is applied to the design of optimal transfers to Saturn and among the Galilean moons of Jupiter, and solutions are compared to those found through traditional genetic-algorithm-based techniques