Paulo Jorge Nascimento | Search arXiv

arXiv2026

Earth Observation Satellite Scheduling Models: Taxonomy, Classification and Open Challenges

Over the past three decades, a large number of optimization models have been proposed for Earth observation satellite (EOS) scheduling. The main goal of this paper is to provide an overview of these models and to relate them to the characteristics of the problems they address. To do so, we first identify the main features of EOS scheduling problems and those with the most impact on the computational complexity of the model. Based on these features, we propose a new taxonomy of satellite agility and a classification of EOS scheduling problems that allows the problem under study to be clearly identified. We then propose a classification of the optimization models into five categories, based on their time and event representations, and describe representative formulations of each category in a unified notation, together with their extensions, discussing the respective advantages and limitations. The trade-offs between the alternative representations are analyzed, showing that discrete-time formulations allow time-dependent parameters, such as transition times and image quality, to be pre-computed, which preserves the linearity of the model but makes its size depend on the adopted discretization, whereas continuous-time formulations treat these parameters as functions of the start times, which introduces nonlinearities unless simplifying assumptions are adopted. Finally, we identify the main open challenges, including the exact modeling of time-dependent transition times and the integrated scheduling of active imaging satellites.

math.OC↗

arXiv2026

A Constraint Programming Model for the Super-Agile Earth Observation Satellite Imaging Scheduling Problem

As the dependence on satellite imaging continues to grow, modern satellites have become increasingly agile, with the new generation, namely super-agile Earth observation satellites (SAEOS), providing unprecedented imaging flexibility. The highly dynamic capabilities of these satellites introduce additional challenges to the scheduling of observation tasks, as existing approaches for conventional agile satellites do not account for variable observation durations and multiple imaging directions. Although some efforts have been made in this regard, the SAEOS imaging scheduling problem (SAEOS-ISP) remains largely unexplored, and no exact approaches have yet been proposed. In this context, this study presents the first exact Constraint Programming formulation for the SAEOS-ISP, considering flexible observation windows, multiple pointing directions and sequence-dependent transition times across multiple satellites. Computational experiments on a newly generated benchmark set demonstrate that the model can be solved efficiently and within very short computational times. Moreover, the results also show that the proposed approach has the potential to achieve higher computational performance compared to the non-exact approaches that are currently considered state-of-the-art.

eess.SY↗