Creative Commons Attribution 4.0 International license
The increasing hunger for remote sensing data fuels a boom in satellite imagery, leading to larger agile Earth observation satellite (AEOS) constellations. Therefore, instances of the AEOS scheduling problem (AEOSSP) has become harder to solve. As most existing approaches to solve AEOSSP are designed for a single spacecraft or smaller constellations in mind, they are not tailored to the need of our industrial partner that is about to launch a constellation of 20 AEOSs. Hence, we designed a local search solver able to schedule observations and downloads at such a scale. It relies on solving a series of sub-problems as travelling salesman problem with time windows (TSPTW), first greedily, then using a CP-SAT exact solver in order to find a solution when the greedy insertion fails. Lastly, it schedules downloads and enforces memory constraints with greedy algorithms. Experiments were carried out on instances from the literature as well as generated instances from a simulator we designed. Our experiments show that using CP to solve the sub-problem significantly improve the solutions, and overall our method is slightly better than state-of-the-art approaches.
@InProceedings{antuori_et_al:LIPIcs.CP.2025.3,
author = {Antuori, Valentin and Wojtowicz, Damien T. and Hebrard, Emmanuel},
title = {{Solving the Agile Earth Observation Satellite Scheduling Problem with CP and Local Search}},
booktitle = {31st International Conference on Principles and Practice of Constraint Programming (CP 2025)},
pages = {3:1--3:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-380-5},
ISSN = {1868-8969},
year = {2025},
volume = {340},
editor = {de la Banda, Maria Garcia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.3},
URN = {urn:nbn:de:0030-drops-238647},
doi = {10.4230/LIPIcs.CP.2025.3},
annote = {Keywords: Local Search, Greedy Algorithms, Aerospace Applications}
}
archived version
archived version