A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index; 1 of the 14 sources its claims cite were checked for support.
Abstract
The scheduling of Earth Observation Satellite (EOS) data transmission is a complex combinatorial optimization problem. With the development of remote sensing applications, a new special requirement named data transmission oriented to topics has appeared. It supposes that the data obtained from each observation activity by satellites belong to certain observation data topics, and every observation data topic has completeness and timeliness requirements. Unless all of the observation data belonging to one topic has been transmitted to the ground before the expected time, the value of the observation data will be decayed sharply and only a part of the rewards (or even no reward) for the data transmission will be obtained. Current researches do not meet the new data topic transmission requirements well. Based on the characteristics of the problem, a mathematic scheduling model is established, and a novel hybrid scheduling algorithm based on evolutionary computation is proposed. In order to further enhance the performance and speed up the convergence process of our algorithm, a domain-knowledge-based mutation operator is designed. Quantitative experimental results show that the proposed algorithm is more effective to solve the satellite observation data topic transmission scheduling problem than that of the state-of-the-art approaches.
Overview
CoChat Summary
TL;DR
The paper formulates satellite observation data topic transmission scheduling (SDTTS) with timeliness and completeness rewards and proposes HPG4TT, a hybrid PSO-GA algorithm with domain-knowledge mutation. Experiments on simulated scenarios show HPG4TT outperforms baseline heuristics and metaheuristics in reward and convergence.
Key findings
- HPG4TT obtained the best computation results among all compared algorithms, especially in scenarios s6–s10 where data topics contain weak- and strong-relation observation data units; it stood out when transmission windows were badly conflicted (s5, s6, s7) and when problem scale was large (s8–s10).
- HPG4TT’s iterative times were obviously fewer than those of the other three nature-inspired metaheuristic algorithms, especially for large-scale scenarios s8–s10 and when the percentage of strong-relation observation data units was high (s6–s10).
- Among randomicity, precedence, and consistency mutation operators, the consistency mutation operator had the best performance on the tested medium-scale scenarios.
- For crossover probability, HPG4T performed best when ωc = 0.5; for ωc = 0.8 and 0.65, average convergence iteration was greater than 130 and average reward ratio reached 86.5% (88.7% best, 84.4% worst); for ωc = 0.35 and 0.2, average convergence iteration was less than 88 and average reward ratio reached 90.5% (92.4% best, 89% worst); for ωc = 0.5, it obtained the best gbest in each test case and average convergence iterations were around 107.
Methods
- The paper establishes a constraint satisfaction optimization model for SDTTS, with decision variables for transmitting data files during visibility services, constraints on single transmission, ground-station service exclusivity, validity windows, and minimum transmission duration; the objective maximizes reward via timeliness and completeness reward functions.
- HPG4TT combines PSO and GA: it uses natural number encoding, crossover with individual and global optima, and a mutation operator based on stochastic greedy and Matthew effect heuristic rules; hyperparameters include population 20, maximum iterations 200, crossover probability 0.5, mutation probability 0.2, μ1 = 0.8, μ2 = 0.2, and η = 0.15.
- Simulation uses 18 satellites and 5 ground stations in mainland China, 120 ground targets, NORAD ephemeris, STK-calculated visibility windows, and 10 one-day scenarios; it compares HPG4TT with F3S, RSPD2, R2DP, SAA4GS, QPSO4DT, and HGANS, running each algorithm 50 times and recording normalized average results.
Limitations
- The paper states there is still no acknowledged benchmark test data set for the SDTTS problem, and the experiment uses a simulated scenario; data are available from the corresponding author upon request.
- The paper states that satellite observation target scheduling is not studied, and the results are directly derived from the method proposed in literature [1].
- The paper states future work will explore more effective algorithms with learnable parameters; the evaluation is simulation-based, and baseline hyperparameters are set following their authors’ descriptions.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
1 Valid · 10 Not valid · 7 Not checked · 47 Own results and interpretations
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As is shown in Figure 8, the iterative time of HPG4TT is obviously fewer than that of the other three algorithms, especially when the scale of the problem is large (such as s8-s10) and the percentage of strong relation observation data units is high (such as s6-s10).”
§ A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics > 11 International Journal of Aerospace Engineering
boostedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Quantitative experimental results show that the proposed algorithm is more effective to solve the satellite observation data topic transmission scheduling problem than that of the state-of-the-art approaches.”
§ A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics > Abstract
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The average convergence iterations always behave in the same manner trend for all test cases, that is, randomicity > consistency > precedence.”
§ A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics > 5.3. Comparison of Different Mutation Methods.
boostedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“From Figure 9 and Table 4, in the methods employed in HPG4TT: randomicity, precedence, and consistency mutation operators, the consistency mutation operator has the best performance.”
§ A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics > 5.3. Comparison of Different Mutation Methods.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“From Table 5, it is apparent that experiment results can be divided into three parts P 1 ( ω c = 0:8, 0:65), P 2 ( ω c = 0:5), and P 3 ( ω c = 0:35, 0:2).”
§ A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics > 5.4. Comparison of Different Crossover Probabilities.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
15 more claims
Create a free account to see all 65 claims and every source verdict.
- It may state two separate claims as one. 32
- Probably not a substantial claim. 18
- The quote only partly states this claim. 1
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics > 4.2. Encoding.
“For natural number encoding, the encoding length of each particle is L 2 = M × J, and the solution space is Ω 2 = ðM × JÞ L+1 .”
§ A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics > Stopping criteria
“If ϱ mj = 0,let π l mj = 0, ∀m, j; if ϱ mj = x > 0, it means that data file DF mj is transmitted to the ground station during the visibility service x”
Citations
Cites
A Brief Review of Nature-Inspired Algorithms for Optimization
Fister, I., Yang, X., Fister, I., Brest, J., & Fister, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.4186 · Cited by 388
Lewis, A., Lymburner, L., Purss, M. B. J., Brooke, B., Evans, B., Ip, A., Dekker, A. G., Irons, J. R., Minchin, S., Mueller, N., et al. (2016) · International Journal of Digital Earth · doi:10.1080/17538947.2015.1111952 · Cited by 104 · cited 1×
“Nowadays, a new onboard file management system [30, 31] has been developed, and the observation data is stored as files on onboard storage.”
BackgroundSatellite downlink scheduling problem: A case study
Karapetyan, D., Mitrovic Minic, S., Malladi, K. T., & Punnen, A. P. (2015) · Omega · doi:10.1016/j.omega.2015.01.001 · Cited by 75 · cited 1×
“Karapetyan et al. [12] studied the downlink scheduling problem for Canada ’ s earth observing SAR satellite RADARSAT-2 and proposed a fl exible solution approach separating the details of the problem-speci fi c constraints from the optimization mechanism.”
AFSCN scheduling: How the problem and solution have evolved
Barbulescu, L., Howe, A., & Whitley, D. (2006) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2005.12.004 · Cited by 69
MOEA based memetic algorithms for multi-objective satellite range scheduling problem
Du, Y., Xing, L., Zhang, J., Chen, Y., & He, Y. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100576 · Cited by 69 · cited 1×
“The third category formulates the satellite data transmission scheduling problem as a multiobjective optimization problem and adopts improved MOEAs (multiobjective evolutionary algorithms) to generate pareto front as solutions for the problem [3, 28, 29].”
BackgroundOn the tractability of satellite range scheduling
Vazquez, A. J., & Erwin, R. S. (2015) · Optimization Letters · doi:10.1007/s11590-014-0744-8 · Cited by 61 · cited 1×
“This highly constrained problem has been proven to be NP-hard [5, 6].”
BackgroundXhafa, F., & Ip, A. W. H. (2021) · Enterprise Information Systems · doi:10.1080/17517575.2019.1593508 · Cited by 57 · cited 1×
“Because of the complexities, many heuristic resolving strategies have been brought up in literatures [7].”
BackgroundEvaluation of struggle strategy in Genetic Algorithms for ground stations scheduling problem
Xhafa, F., Herrero, X., Barolli, A., Barolli, L., & Takizawa, M. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.01.023 · Cited by 51 · cited 1×
“Xhafa et al. [20, 21] proposed two di ff erent algorithms, simulated annealing algorithm and genetic algo-rithm, to solve ground station scheduling problem, with the consideration of a combination objective function including access window fi tness, communication clashes fi tness, communication time…”
MethodA large-scale multiobjective satellite data transmission scheduling algorithm based on SVM+NSGA-II
Zhang, J., Xing, L., Peng, G., Yao, F., & Chen, C. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100560 · Cited by 48
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 · cited 1×
“[15] modeled the multisatellite observation and datadownlink scheduling problem as a two-stage flow shop scheme.”
BackgroundA data transmission scheduling algorithm for rapid-response earth-observing operations
Li, J., Li, J., Chen, H., & Jing, N. (2014) · Chinese Journal of Aeronautics · doi:10.1016/j.cja.2014.02.014 · Cited by 34 · cited 1×
“[22] focused on reducing data transmission time for rapid-response earth-observing operations.”
BackgroundSelf-citationA Hybrid Genetic Algorithm for Satellite Image Downlink Scheduling Problem
Song, B., Yao, F., Chen, Y., Chen, Y., & Chen, Y. (2018) · Discrete Dynamics in Nature and Society · doi:10.1155/2018/1531452 · Cited by 27 · cited 2×
“Addressing the satellite image downlink scheduling problem, Yao et al. [26] and Song et al. [27] brought up a heuristic genetic algorithm.”
BackgroundMethodTask Scheduling Algorithm for the Communication, Ocean, and Meteorological Satellite
Lee, S., Jung, W. C., & Kim, J. (2008) · ETRI Journal · doi:10.4218/etrij.08.0107.0120 · Cited by 25 · cited 2×
“Lee et al. [8] proposed a heuristic algorithm named “ fi rst fi nished fi rst ser-viced ” to handle COMS scheduling of Korea.”
MethodRoute-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 · cited 2×
“Liu et al. [16] decomposed the satellite range scheduling problem into a multistage decision process.”
BackgroundMethodResolution of an Antenna–Satellite assignment problem by means of Integer Linear Programming
Vazquez, R., Perea, F., & Galán Vioque, J. (2014) · Aerospace Science and Technology · doi:10.1016/j.ast.2014.06.002 · Cited by 21 · cited 1×
“Vazquez et al. [10, 11] employed a heuristic decon fl icting operation when con fl icts were found: fi rstly, moving passes to a di ff erent antenna at the same site or at another site; secondly, shortening the passes ’ time slot on the antenna and then formulating a global integer linear programming…”
BackgroundApproach for earth observation satellite real-time and playback data transmission scheduling
Chen, H., Li, L., Zhong, Z., & Li, J. (2015) · Journal of Systems Engineering and Electronics · doi:10.1109/jsee.2015.00107 · Cited by 18 · cited 5×
“[2, 24, 25] employed improved genetic algorithm and particle swarm optimization algorithm to handle the satellite data transmission scheduling problem with some specific requirements, for incremental observation tasks, member satellites of the same cluster, and real-time and playback data transmission modes.”
MethodInfluentialSelf-citationZhong, X., Yin, H., He, Y., & Huang, Y. (2017) · IEEE Access · doi:10.1109/access.2017.2767061 · Cited by 17 · cited 1×
“The third category formulates the satellite data transmission scheduling problem as a multiobjective optimization problem and adopts improved MOEAs (multiobjective evolutionary algorithms) to generate pareto front as solutions for the problem [3, 28, 29].”
BackgroundExact and Heuristic Methods for Observing Task-Oriented Satellite Cluster Agent Team Formation
Chen, H., Yang, S., Li, J., & Jing, N. (2018) · Mathematical Problems in Engineering · doi:10.1155/2018/2103625 · Cited by 12 · cited 2×
“The satellite observation target scheduling problem is not studied in this paper, so the results are directly derived from the method proposed in literature [1], as shown in Table 1.”
BackgroundMethodSelf-citationChen, H., Zhong, Z., Wu, J., & Ning, J. (2015) · International Conference on Advanced Computational Intelligence (ICACI) · doi:10.1109/icaci.2015.7184787 · Cited by 11
Self-citationChen, H., Zhou, Y., Du, C., & Li, J. (2016) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7748333 · Cited by 11
Self-citationSong, Y., Zhang, Z., Sun, K., Yao, F., & Chen, Y. (2019) · International Journal of Aerospace Engineering · doi:10.1155/2019/1371852 · Cited by 10 · cited 2×
“Addressing the satellite image downlink scheduling problem, Yao et al. [26] and Song et al. [27] brought up a heuristic genetic algorithm.”
BackgroundRobust fixed interval satellite range scheduling
Álvarez, A. J. V., & Erwin, R. S. (2015) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero.2015.7119277 · Cited by 7
The Satellite Downlink Scheduling Problem: A Case Study of RADARSAT-2
Karapetyan, D., Mitrović-Minić, S., Malladi, K. T., & Punnen, A. P. (2014) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4939-1007-6_21 · Cited by 6
Ling, T., Liu, L., Zheng, C., & Liang, Z. (2018) · 2018 18th International Symposium on Communications and Information Technologies (ISCIT) · doi:10.1109/iscit.2018.8588009 · Cited by 6
A Struggle Genetic Algorithm for Ground Stations Scheduling Problem
Xhafa, F., Herrero, X., Barolli, A., & Takizawa, M. (2012) · International Conference on Intelligent Networking and Collaborative Systems (INCoS) · doi:10.1109/incos.2012.125 · Cited by 6
Data relay system data download scheduling algorithm for earth observation satellites
Liang, Z., Liu, L., Jiang, J. W., Guo, J., Zhang, Y., & Yan, H. (2017) · 2017 IEEE International Conference on Communication, Networks and Satellite (Comnetsat) · doi:10.1109/comnetsat.2017.8263566 · Cited by 5
Tian, H., Chang, W., Li, X., Gu, C., & Liu, Z. (2016) · Journal of Applied Remote Sensing · doi:10.1117/1.jrs.10.034001 · Cited by 2 · cited 1×
“Nowadays, a new onboard fi le management system [30, 31] has been developed, and the observation data is stored as fi les on onboard storage.”
BackgroundIntegrating artificial intelligence techniques to generate ground station schedules
Tsatsoulis, C., & Dyne, M. M. V. (2014) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero.2014.6836217 · Cited by 2
A Hill Climbing Algorithm for Ground Station Scheduling
Xhafa, F., Herrero, X., Barolli, A., & Takizawa, M. (2013) · Lecture Notes in Electrical Engineering · doi:10.1007/978-94-007-6996-0_14 · Cited by 1 · cited 1×
“Xhafa et al. [9] adopted a heuristic hill climbing algorithm based on the characteristics of a satellite data downlink process.”
MethodA New Multi-Swarms Competitive Particle Swarm Optimization Algorithm
Xia, L., Chu, J., & Geng, Z. (2012) · Lecture Notes in Electrical Engineering · doi:10.1007/978-3-642-26001-8_18 · Cited by 1
Research works printed but not linked: 2
- 2018, COPLAS, 2018, 53
- 2012, Systems Engineering and Electronics, 34, 2270
Cited by
Satellite Scheduling Problems: A survey of applications in Earth and outer space observation
Ferrari, B., Cordeau, J., Delorme, M., Iori, M., & Orosei, R. (2024) · Computers & Operations Research · doi:10.1016/j.cor.2024.106875 · Cited by 62
Chen, H., Luo, Z., Peng, S., Wu, J., & Li, J. (2022) · Advances in Space Research · doi:10.1016/j.asr.2022.01.037 · Cited by 17
Self-citationAn efficient scheme for in-orbit remote sensing image data retrieval
Chen, J., Di, X., Xu, R., Luo, H., Qi, H., Zhan, P., & Jiang, Y. (2023) · Future Generation Computer Systems · doi:10.1016/j.future.2023.08.017 · Cited by 10
A Unified Model for Multi-Satellite Imaging Mission Planning in Various Scenarios
Yang, X., Hu, M., Zhang, R., & Huang, G. (2023) · IEEE Access · doi:10.1109/access.2023.3275016 · Cited by 9
“[12] studied a constraint satisfaction model-based MSIMP for data subject scheduling, which solves the challenge of scheduling large-scale satellite observation data using an enhanced non-dominated ranking genetic algorithm.”
A Hybrid Genetic Algorithm for Ground Station Scheduling Problems
Xu, L., Yu, C., Wu, B., & Gao, M. Y. (2024) · Applied Sciences · doi:10.3390/app14125045 · Cited by 10
Metadata
- Authors
- Chen, H., Zhai, B., Wu, J., Du, C., & Li, J.
- Affiliations
- National University of Defense Technology (CN)
- Xi’an Satellite Control Center, Xi’an, China
- Corresponding author
- Du, Chun
- Venue
- International Journal of Aerospace Engineering
- Publisher
- Wiley
- Published
- 2020-07-01
- Volume
- 2020
- Pages
- 1-16
- ISSN
- 1687-5966 (ISSN-L)
- 1687-5974
- OpenAlex
- W3038554039
- Cited by
- 12
- References
- 19
- Citations by year
- 2026: 2 · 2025: 1 · 2024: 3 · 2023: 2 · 2022: 2 · 2021: 2
- FWCI
- 0.90
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- International Journal of Aerospace Engineering (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- National Natural Science Foundation of China (41871284, 61806211)
- Topics
- Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Space Technology and Applications
- Keywords
- Earth observation satellites, hybrid evolutionary algorithm, combinatorial optimization, scheduling model
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-09, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-09 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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.