Optimal trajectory planning for multiple asteroid tour mission by means of an incremental bio-inspired tree search algorithm

Tools

Vroom, Aram and Di Carlo, Marilena and Martin, Juan Manuel Romero and Vasile, Massimiliano; (2017) Optimal trajectory planning for multiple asteroid tour mission by means of an incremental bio-inspired tree search algorithm. In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, GRC. ISBN 9781509042401 (https://doi.org/10.1109/SSCI.2016.7850108)

[thumbnail of Vroom-etal-SSCI-2016-Optimal-trajectory-planning-for-multiple-asteroid-tour-mission]
Preview
 Text. Filename: Vroom_etal_SSCI_2016_Optimal_trajectory_planning_for_multiple_asteroid_tour_mission.pdf
Accepted Author Manuscript
Download (172kB)| Preview

Abstract

In this paper, a combinatorial optimisation algorithm inspired by the Physarum Polycephalum mould is presented and applied to the optimal trajectory planning of a multiple asteroid tour mission. The Automatic Incremental Decision Making And Planning (AIDMAP) algorithm is capable of solving complex discrete decision making problems with the use of the growth and exploration of the decision network. The stochastic AIDMAP algorithm has been tested on two discrete astrodynamic decision making problems of increased complexity and compared in terms of accuracy and computational cost to its deterministic counterpart. The results obtained for a mission to the Atira asteroids and to the Main Asteroid Belt show that this non-deterministic algorithm is a good alternative to the use of traditional deterministic combinatorial solvers, as the computational cost scales better with the complexity of the problem.

ORCID iDs

Vroom, Aram, Di Carlo, Marilena ORCID logoORCID: https://orcid.org/0000-0001-5046-3028, Martin, Juan Manuel Romero ORCID logoORCID: https://orcid.org/0000-0002-0456-1468 and Vasile, Massimiliano ORCID logoORCID: https://orcid.org/0000-0001-8302-6465;
CORE (COnnecting REpositories)