Automatic MGA trajectory planning with a modified ant colony optimization algorithm

M. Ceriotti, M. Vasile

Research output: Contribution to conferencePaper

80 Downloads (Pure)

Abstract

This paper assesses the problem of designing multiple gravity assist (MGA) trajectories, including the sequence of planetary encounters. The problem is treated as planning and scheduling of events, such that the original mixed combinatorial-continuous problem is discretised and converted into a purely discrete problem with a finite number of states. We propose the use of a two-dimensional trajectory model in which pairs of celestial bodies are connected by transfer arcs containing one deep-space manoeuvre. A modified Ant Colony Optimisation (ACO) algorithm is then used to look for the optimal solutions. This approach was applied to the design of optimal transfers to Saturn and to Mercury, and a comparison against standard genetic algorithm based optimisers shows its effectiveness.
Original languageEnglish
Publication statusPublished - 28 Sep 2009
Event21st International Space Flight Dynamics Symposium, ISSFD 2009 - Toulouse, France
Duration: 28 Sep 20092 Oct 2009

Conference

Conference21st International Space Flight Dynamics Symposium, ISSFD 2009
CityToulouse, France
Period28/09/092/10/09

Keywords

  • multiple gravity assist
  • trajectories
  • ant colony optimisation algorithm
  • optimal transfers
  • optimal solutions

Fingerprint Dive into the research topics of 'Automatic MGA trajectory planning with a modified ant colony optimization algorithm'. Together they form a unique fingerprint.

Cite this