Multi satellites scheduling algorithm based on task merging mechanism
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Abstract Earth observation satellites are platforms equipped with optical instruments that orbit the earth to take photographs of specific areas at users’ requests. Compared with huge user requests, satellites are still scanty resources. For some task, the satellite has to roll its camera to take the desired image. However, many satellites are rigidly restricted on maneuverability. As a result, the performances of satellites are greatly confined. Therefore, we need a scientific observation plan to weaken the constraints arising from satellites’ poor slew ability. To solve the problem we present a multi satellites scheduling algorithm based on task merging mechanism. The algorithm partitions the problem into two sub-problems: task assignment and task merging. In task assignment, we propose an adaptive ant colony optimization algorithm to select specific time window for each task, creating a task list for each satellite. In task merging, we propose the concept of task combination and develop a dynamic programming algorithm to find the best merging plan for each satellite. The two sub-problems are logically coupled; a valid observation plan will be got after much iteration. Finally, a series of test examples are given out, which demonstrate our algorithm to be effective.
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
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
Cited by
An exact algorithm for agile earth observation satellite scheduling with time-dependent profits
Peng, G., Song, G., Xing, L., Gunawan, A., & Vansteenwegen, P. (2020) · Computers & Operations Research · doi:10.1016/j.cor.2020.104946 · Cited by 93
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
Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
Liu, Z., Feng, Z., & Ren, Z. (2019) · Engineering Optimization · doi:10.1080/0305215x.2018.1558445 · Cited by 24
“The first one takes jobs as scheduling elements (Barbulescu et al. 2004; Zufferey, Amstutz, and Giaccari 2008; Marinelli et al. 2011; Liu et al. 2014; Xu et al. 2016).”
Background
Metadata
- Authors
- Xiaolu, L., Baocun, B., Yingwu, C., & Feng, Y.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2014-03
- Volume
- 230
- Pages
- 687-700
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2060745884
- Cited by
- 59
- References
- 3
- FWCI
- 5.39
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multi satellites scheduling algorithm based on task merging mechanism. https://app.cochat.ai/papers/10.1016/j.amc.2013.12.109
- The paper
- Xiaolu, L., Baocun, B., Yingwu, C., & Feng, Y. (2014). Multi satellites scheduling algorithm based on task merging mechanism. Applied Mathematics and Computation. https://doi.org/10.1016/j.amc.2013.12.109
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.