A Heuristic Algorithm Based on Temporal Conflict Network for Agile Earth Observing Satellite Scheduling Problem
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Agile Earth Observing Satellite (AEOS) scheduling problem consists of selecting a subset of tasks and developing observation plans for a set of agile satellite resources with the purpose of maximizing the total reward of arranged mission observations. This problem has attracted much attention in recent years since AEOS is a new generation satellite being developed all over the world. Due to its NP-hardness, heuristic methods are widely adopted when solving the AEOS scheduling problem (AEOSSP). In this paper, we propose a temporal conflict network-based heuristic algorithm (TBHA), for AEOSSP. The novelty of TBHA lies in the fact that the heuristics are extracted from a temporal conflict network, which characterizes the overlaps (conflicts) of the visible time windows of the problem. These heuristics are highly effective since they well address the time window conflicts which otherwise pose a significant challenge on the choice of the imaging start time for satellite observations. The extensive simulation experiments with the comparison to a number of heuristic algorithm variants and sophisticated meta-heuristic algorithms are conducted to show that the TBHA algorithm performs very well in terms of both solution quality and computational efficiency.
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 1×
“Lemal̂tre [2] provided four methods including a greedy algorithm, a dynamic programming procedure, a constraint programming method, and a local search method, to solve a simplified version of the scheduling problem for AEOSs; Cordeau and Laporte [3] inherited the problem model of [2] and developed a tabu search method…”
MethodLiu, X., Laporte, G., Chen, Y., & He, R. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.04.006 · Cited by 250
Self-citationMaximizing 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 · cited 3×
“Lemal̂tre [2] provided four methods including a greedy algorithm, a dynamic programming procedure, a constraint programming method, and a local search method, to solve a simplified version of the scheduling problem for AEOSs; Cordeau and Laporte [3] inherited the problem model of [2] and developed a tabu search method…”
Method
Cited by
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022) · Annals of Operations Research · doi:10.1007/s10479-022-04634-2 · Cited by 297
Wang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260
“Time-discrete model 7 [12, 13, 61, 24, 62, 18, 25] Complex operational constraints 16 [63, 26, 64, 65, 27, 53, 61, 66, 49, 36, 57, 67, 25, 18, 28, 51] Multi objectives 10 [14, 15, 44, 47, 49, 46, 28, 48, 50, 51] Autonomous scheduling 10 [52, 53, 54, 36, 58, 57, 59, 60, 56, 51]”
BackgroundMethodScheduling and Planning Framework for Time Delay Integration Imaging by Agile Satellite
Qiu, W., Xu, C., Ren, Z., & Teo, K. L. (2022) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2021.3098101 · Cited by 26
Lu, Z., Shen, X., Li, D., Chen, Y., & Li, D. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2021.3072122 · Cited by 24
Self-citationSun, H., Xia, W., Wang, Z., & Hu, X. (2021) · Journal of Systems Science and Systems Engineering · doi:10.1007/s11518-021-5506-4 · Cited by 17
Metadata
- Authors
- Xie, P., Wang, H., Chen, Y., & Wang, P.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 61024-61033
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2920136569
- Cited by
- 35
- References
- 3
- FWCI
- 3.29
- 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 Heuristic Algorithm Based on Temporal Conflict Network for Agile Earth Observing Satellite Scheduling Problem. https://app.cochat.ai/papers/10.1109/access.2019.2902669
- The paper
- Xie, P., Wang, H., Chen, Y., & Wang, P. (2019). A Heuristic Algorithm Based on Temporal Conflict Network for Agile Earth Observing Satellite Scheduling Problem. IEEE Access. https://doi.org/10.1109/access.2019.2902669
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.