Comparative analysis of a greedy algorithm and discrete optimization for spacecraft data transfer scheduling.
We propose solutions to the problem of scheduling the operations of remote sensing spacecraft, with the specific feature that each of the spacecraft can at any moment transfer data to Earth, or perform observations and record data, but cannot record and transfer simultaneously. We compare two approaches: a greedy algorithm and a method based on discrete optimization with constraints. The work was done during a contest, where Sputnix LLC has provided data and problem statement, with the aim to adapt the developed methods for a constellation of 200 satellites which transfer data to 14 ground stations.
No takes yet. Share an insight, caveat, or question.
Pavlov et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: