Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO
Preprint
Abstract
The design of spacecraft trajectories for missions visiting multiple celestial bodies is here framed as a multi-objective bilevel optimization problem. A comparative study is performed to assess the performance of different Beam Search algorithms at tackling the combinatorial problem of finding the ideal sequence of bodies. Special focus is placed on the development of a new hybridization between Beam Search and the Population-based Ant Colony Optimization algorithm. An experimental evaluation shows all algorithms achieving exceptional performance on a hard benchmark problem. It is found that a properly tuned deterministic Beam Search always outperforms the remaining variants. Beam P-ACO, however, demonstrates lower parameter sensitivity, while offering superior worst-case performance. Being an anytime algorithm, it is then found to be the preferable choice for certain practical applications.Keywords
All Related Versions
- Version 1, 2017-04-03, ArXiv
- Published version: , 141.
This publication has 8 references indexed in Scilit:
- Design of End-to-End Trojan Asteroid Rendezvous Tours Incorporating Scientific ValueJournal of Spacecraft and Rockets, 2016
- Revisiting Lambert’s problemCelestial Mechanics and Dynamical Astronomy, 2014
- Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman ProblemIEEE Computational Intelligence Magazine, 2014
- Choosing promising sequences of asteroidsAutomation and Remote Control, 2013
- MGA trajectory planning with an ACO-inspired algorithmActa Astronautica, 2010
- Automated Multigravity Assist Trajectory Planning with a Modified Ant Colony AlgorithmJournal of Aerospace Information Systems, 2010
- Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop schedulingComputers & Operations Research, 2005
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003