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. (2010) MGA trajectory planning with an ACO-inspired algorithm. Acta Astronautica, 67 (9-10). pp. 1202-1217. ISSN 0094-5765

[img] PDF
Ceriotti_M_Vasile_M_Pure_MGA_trajectory_planning_with_an_aco_inspired_algorithm_2010.pdf - Draft Version

Download (638kB)

Abstract

Given a set of celestial bodies, the problem of finding an optimal sequence of swing-bys, deep space manoeuvres (DSM)and transfer arcs connecting the elements of 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. Its automated solution would greatly improve the design of future space missions, allowing the assessment of a large number of alternative mission options in a short 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 optimal planetary sequence and a good estimation of the set of associated optimal trajectories. The trajectory model consists of a sequence of celestial bodies connected by twodimensional transfer arcs containing one DSM. For each transfer arc, the position of the planet and the spacecraft, at the time of arrival, are matched by varying the pericentre of the preceding swing-by, or the magnitude of the launch excess velocity, for the first arc. For each departure date, this model generates a full tree of possible transfers from the departure to the destination planet. Each leaf of the tree represents a planetary encounter and a possible way to reach that planet. Analgorithm 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 a feasible direction. This approach to automatic trajectory planning is applied to the design of optimal transfers to Saturn and among the Galilean moons of Jupiter. Solutions are compared to those found through more traditional genetic-algorithm techniques.

Item type: Article
ID code: 26351
Keywords: multiple gravity assist, interplanetary trajectory design, ant colony optimization, planning, optimization, Mechanical engineering and machinery, Motor vehicles. Aeronautics. Astronautics, Mechanical Engineering, Aerospace Engineering, Control and Systems Engineering, Computational Mechanics, Artificial Intelligence
Subjects: Technology > Mechanical engineering and machinery
Technology > Motor vehicles. Aeronautics. Astronautics
Department: Faculty of Engineering > Mechanical and Aerospace Engineering
Depositing user: Ms Katrina May
Date Deposited: 21 Jul 2010 09:28
Last modified: 22 Aug 2015 02:19
Related URLs:
URI: http://strathprints.strath.ac.uk/id/eprint/26351

Actions (login required)

View Item View Item