Parallel Scheduling of Complex Requests for a Constellation of Earth Observing Satellites

Abstract

Nowadays, the Earth observation systems involve multiple satellites, multiple ground stations, and multiple end-users that formulate various observation requests. These requests might be heterogeneous (stereoscopic observations, periodic observations, systematic observations, etc.), and one difficulty is that the search space defined by the possible ways of performing the requests given the multiple satellites and ground stations available is huge. This paper studies several combinatorial optimization techniques for solving such an operational problem, including a constraint programming approach and parallel scheduling techniques that take advantage of the problem structure. These algorithms are evaluated on realistic instances involving various request types and objective functions depending on the cloud cover conditions, that highly impact the quality of the images collected.

Decentralized, Decomposition-Based Observation Scheduling for a Large-Scale Satellite Constellation

“…This paper is mostly concerned with the last subject. Previous work has predominantly focused on centralized solutions to the multi-satellite, resource-constrained scheduling problem (Augenstein et al 2016;Nag, Li, and Merrick 2018;Shah et al 2019;Squillaci, Roussel, and Pralet 2021;Boerkoel et al 2021;Squillaci, Pralet, and Roussel 2023;He et al 2018;Eddy and Kochenderfer 2021;Globus et al 2004). More recently, decentralized scheduling approaches have proposed auctionbased methods (Picard 2021;Phillips and Parra 2021) and heuristic search based methods relying on broadcasting (Parjan and Chien 2023).…”