Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

MGA trajectory planning with an ACO-inspired algorithm

Ceriotti, M. and Vasile, M. (2009) MGA trajectory planning with an ACO-inspired algorithm. In: 60th International Astronautical Congress, 2009-10-12 - 2009-10-16, Daejeon, Korea.

Full text not available in this repository. (Request a copy from the Strathclyde author)


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.

Item type: Conference or Workshop Item (Paper)
ID code: 40927
Notes: Also published in Acta Astronautica, 2010. (This is a variant record)
Keywords: gravity assist manoeuvres, deep space manoeuvres (DSM), transfer arcs, optimal multiple gravity assist (MGA) trajectory, automatic trajectory planning, Mechanical engineering and machinery, Motor vehicles. Aeronautics. Astronautics, Aerospace Engineering, Computational Mechanics, Control and Systems Engineering
Subjects: Technology > Mechanical engineering and machinery
Technology > Motor vehicles. Aeronautics. Astronautics
Department: Faculty of Engineering > Mechanical and Aerospace Engineering
Depositing user: Pure Administrator
Date Deposited: 20 Aug 2012 14:31
Last modified: 11 Dec 2015 06:33
Related URLs:

Actions (login required)

View Item View Item