A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The agile earth observing satellite scheduling (AEOSS) problem consists of scheduling a subset of images among a set of candidates that satisfy imperative constraints and maximize a gain function. In this paper, we consider a new AEOSS model which integrates a time-dependent temporal constraint. To solve this problem, we propose a highly efficient branch and bound algorithm whose effective ingredients include a look-ahead construction method (for generating a high quality initial lower bound) and a combined use of three pruning strategies (which help to prune a large portion of the search space). We conducted computational experiments on a set of test data that were generated with information from real-life scenarios. The results showed that the proposed algorithm is efficient enough for engineering application. In particular, it is able to solve instances with 55 targets to optimality within 164 seconds on average. Furthermore, we carried out additional experiments to analyze the contribution of each key algorithm ingredient.
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 · cited 4×
“So the critical constraint is the time-dependent temporal constraint, which means the minimum transition time taken by a maneuver between the end of the former acquisition and the start of the following one is not constant and depends on the precise time at which the transition is triggered [1].”
BackgroundInfluential
Cited by
Wang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260
“[68] consider some operational constraints such as memory and energy constraints are not tight constraints in some cases, thus only remaining the time window and tasks transition constraints in the AEOSSP.”
BackgroundMethodInfluentialSelf-citationDeep Reinforcement Learning Method for Satellite Range Scheduling Problem
Ou, J., Xing, L., Yao, F., Li, M., Lv, J., He, Y., Song, Y., Wu, J., & Zhang, G. (2023) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2023.101233 · Cited by 91
Self-citationAn 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
Self-citationAn Efficient Local Search Heuristic for Earth Observation Satellite Integrated Scheduling
Chen, Y., Lu, J., He, R., & Ou, J. (2020) · Applied Sciences · doi:10.3390/app10165616 · Cited by 24
Self-citationScheduling multiple agile Earth observation satellites with multiple observations
Wang, X., Han, C., & Leus, R. (2026) · Advances in Space Research · doi:10.1016/j.asr.2025.10.042 · Cited by 24
Metadata
- Authors
- Chu, X., Chen, Y., & Xing, L.
- Venue
- Discrete Dynamics in Nature and Society
- Publisher
- Wiley
- Published
- 2017
- Volume
- 2017
- Pages
- 1-15
- ISSN
- 1026-0226 (ISSN-L)
- 1607-887X
- OpenAlex
- W2751670160
- Cited by
- 59
- References
- 1
- FWCI
- 3.30
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling. https://app.cochat.ai/papers/10.1155/2017/7345941
- The paper
- Chu, X., Chen, Y., & Xing, L. (2017). A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling. Discrete Dynamics in Nature and Society. https://doi.org/10.1155/2017/7345941
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.