An Ant System algorithm for automated trajectory planning

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 on all the previously-made decisions. In the case of multi-gravity assist trajectory 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 solution incrementally according to Ant System paradigms. Unlike standard 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.

[1]  Massimiliano Vasile,et al.  On the Preliminary Design of Multiple Gravity-Assist Trajectories , 2011, ArXiv.

[2]  I. Michael Ross.  Hybrid Optimal Control Framework for Mission Planning , 2005, Journal of Guidance, Control, and Dynamics.

[3]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[4]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[5]  Bruce A. Conway,et al.  Genetic algorithms applied to the solution of hybrid optimal control problems in astrodynamics , 2009, J. Glob. Optim..

[6]  Brian Birge,et al.  PSOt - a particle swarm optimization toolbox for use with Matlab , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[7]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[8]  Anastassios E. Petropoulos,et al.  Trajectories to Jupiter via gravity assists from Venus, Earth, and Mars , 1998 .

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  A. Tamilarasi,et al.  Hybridization of Ant Colony Optimization Strategies in Tabu Search for Solving Job Shop Scheduling Problems , 2009 .

[11]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[12]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[13]  Massimiliano Vasile,et al.  Automatic MGA trajectory planning with a modified ant colony optimization algorithm , 2009 .

[14]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[15]  O. V. Stryk,et al.  Decomposition of Mixed-Integer Optimal Control Problems Using Branch and Bound and Sparse Direct Collocation , 2000 .

[16]  Massimiliano Vasile,et al.  A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[17]  Massimiliano Vasile,et al.  Preliminary Design of Low-Thrust Multiple Gravity-Assist Trajectories , 2006 .

[18]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[19]  Roberto Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, Swarm Intelligence.

[20]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[21]  R. Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems From theory to applications , .

[22]  Anastassios E. Petropoulos,et al.  Trajectories to Jupiter via Gravity Assists from Venus, Earth, and Mars , 1998 .

[23]  Gadadhar Sahoo,et al.  Ant colony based hybrid optimization for data clustering , 2007, Kybernetes.