QUEST – A new quadratic decision model for the multi-satellite scheduling problem
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Abstract Demand for earth observation satellite imagery is pervasive and increasing rapidly across multiple domains, highlighting the key problem to optimally schedule satellite image acquisition/collection, subject to ground and on-board constraints. Despite the variety of reported approaches to solving the NP-hard multi-satellite scheduling problem (m-SatSP), serious limitations still prevail, largely overlooking problem structure exploitation and/or domain knowledge. Assuming a few constraints, problem modelling—or scope—is often confined to a simple trailing satellite constellation composition perspective and tends to conveniently oversimplify footprint coverage intricacies. As a result, adequate problem task decomposition properly reflecting complex kinematic behaviour for an ad hoc satellite constellation remains elusive. Known approaches also fail to provide valuable solution optimality gap estimations to objectively qualify best computed solution and/or to control run-time execution in solving hard problem instances. In this paper, a novel approach to solving the single objective static m-SatSP is proposed. It is based on network flow optimization using mathematical programming. Unlike previous methods, QUEST (QUadratically constrainEd program Solver Technology) relies on a sound alternative approximate objective function and, the exploitation of exact problem-solving techniques. Derived from domain knowledge and problem structure considerations, QUEST generalizes problem modelling to successfully handle virtual constellation, avoiding unsuitable utilization of traditional area coverage decomposition scheme. The proposed decision model concurrently captures coverage approximation, imaging success uncertainty and quality for a variety of tasks. It also includes new and optional constraints while embracing an acceptable upper bound on collection value. A QUEST variant alternatively relying on “delayed reward” to bridge promising search regions on move selection, further shows optimality gap reduction and provides additional speedup. Computational results prove QUEST to be cost-effective and to outperform some recent baseline methods derived from best-known m-SatSP procedures. It comparatively demonstrates measurable collection and run-time gains, and provides a tight upper bound on the optimal solution of hard problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Selecting and scheduling observations of agile satellites
Lemaı̂tre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.-M., & Bataille, N. (2002) · Aerospace Science and Technology · doi:10.1016/s1270-9638(02)01173-2 · Cited by 472
Vasquez, M., & Hao, J.-K. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011203002719 · Cited by 239
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Barbulescu, L., Watson, J.-P., Whitley, L. D., & Howe, A. E. (2004) · Journal of Scheduling · doi:10.1023/b:josh.0000013053.32600.3c · Cited by 232
Daily imaging scheduling of an earth observation satellite
Lin, W.-C., Liao, D.-Y., Liu, C.-Y., & Lee, Y.-Y. (2005) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2005.843380 · Cited by 173
Maximizing the value of an Earth observation satellite orbit
Cordeau, J.-F., & Laporte, G. (2005) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601926 · Cited by 150
Gabrel, V., & Vanderpooten, D. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00188-6 · Cited by 124
Optimization-Based Scheduling for the Single-Satellite, Multi-Ground Station Communication Problem
Spangelo, S., Cutler, J., Gilson, K., & Cohn, A. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.11.004 · Cited by 120
An anytime branch and bound algorithm for agile earth observation satellite onboard scheduling
Chu, X., Chen, Y., & Tan, Y. (2017) · Advances in Space Research · doi:10.1016/j.asr.2017.07.026 · Cited by 110
Gabrel, V., Moulet, A., Murat, C., & Paschos, V. T. (1997) · Annals of Operations Research · doi:10.1023/a:1018920709696 · Cited by 96
Hybrid Algorithms for Satellite Imaging Scheduling
Lin, W.-C., & Chang, S.-C. (2006) · 2005 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2005.1571527 · Cited by 27
An Emergency Task Autonomous Planning Method of Agile Imaging Satellite
Song, Y., Huang, D., Zhou, Z., & Chen, Y. (2018) · EURASIP Journal on Image and Video Processing · doi:10.1186/s13640-018-0268-8 · Cited by 26
Cited by
Song, Y., Ou, J., Pedrycz, W., Suganthan, P. N., Wang, X., Xing, L., & Zhang, Y. (2024) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2023.3345928 · Cited by 63
Wen, Z., Li, L., Song, J., Zhang, S., & Hu, H. (2023) · Advances in Space Research · doi:10.1016/j.asr.2022.10.024 · Cited by 46
(2024) · doi:10.3390/aerospace11040280 · Cited by 6
Metadata
- Authors
- Berger, J., Lo, N., & Barkaoui, M.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2020-03
- Volume
- 115
- Pages
- 104822
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2981002223
- Cited by
- 37
- References
- 11
- FWCI
- 2.56
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.