This work explores on-board planning for the single spacecraft, multiple ground station Earth-observing satellite scheduling problem through artificial neural network function approximation of state–action value estimates generated by Monte Carlo tree search (MCTS). An extensive hyperparameter search is conducted for MCTS on the basis of performance, safety, and downlink opportunity utilization to determine the best hyperparameter combination for data generation. A hyperparameter search is also conducted on neural network architectures. The learned behavior of each network is explored, and each network architecture’s robustness to orbits and epochs outside of the training distributions is investigated. Furthermore, each algorithm is compared with a genetic algorithm, which serves to provide a baseline for optimality. MCTS is shown to compute near-optimal solutions in comparison to the genetic algorithm. The state–action value networks are shown to match or exceed the performance of MCTS in six orders of magnitude less execution time, showing promise for execution on board spacecraft.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Monte Carlo Tree Search Methods for the Earth-Observing Satellite Scheduling Problem


    Contributors:


    Publication date :

    2021-09-06




    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English





    REINFORCEMENT LEARNING FOR THE MULTI-SATELLITE EARTH-OBSERVING SCHEDULING PROBLEM

    Herrmann, Adam / Carneiro, Jo˜ao Vaz / Schaub, Hanspeter | Springer Verlag | 2024



    Scheduling an Agile Multipayload Earth-Observing Satellite

    Zhang, Wenyuan / Zheng, Gangtie | AIAA | 2023


    Monte Carlo Tree Search Methods for Telescope Tasking

    Fedeler, Samuel / Holzinger, Marcus | AIAA | 2020