### Abstract

Language | English |
---|---|

Publication status | Published - 12 Oct 2009 |

Event | 60th International Astronautical Congress - Daejeon, Korea Duration: 12 Oct 2009 → 16 Oct 2009 |

### Conference

Conference | 60th International Astronautical Congress |
---|---|

City | Daejeon, Korea |

Period | 12/10/09 → 16/10/09 |

### Fingerprint

### Keywords

- gravity assist manoeuvres
- deep space manoeuvres (DSM)
- transfer arcs
- optimal multiple gravity assist (MGA) trajectory
- automatic trajectory planning

### Cite this

*MGA trajectory planning with an ACO-inspired algorithm*. Paper presented at 60th International Astronautical Congress, Daejeon, Korea, .

}

**MGA trajectory planning with an ACO-inspired algorithm.** / Ceriotti, M.; Vasile, M.

Research output: Contribution to conference › Paper

TY - CONF

T1 - MGA trajectory planning with an ACO-inspired algorithm

AU - Ceriotti, M.

AU - Vasile, M.

N1 - Also published in Acta Astronautica, 2010. http://strathprints.strath.ac.uk/26351/ (This is a variant record)

PY - 2009/10/12

Y1 - 2009/10/12

N2 - 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.

AB - 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.

KW - gravity assist manoeuvres

KW - deep space manoeuvres (DSM)

KW - transfer arcs

KW - optimal multiple gravity assist (MGA) trajectory

KW - automatic trajectory planning

UR - http://www.iafastro.com/index.html?title=IAC2009_Technical_Programme

UR - http://strathprints.strath.ac.uk/26351/

M3 - Paper

ER -