Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Imaging satellite scheduling is an NP‐hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.
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
Vasquez, M., & Hao, J.-K. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011203002719 · Cited by 239 · cited 2×
“Vasquez and Hao [3] formalized the daily photograph scheduling problem of EOS as a generalized version of the well-known knapsack model and developed a tabu search algorithm to solve the problem.”
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 · cited 1×
“[23] showed that the single resource range scheduling problem is equivalent to the problem of minimizing the number of tardy jobs on a single-machine with release dates, which enables the deterministic algorithms not suitable to solve the problem if the input size of the problem becomes larger.”
BackgroundDaily 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
Cited by
Task allocation strategies for cooperative task planning of multi-autonomous satellite constellation
Yao, F., Li, J., Chen, Y., Chu, X., & Zhao, B. (2019) · Advances in Space Research · doi:10.1016/j.asr.2018.10.002 · Cited by 52
Xiao, Y., Zhang, S., Yang, P., You, M., & Huang, J. (2019) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2019.03.016 · Cited by 46
Autonomous Task Planning Method for Multi-Satellite System Based on a Hybrid Genetic Algorithm
Long, J., Wu, S., Han, X., Wang, Y., & Liu, L. (2023) · Aerospace · doi:10.3390/aerospace10010070 · Cited by 39
Sun, 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
“Wang et al. (2014) designed two heuristic algorithms to solve the CEOS scheduling problem after analyzing the dynamic properties of CEOS scheduling.”
MethodInfluential
Metadata
- Authors
- Wang, M., Dai, G., & Vasile, M.
- Venue
- Mathematical Problems in Engineering
- Publisher
- Wiley
- Published
- 2014-01
- Volume
- 2014
- Issue
- 1
- ISSN
- 1024-123X (ISSN-L)
- 1563-5147
- OpenAlex
- W2119328119
- Cited by
- 30
- References
- 3
- FWCI
- 3.43
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.