Diversity-based heuristic search for multiple-asteroid tours
| dc.contributor.author | Grabowski, Jan | |
| dc.contributor.author | Bellome, Andrea | |
| dc.contributor.author | Felicetti, Leonard | |
| dc.date.accessioned | 2024-05-22T10:07:26Z | |
| dc.date.available | 2024-05-22T10:07:26Z | |
| dc.date.issued | 2024-05-13 | |
| dc.description.abstract | An asteroid tour is a sequence of asteroid flybys performed by a spacecraft in a single mission. Visiting different types of asteroids would be of a great scientific return, but planning such type of mission is highly complex. This is because the combinatorial problem of selecting sequences of asteroids is coupled with optimal control problem of finding viable trajectories in terms of transfer times and manoeuvre locations. The combinatorial problem can be tackled with heuristic algorithms that explore the search space to find optimized flyby sequences of asteroids. This paper proposes a search strategy to increase the diversity of the set of flyby sequences found from the resolution of the optimization problem. The goal is to find a tree exploration method that will improve the quality of the solutions by increasing the number of targets encountered and eliminating duplicated sequences while preserving the average ∆v cost. A diversity measure for a set of solutions is defined based on the ∆v cost of the transfer and the nature of the asteroids in the sequences. A variant of the Beam Search (BS) algorithm, referred to as Diversity Search (DS), is tested. Unlike BS, the DS algorithm eliminates duplicated sequences from the final set of solutions. New asteroid tours are found, allowing to reach targets with a higher inclination or eccentricity, but the average ∆v of a flyby sequence is higher than solutions found with BS. A hybrid search strategy using BS and DS is explored. The goal is to reduce the search space with respect to two criteria: ∆v and diversity score. By pruning the search space according to ∆v first, the hybrid search algorithm is able to generate a diverse set of asteroid tours while preserving the total ∆v of the solutions. Compared to DS, less new asteroids are encountered in the solutions but the average ∆v remains similar to results obtained with BS. | en_UK |
| dc.identifier.citation | Grabowski J, Bellome A, Felicetti L. (2024) Diversity-based heuristic search for multiple-asteroid tours. In 2024 IEEE Aerospace Conference, 02-09 March 2024, Big Sky, MT, USA | en_UK |
| dc.identifier.eisbn | 979-8-3503-0462-6 | |
| dc.identifier.isbn | 979-8-3503-0463-3 | |
| dc.identifier.issn | 1095-323X | |
| dc.identifier.uri | https://doi.org/10.1109/AERO58975.2024.10521350 | |
| dc.identifier.uri | https://dspace.lib.cranfield.ac.uk/handle/1826/21648 | |
| dc.language.iso | en_UK | en_UK |
| dc.publisher | IEEE | en_UK |
| dc.rights | Attribution-NonCommercial 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/ | * |
| dc.subject | Space vehicles | en_UK |
| dc.subject | Costs | en_UK |
| dc.subject | Diversity reception | en_UK |
| dc.subject | Search problems | en_UK |
| dc.subject | Solar system | en_UK |
| dc.subject | Space exploration | en_UK |
| dc.subject | Trajectory | en_UK |
| dc.title | Diversity-based heuristic search for multiple-asteroid tours | en_UK |
| dc.type | Conference paper | en_UK |