Revising the Observation Satellite Scheduling Problem Based on Deep Reinforcement Learning
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Earth observation satellite task scheduling research plays a key role in space-based remote sensing services. An effective task scheduling strategy can maximize the utilization of satellite resources and obtain larger objective observation profits. In this paper, inspired by the success of deep reinforcement learning in optimization domains, the deep deterministic policy gradient algorithm is adopted to solve a time-continuous satellite task scheduling problem. Moreover, an improved graph-based minimum clique partition algorithm is proposed for preprocessing in the task clustering phase by considering the maximum task priority and the minimum observation slewing angle under constraint conditions. Experimental simulation results demonstrate that the deep reinforcement learning-based task scheduling method is feasible and performs much better than traditional metaheuristic optimization algorithms, especially in large-scale 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
Resource Management with Deep Reinforcement Learning
Mao, H., Alizadeh, M., Menache, I., & Kandula, S. (2016) · Proceedings of the 15th ACM Workshop on Hot Topics in Networks · doi:10.1145/3005745.3005750 · Cited by 1,353 · cited 2×
“Besides the TSP and VRP, another type of optimization problem, resource allocation [25], also has been solved by RL. Khadilkar et al. [31] adopted RL to schedule time resourced for a railway system, and it was found that the Q-learning algorithm is superior to heuristic approaches in effectiveness.”
Deep Reinforcement Learning Based Resource Allocation for V2V Communications
Ye, H., Li, G. Y., & Juang, B.-H. F. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2897134 · Cited by 870
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 2×
“Therefore, an effective EOS scheduling algorithm plays an important role to improve high-quality space-based information services, and not only guides the corresponding EOSs on how to perform the following actions, but also controls the time to start the observations [5].”
InfluentialWang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260 · cited 3×
“The main purpose is to maximize the observation profit within the limited observation time window and with other resources (for example, the available energy, the remaining data storage, etc.) [7,8].”
Liu, X., Laporte, G., Chen, Y., & He, R. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.04.006 · Cited by 250 · cited 1×
“In time-continuous models [11–13], a continuous decision variable is introduced to represent the observation start time for each visible time window (VTW), which is defined to check whether tasks are scheduled or not.”
Gabrel, V., Moulet, A., Murat, C., & Paschos, V. T. (1997) · Annals of Operations Research · doi:10.1023/a:1018920709696 · Cited by 96 · cited 1×
“Exact methods, such as branch and bound (BB) [19] and mixed integer linear programming (MILP) [15], have deterministic solving steps and could solve problems in polynomial time, but it is nearly impossible to build a deterministic model for a larger scale problem.”
Cited by
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
A Novel Multi-Satellite and Multi-Task Scheduling Method Based on Task Network Graph Aggregation
Fan, H., Yang, Z., Zhang, X., Wu, S., Long, J., & Liu, L. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.117565 · Cited by 37
Self-citationDRL-Based Dynamic Destroy Approaches for Agile-Satellite Mission Planning
Huang, W., Li, Z., He, X., Xiang, J., Du, X., & Liang, X. (2023) · Remote Sensing · doi:10.3390/rs15184503 · Cited by 11
Metadata
- Authors
- Huang, Y., Mu, Z., Wu, S., Cui, B., & Duan, Y.
- Venue
- Remote Sensing
- Publisher
- MDPI AG
- Published
- 2021-06-18
- Volume
- 13
- Issue
- 12
- Pages
- 2377
- ISSN
- 2072-4292 (ISSN-L)
- OpenAlex
- W3175378346
- Cited by
- 73
- References
- 6
- FWCI
- 5.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: Revising the Observation Satellite Scheduling Problem Based on Deep Reinforcement Learning. https://app.cochat.ai/papers/10.3390/rs13122377
- The paper
- Huang, Y., Mu, Z., Wu, S., Cui, B., & Duan, Y. (2021). Revising the Observation Satellite Scheduling Problem Based on Deep Reinforcement Learning. Remote Sensing. https://doi.org/10.3390/rs13122377
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.