MOSAIC: a multi-satellite collection scheduling solution for large area coverage

Berger, J., Lo, N., Barkaoui, M.
Journal of Scheduling · Springer Nature · 2026-10-09 · DOI: 10.1007/s10951-026-00895-y

Аннотация

Demand for large area coverage is pervasive over a variety of emergency response application domains. Using multiple Earth observation satellites to collect information through image acquisition in efficiently covering such a task is increasingly drawing attention. But multi-satellite collection scheduling, a NP-hard problem, still faces many computational challenges. In this paper, a new approach combining a single objective multi-satellite collection scheduling decision model and an innovative 2-stage algorithm is proposed to solve the large area coverage problem. The proposed mixed overlapping subarea composition coverage (MOSAIC) approach aims at maximizing collection value defined over the quality of individual image acquisitions weighted by their corresponding relative swath coverage, while minimizing area overlap. The underlying MOSAIC algorithm first maximizes collection value using mutually non-overlapping swaths and then fills remaining gaps while minimizing overlap. The algorithm initially partitions each imaging opportunity swath segment in sub-opportunities (time subintervals) forming contiguous subareas in order to reduce mutual overlaps. Following the 2-stage procedure, it then recombines a mixture of segmented swath elements to near-optimally maximize collection value in covering the original large area. The resulting solution is a mosaic of swath subarea segments. A computational experiment conducted on the basic large area coverage maximization problem proves the value and quality of the approach exhibiting small optimality gap.

Читать у издателя →

Похожие статьи