Abstract In the past, space trajectory optimisation was limited to the design of space transfers to single destinations. More recent mission concepts however present the challenge to target multiple destinations; be it for science, exploration or even exploitation. This paper focuses on space trajectories that aim to visit multiple main-belt asteroids with one single spacecraft. The trajectory design of these missions is complicated by the fact that the asteroid sequence is not known a priori, but it is the objective of the optimisation problem. Usually, these problems are tackled as global optimisation problems under the formulation of Mixed-Integer Non-Linear Programming, on which the design variables assume both continuous and discrete values. However, beyond the aim of finding the global optimum, mission designers are usually interested in providing a wide range of mission design options reflecting the multi-modality of the problem. The paper describes a multi-fidelity design pipeline that enables a consistent exploration of all feasible asteroid tours with a given set of mission boundary conditions (e.g., launch window, mission duration, Δv). The consistency of the exploration is ensured by a deterministic search scheme which retains the n-best paths at each stage of a dynamic programming process. Bellman's principle of optimality is made applicable by transcribing the search space into a series of discretized events defined by asteroid index and fly-by epoch, as well as ensuring optimal substructure property with the choice of transfer model and design variables. The method is deployed to explore asteroid tour opportunities visiting 10 or more main belt objects and mission boundary conditions compatible with medium or discovery class missions. 79 million such trajectories are found with launch date in 2037.

    Highlights A multi-fidelity pipeline is proposed to deal with the challenge of trajectories that fly-by many main belt asteroids. A novel transcription of the mixed-integer problem allows for an efficient pruning of the search space. A dynamic programming-based exploration is proposed, keeping the n best solutions for expansion at each unique node. Novel mission scenarios are presented in the framework of ESA's M-class mission envelope.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Modified dynamic programming for asteroids belt exploration


    Beteiligte:
    Bellome, A. (Autor:in) / Sánchez, J.P. (Autor:in) / García Mateas, J.C. (Autor:in) / Felicetti, L. (Autor:in) / Kemble, S. (Autor:in)

    Erschienen in:

    Acta Astronautica ; 215 ; 142-155


    Erscheinungsdatum :

    2023-11-10


    Format / Umfang :

    14 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Exploration of the asteroids

    French, J. R., Jr. / Hulkower, N. D. | NTRS | 1982



    Propellantless Space Exploration Using Asteroids

    Turek, P.A. / American Society of Civil Engineers | British Library Conference Proceedings | 2008


    Future exploration of the asteroids

    Morrison, D. / Niehoff, J. | NTRS | 1979


    Exploration of Near-Earth Asteroids

    Abell, Paul | NTRS | 2013