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.
Code available at https://github.com/lfsimoes/beam_paco__gtoc5.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The NASA/JPL team’s GTOC7 submission report and workshop slides, containing details of their ACO deployment, can be found in the GTOC portal [1].
- 2.
- 3.
Legs failing this check are immediately discarded, saving computation time that would otherwise be spent generating Lambert arcs with excessive \(\varDelta V\).
References
Global trajectory optimization competition portal. http://sophia.estec.esa.int/gtoc_portal/
Bisiani, R.: Beam search. In: Shapiro, S.C. (ed.) Encyclopedia of Artificial Intelligence, vol. 1, pp. 56–58. Wiley, Hoboken (1987)
Blum, C.: Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32(6), 1565–1591 (2005)
Ceriotti, M., Vasile, M.: Automated multigravity assist trajectory planning with a modified ant colony algorithm. J. Aerosp. Comput. Inf. Commun. 7(9), 261–293 (2010)
Ceriotti, M., Vasile, M.: MGA trajectory planning with an ACO-inspired algorithm. Acta Astronaut. 67(9–10), 1202–1217 (2010)
Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)
Dorigo, M., Stützle, T.: Ant Colony Optimization. A Bradford Book. MIT Press, Cambridge (2004)
da Fonseca, V.G., Fonseca, C.M., Hall, A.O.: Inferential performance assessment of stochastic optimisers and the attainment function. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds.) EMO 2001. LNCS, vol. 1993, pp. 213–225. Springer, Heidelberg (2001). doi:10.1007/3-540-44719-9_15
Gad, A.H.: Space trajectories optimization using variable-chromosome-length genetic algorithms. Ph.D. thesis, Michigan Technological University (2011)
Grigoriev, I.S., Zapletin, M.P.: Choosing promising sequences of asteroids. Autom. Remote Control 74(8), 1284–1296 (2013)
Grigoriev, I.S., Zapletin, M.P.: GTOC5: problem statement and notes on solution verification. Acta Futura 8, 9–19 (2014)
Guntsch, M.: Ant algorithms in stochastic and multi-criteria environments. Ph.D. thesis, Karlsruher Institut für Technologie (2004). http://d-nb.info/1013929756
Guntsch, M., Middendorf, M.: A population based approach for ACO. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoWorkshops 2002. LNCS, vol. 2279, pp. 72–81. Springer, Heidelberg (2002). doi:10.1007/3-540-46004-7_8
Guntsch, M., Middendorf, M.: Applying population based ACO to dynamic optimization problems. In: Dorigo, M., Caro, G., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 111–122. Springer, Heidelberg (2002). doi:10.1007/3-540-45724-0_10
Guntsch, M., Middendorf, M.: Solving multi-criteria optimization problems with population-based ACO. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 464–478. Springer, Heidelberg (2003). doi:10.1007/3-540-36970-8_33
Izzo, D.: PyGMO and PyKEP: Open source tools for massively parallel optimization in astrodynamics (the case of interplanetary trajectory optimization). In: 5th International Conference on Astrodynamics Tools and Techniques (ICATT) (2012)
Izzo, D.: Revisiting Lambert’s problem. Celest. Mech. Dyn. Astron. 121(1), 1–15 (2015)
Izzo, D., Getzner, I., Hennes, D., Simões, L.F.: Evolving solutions to TSP variants for active space debris removal. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1207–1214. ACM (2015)
Izzo, D., Hennes, D., Simões, L.F., Märtens, M.: Designing complex interplanetary trajectories for the global trajectory optimization competitions. In: Fasano, G., Pintér, J.D. (eds.) Space Engineering: Modeling and Optimization with Case Studies, pp. 151–176. Springer, Heidelberg (2016)
Izzo, D., Simões, L.F., Märtens, M., de Croon, G.C., Heritier, A., Yam, C.H.: Search for a grand tour of the jupiter galilean moons. In: Genetic and Evolutionary Computation Conference (GECCO 2013), pp. 1301–1308. ACM (2013)
Izzo, D., Simões, L.F., Yam, C.H., Biscani, F., Di Lorenzo, D., Addis, B., Cassioli, A.: GTOC5: results from the European Space Agency and University of Florence. Acta Futura 8, 45–55 (2014)
Maron, O., Moore, A.W.: The racing algorithm: model selection for lazy learners. In: Aha, D.W. (ed.) Lazy Learning, pp. 193–225. Springer, Dordrecht (1997)
Oliveira, S., Hussin, M.S., Stützle, T., Roli, A., Dorigo, M.: A detailed analysis of the population-based ant colony optimization algorithm for the TSP and the QAP. Technical report, TR/IRIDIA/2011-006, IRIDIA February 2011
Petropoulos, A.E., Bonfiglio, E.P., Grebow, D.J., Lam, T., Parker, J.S., Arrieta, J., Landau, D.F., Anderson, R.L., Gustafson, E.D., Whiffen, G.J., Finlayson, P.A., Sims, J.A.: GTOC5: results from the Jet Propulsion Laboratory. Acta Futura 8, 21–27 (2014)
Sinha, A., Malo, P., Deb, K.: Evolutionary bilevel optimization: an introduction and recent advances. In: Bechikh, S., Datta, R., Gupta, A. (eds.) Recent Advances in Evolutionary Multi-objective Optimization. ALO, vol. 20, pp. 71–103. Springer, Heidelberg (2017). doi:10.1007/978-3-319-42978-6_3
Stuart, J.R., Howell, K.C., Wilson, R.S.: Design of end-to-end trojan asteroid rendezvous tours incorporating scientific value. J. Spacecr. Rockets 53(2), 278–288 (2016)
Weise, T., Chiong, R., Lässig, J., Tang, K., Tsutsui, S., Chen, W., Michalewicz, Z., Yao, X.: Benchmarking optimization algorithms: an open source framework for the traveling salesman problem. IEEE Comput. Intell. Mag. 9(3), 40–52 (2014)
Wilt, C.M., Thayer, J.T., Ruml, W.: A comparison of greedy search algorithms. In: Proceedings of the Third Annual Symposium on Combinatorial Search (SOCS 2010), pp. 129–136 (2010)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117–132 (2003)
Acknowledgment
Luís F. Simões was supported by FCT (Ministério da Ciência e Tecnologia) Fellowship SFRH/BD/84381/2012.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Simões, L.F., Izzo, D., Haasdijk, E., Eiben, A.E. (2017). Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO. In: Hu, B., López-Ibáñez, M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2017. Lecture Notes in Computer Science(), vol 10197. Springer, Cham. https://doi.org/10.1007/978-3-319-55453-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-55453-2_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55452-5
Online ISBN: 978-3-319-55453-2
eBook Packages: Computer ScienceComputer Science (R0)