Automated Multigravity Assist Trajectory Planning with a Modified Ant Colony Algorithm
- 1 September 2010
- journal article
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 7 (9) , 261-293
Abstract
The paper presents an approach to transcribe a multigravity assist trajectory design problem into an integrated planning and scheduling problem. A modified Ant Colony Optimization (ACO) algorithm is then used to generate optimal plans corresponding to optimal sequences of gravity assists and deep space manoeuvers to reach a given destination. The modified Ant Colony Algorithm is based on a hybridization between standard ACO paradigms and a tabu-based heuristic. The scheduling algorithm is integrated into the trajectory model to provide a fast time-allocation of the events along the trajectory. The approach demonstrated to be very effective on a number of real trajectory design problemsKeywords
This publication has 16 references indexed in Scilit:
- Genetic algorithms applied to the solution of hybrid optimal control problems in astrodynamicsJournal of Global Optimization, 2008
- Trajectory Design and Maneuver Strategy for the MESSENGER Mission to MercuryJournal of Spacecraft and Rockets, 2006
- Interplanetary navigation along the low-thrust trajectory of BepiColomboActa Astronautica, 2006
- Preliminary Design of Multiple Gravity-Assist TrajectoriesJournal of Spacecraft and Rockets, 2006
- Hybrid Optimal Control Framework for Mission PlanningJournal of Guidance, Control, and Dynamics, 2005
- Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop schedulingComputers & Operations Research, 2005
- Ant Colony Optimization2004
- Ant colony optimization for resource-constrained project schedulingIEEE Transactions on Evolutionary Computation, 2002
- Trajectories to Jupiter via Gravity Assists from Venus, Earth, and MarsJournal of Spacecraft and Rockets, 2000
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997