Sequence optimization for multiple asteroids rendezvous via cluster analysis and probability-based beam search

  • PDF / 1,080,896 Bytes
  • 9 Pages / 612 x 792 pts (letter) Page_size
  • 31 Downloads / 194 Views

DOWNLOAD

REPORT


. Article .

Print-CrossMark

https://doi.org/10.1007/s11431-020-1560-9

Sequence optimization for multiple asteroids rendezvous via cluster analysis and probability-based beam search LI HaiYang* & BAOYIN HeXi* School of Aerospace Engineering, Tsinghua University, Beijing 100084, China Received February 10, 2020; accepted March 10, 2020; published online October 19, 2020

It is of great significance to visit multiple asteroids in a space mission. In this paper, the multiple asteroids mission optimization is implemented using cluster analysis and probability-based beam search. Clustering is performed to select the first asteroid to visit. Four cluster algorithms are investigated and affinity propagation is selected. Then four beam search algorithms that are deterministic beam search and three probability-based beam search variants, probabilistic beam search, ant-colony beam search, and evolving beam search, are applied to search for the rendezvous sequence. Deterministic beam search as a heuristic tree search algorithm is widely applied in multitarget sequence optimization, but it has an obvious drawback of the conflict between the number of pruned nodes and the possibility of finding optimal solutions, which can be improved by probability-based beam search. Among three probability-based beam search, the ant-colony beam search has a learning mechanism, and evolving beam search is constructed based on ant-colony beam search and has an evolutionary mechanism. Results show that the introduction of randomness can improve beam search, and beam search variants with the learning and evolutionary mechanism have an excellent performance. interplanetary trajectory optimization, multi-target mission, cluster analysis, probability-based beam search Citation:

Li H Y, Baoyin H X. Sequence optimization for multiple asteroids rendezvous via cluster analysis and probability-based beam search. Sci China Tech Sci, 2020, 63, https://doi.org/10.1007/s11431-020-1560-9

1 Introduction Asteroids have attracted vast research interest because of their great significance in various aspects [1–3]. In space missions to multiple targets, substantial benefits are gained since the average expense of exploring each target is lowered [4–6]. NASA’s Near Earth Asteroid Rendezvous (NEAR) Shoemaker performed a flyby of the asteroid 253 Mathilde on the way to the asteroid 433 Eros [7]. In the previous plan for the NEAR mission, an ambitious plan called Small-Body Grand Tour, which aimed to achieve flybys of two comets and two asteroids over a 10-year period, was proposed [8]. Deep *Corresponding authors (email: [email protected]; [email protected]) 1) https://sophia.estec.esa.int/gtoc portal/

Space 1 [9] and Dawn [10] also achieved multitarget visits of small celestial bodies. The Global Trajectory Optimization Competitions (GTOCs)1) , which are some of the most challenging events in space engineering, had several editions greatly focused on multitarget small celestial body missions. The crucial part of optimizing a multiple asteroids ren