The Agile Earth Observation Satellite (AEOS) is equipped with onboard optical instruments. They take image of the Earth's surface according to the requests of customers. Each imaging request which is called as a task generates a profit but it may not be possible to perform all tasks, due to the presence of several constraints. In this paper we consider the AEOS scheduling problem, in which a subset of requests from a given set of tasks is selected to maximize profit. We propose a constraint programming (CP) model to solve this NP-hard problem and test the performance of the CP model by solving a set of generated test instances involving 35 to 55 requests. The results show that our model is competitive and can find optimum solutions in reasonable computation times.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Constraint Programming Approach for Agile Earth Observation Satellite Scheduling Problem


    Contributors:


    Publication date :

    2019-06-01


    Size :

    411297 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Agile Earth Observation Satellite Scheduling With a Quantum Annealer

    Stollenwerk, Tobias / Michaud, Vincent / Lobe, Elisabeth et al. | IEEE | 2021


    An Iterated Local Search Algorithm for Agile Earth Observation Satellite Scheduling Problem (AIAA 2018-2311)

    Peng, Guansheng / Vansteenwegen, Pieter / Liu, Xiaolu et al. | British Library Conference Proceedings | 2018




    Scheduling an Agile Multipayload Earth-Observing Satellite

    Zhang, Wenyuan / Zheng, Gangtie | AIAA | 2024