An ant system algorithm for automated trajectory planning

M. Ceriotti, M. Vasile

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

2 Citations (Scopus)


The paper presents an Ant System based algorithm to optimally plan multi-gravity assist trajectories. The algorithm is designed to solve planning problems in which there is a strong dependency of one decision one all the previously made decisions. In the case of multi-gravity assist trajectories planning, the number of possible paths grows exponentially with the number of planetary encounters. The proposed algorithm avoids scanning all the possible paths and provides good results at a low computational cost. The algorithm builds the solutionincrementally, according to Ant System paradigms. Unlikestandard ACO, at every planetary encounter, each ant makes a decision based on the information stored in a tabu and feasible list. The approach demonstrated to be competitive, on a number of instances of a real trajectory design problem, against known GA and PSO algorithms.
Original languageEnglish
Title of host publication2010 Congress on evolutionary computation (CEC)
Place of PublicationNew York
ISBN (Print)9781424481262
Publication statusPublished - 18 Jul 2010
EventWorld Congress on Computational Intelligence, WCCI 2010 - Barcelona, Spain
Duration: 18 Jul 201023 Jul 2010

Publication series

NameIEEE Congress on Evolutionary Computation
ISSN (Print)1556-603X


ConferenceWorld Congress on Computational Intelligence, WCCI 2010
CityBarcelona, Spain


  • multi gravity assist trajectories
  • ant system algorithm
  • automated trajectory planning


Dive into the research topics of 'An ant system algorithm for automated trajectory planning'. Together they form a unique fingerprint.

Cite this