Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm
Open accessThe DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index; 5 of the 31 sources its claims cite were checked for support.
Abstract
Earth observation satellite (EOS) systems often encounter emergency observation tasks oriented to sudden disasters (e.g., earthquake, tsunami, and mud-rock flow). However, EOS systems may not be able to provide feasible coverage time windows for emergencies, which requires that an appropriately selected satellite transfers its orbit for better observation. In this context, we investigate the orbit maneuver optimization problem. First, by analyzing the orbit coverage and dynamics, we construct three models for describing the orbit maneuver optimization problem. These models, respectively, consider the response time, ground resolution, and fuel consumption as optimization objectives to satisfy diverse user requirements. Second, we employ an adaptive differential evolution (DE) integrating ant colony optimization (ACO) to solve the optimization models, which is named ACODE. In ACODE, key components (i.e., genetic operations and control parameters) of DE are formed into a directed acyclic graph and an ACO is appropriately embedded into an algorithm framework to find reasonable combinations of the components from the graph. Third, we conduct extensive experimental studies to show the superiority of ACODE. Compared with three existing algorithms (i.e., EPSDE, CSO, and SLPSO), ACODE can achieve the best performances in terms of response time, ground resolution, and fuel consumption, respectively.
Overview
CoChat Summary
TL;DR
The paper formulates three single-objective orbital maneuver optimization models for Earth observation satellites responding to emergency observation tasks—minimizing response time, ground resolution, or fuel consumption—and solves them with ACODE, an adaptive differential evolution hybridized with ant colony optimization. In simulations with three satellites and four ground targets, ACODE reportedly outperformed EPSDE, CSO, and SLPSO in almost all scenarios across the three objectives.
Key findings
- ACODE solved all simulated scenarios; for target 1 response-time model T1O1 it selected satellite 3 with response time 5682 s, ground resolution 1.34 m, and fuel 299.62 m/s, while for fuel model T1O3 it selected satellite 1 with fuel 65.82 m/s, response time 36507 s, and ground resolution 1.08 m.
- Different objectives produced trade-offs: T1O1 decreased response time by up to 84.44% and increased ground resolution by up to 200.12% compared with the T1O2 and T1O3 solutions.
- ACODE significantly outperformed EPSDE, CSO, and SLPSO in almost all scenarios using Wilcoxon rank-sum tests at a 0.05 significance level; for T1O1, ACODE’s best/mean response time was 5682/5682 s versus EPSDE 5689/5701.8 s, CSO 5689/7124.8 s, and SLPSO 5693/7194.9 s, and for T2O3 fuel, ACODE’s best/mean was 3.71/3.72 m/s versus EPSDE 6.31/8.28 m/s, CSO 4.78/6.95 m/s, and SLPSO 9.4/29.45 m/s.
- Insufficient satellite resources affected results: for T1O1, the two-satellite scenario increased response time by 249.93% compared with the three-satellite scenario; increasing satellites improved each model’s objective, but trade-offs remained, e.g., target 2 ground resolution improved from 1 to 3 satellites while fuel consumption remained high and response time increased.
Methods
- The problem uses orbit coverage and dynamics analysis with only J2 perturbation; decision variables are velocity increment Δv and maneuver moment t_m, and three single-objective models minimize response time (f1), ground resolution (f2), or fuel consumption (f3), subject to constraints including maximum Δv, altitude 250–1300 km, sunshine window, maximum response time, and required resolution.
- ACODE hybridizes differential evolution and ant colony optimization: DE components—mutation strategy, crossover strategy, scaling factor F, and crossover rate CR—are formed into a directed acyclic graph, and ACO selects configurations via pheromone-based roulette wheel selection; pheromone is updated using fitness improvements with evaporation rate ρ and Max-Min limits [0.1, 0.9], with Latin hypercube sampling for initialization.
- Experiments simulate three satellites and four ground targets over 12 h from 1 December 2020 14:00:00 to 2 December 2020 02:00:00 Beijing time, with maximum scanning angle 45°, maximum response time 12 h, minimum ground resolution 2 m, maximum velocity increment 300 m/s, maximum 50,000 fitness evaluations, and ρ = 0.8; ACODE is compared with EPSDE, CSO, and SLPSO over 10 runs using Wilcoxon rank-sum tests at 0.05.
Limitations
- The paper states simplifying assumptions: only J2 perturbation is modeled; sunshine is assumed from 6:00 to 18:00 local time; clouds, weather, and ground-target altitude are negligible; satellites are independent; task processing and engine start time are negligible; the ground target is a point target; the maneuver is coplanar; and sensor half-angle equals ηmax while Earth’s angular radius equals λmax for convenience.
- The paper states future work is needed to investigate a multi-objective optimization algorithm that can optimize the three objectives simultaneously; the current models optimize one objective per scenario.
- Evident from the text: evaluation is simulation-only, using one set of three satellites, four ground targets, and one 12-h period, with no real-world validation or broader scenario sensitivity reported.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
2 Valid · 2 Not valid · 14 Not checked · 25 Own results and interpretations
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“For the cases in which orbit maneuvers are considered, there are few existing studies that mainly focus on reconfiguration problems of satellite constellations [14][15][16].”
§ Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm > 1. Introduction
What the sources say
- Not checked — no full text of the sourcecites [14] Appel, 2014, Optimization of satellite constellation reconfiguration maneuvers, Acta Astronaut. source
- Supportedcites [15] Paek, S.W., Kim, S., and de Weck, O. (2019). Optimization of Reconfigurable Satellite Constellations Using Simulated Annealing and Genetic Algorithm. Sensors, 19. source
The Introduction describes reconfigurable satellite constellations as an emerging area and says scaling them up requires planning multiple satellite maneuvers. The Methodology’s Maneuvers Module analyzes orbital transfers during reconfiguration. This paper is therefore an example of the kind of study the citing sentence identifies; it does not independently count how many such studies exist. (LLM, conf=0.88)
- Not checked — no full text of the sourcecites [16] Sarno, 2020, A guidance approach to satellite formation reconfiguration based on convex optimization and genetic algorithms, Adv. Space Res. source
plain- 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.
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“As the satellite altitude is typically between 250 and 1300 km [43], constraint (28) is carried out to limit the satellite altitude after maneuvering.”
§ Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm > 2.3. Formulation of the Optimization Problem
What the sources say
- Could not verifycites [43] Somma, 2019, Sensitivity analysis of launch activities in Low Earth Orbit, Acta Astronaut. sourceExperimental — accuracy not yet measured
Our copy nowhere states that satellite altitudes are 'typically between 250 and 1300 km'. The 1300 km figure appears in different senses — the region of interest for proposed mega-constellations (1100-1300 km, Sec. 3.4 / Abstract) and the band where the fewest additional launches reach the density threshold (750-1300 km, Sec. 3.3) — while 250 km occurs only as a shell boundary in Table 1. Indeed, the paper's own data extend beyond such a band: the model runs to 2000 km (Abstract), existing congestion is reported at 700-1000 km and 1400-1500 km (Sec. 3.3), and Table 1 lists hundreds of payloads above 1300 km (e.g. 314 at 1400-1450 km, 218 at 1450-1500 km). Searched: 'satellite altitude typically between 250 and 1300 km', 'LEO altitude range / most populated shells', 'satellites operate below 1300 km'; no passage addresses the claim's point, so it can be neither confirmed nor squarely contradicted. (LLM, conf=0.62)
plain- 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.
- Could not verify
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
“Hence, EPSDE shows similar performance compared with ACODE for observing ground target 1 in terms of ground resolution (scenario T1O2).”
§ Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm > 4.3. Algorithm Comparisons
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.
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
“Nevertheless, ACODE is superior to EPSDE in other scenarios.”
§ Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm > 4.3. Algorithm Comparisons
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
“It can be found that ACODE significantly outperforms EPSDE, CSO, and SLPSO in almost all scenarios, in terms of response time, ground resolution, and fuel consumption.”
- Also stated in: § 4.4. Experiments with Insufficient Satellite Resources · plain
“The comparison results indicate that ACODE is superior to three well-known algorithms (i.e., EPSDE, CSO, and SLPSO).”
§ Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm > 4.3. Algorithm Comparisons
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.
- Also stated in: § 4.4. Experiments with Insufficient Satellite Resources · plain
14 more claims
Create a free account to see all 43 claims and every source verdict.
- Probably not a substantial claim. 14
- It may state two separate claims as one. 14
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
§ Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm > 2.3. Formulation of the Optimization Problem
“f 3 = min T r , s.t.Constraints (25)-( 29). f 2 = min D imag /10 6 , s.t.Constraints (25), ( 26), ( 28)-( 30). f 1 = min ∆v, s.t.Constraints (26)-( 30).”
§ Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm > 4.2. Simulation Results
“Here f 1 , f 2 , and f 3 are response time, ground resolution, and fuel consumption, respectively.”
Citations
Cites
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Differential evolution algorithm with ensemble of parameters and mutation strategies
Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.024 · Cited by 1,362 · cited 3×
“According to empirical considerations [31,33,46], the candidate configurations we used in this paper are summarized in Table 2.”
MethodA Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052 · cited 7×
“CSO is a competitive swarm optimizer inspired by particle swarm optimization.”
MethodInfluentialA social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747 · cited 2×
“The ACODE is compared with three representative algorithms including EPSDE [33], CSO [34], and SLPSO [35] in simulation scenarios where multiple EOSs are requested to observe a ground target.”
MethodDifferential evolution with multi-population based ensemble of mutation strategies
Wu, G., Mallipeddi, R., Suganthan, P. N., Wang, R., & Chen, H. (2016) · Information Sciences · doi:10.1016/j.ins.2015.09.009 · Cited by 569
Self-citationEnsemble of differential evolution variants
Wu, G., Shen, X., Li, H., Chen, H., Lin, A., & Suganthan, P. N. (2018) · Information Sciences · doi:10.1016/j.ins.2017.09.053 · Cited by 386
Self-citationEnsemble strategies for population-based optimization algorithms – A survey
Wu, G., Mallipeddi, R., & Suganthan, P. N. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.08.015 · Cited by 270
Self-citationWang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260 · cited 2×
“Input: Directed acyclic graph Φ and pheromone matrix B g Output: configuration combination M i 1 Initialization: M i ← ∅ , virtual node v 1 2 for l ∈ [ 1, 4 ] do 3 P l ← Calculate probabilities of h arcs with Equation (39) 4 j ← RouletteWheel ( P l )”
BackgroundSelf-citationBiswas, P. P., Suganthan, P. N., Wu, G., & Amaratunga, G. A. J. (2019) · Renewable Energy · doi:10.1016/j.renene.2018.07.152 · Cited by 190 · cited 1×
“Differential evolution (DE) is an efficient population-based stochastic optimization approach for solving optimization problems over continuous space, and many variants of DE have been implemented in engineering fields [30,44,45].”
BackgroundSelf-citation
Research works printed but not linked: 1
- Vallado, D.A. (2001). Fundamentals of Astrodynamics and Applications, Springer.
Cited by
Gu, Z., Xiong, G., & Fu, X. (2023) · Sustainability · doi:10.3390/su15043312 · Cited by 65
Chen, B., Ouyang, H., Li, S., & Zou, D. (2024) · Information Sciences · doi:10.1016/j.ins.2024.120522 · Cited by 43
Wang, T., Luo, Q., Zhou, L., & Wu, G. (2023) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2023.101396 · Cited by 36
Self-citationYin, Q., Wu, G., Sun, G., & Gu, Y. (2025) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2024.101835 · Cited by 38
Self-citationScheduling of Earth observing satellites using distributed constraint optimization
Krigman, S., Grinshpoun, T., & Dery, L. (2024) · Journal of Scheduling · doi:10.1007/s10951-024-00816-x · Cited by 20
Metadata
- Authors
- Luo, Q., Peng, W., Wu, G., & Xiao, Y.
- Affiliations
- Central South University (CN)
- Corresponding author
- Xiao, Yougang
- Venue
- Remote Sensing
- Publisher
- MDPI AG
- Published
- 2022-04-19
- Volume
- 14
- Issue
- 9
- Pages
- 1966
- ISSN
- 2072-4292 (ISSN-L)
- OpenAlex
- W4224241139
- Cited by
- 26
- References
- 47
- Citations by year
- 2026: 6 · 2025: 6 · 2024: 6 · 2023: 8
- FWCI
- 2.22
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Remote Sensing (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- Funders
- Natural Science Foundation of Hunan Province (2021JJ30847)
- China Scholarship Council (202006370285)
- Topics
- Physical Sciences › Engineering › Aerospace Engineering › Spacecraft Dynamics and Control
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Engineering › Aerospace Engineering › Space Satellite Systems and Control
- Keywords
- Earth observation satellites, adaptive differential evolution, ant colony optimization, hybrid metaheuristic, disaster response, satellite coverage, fuel consumption, response time, ground resolution, directed acyclic graphs
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-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).
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: Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm. https://app.cochat.ai/papers/10.3390/rs14091966
- The paper
- Luo, Q., Peng, W., Wu, G., & Xiao, Y. (2022). Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm. Remote Sensing. https://doi.org/10.3390/rs14091966
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.