2020 Chinese Automation Congress (CAC) 2020
DOI: 10.1109/cac51589.2020.9326860
|View full text |Cite
|
Sign up to set email alerts
|

Autonomous Mission Planning for Multi-Agile Earth Observation Satellites Using Whale Optimization Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…The algorithms in this paper are tested on problems of different scales the discrete artificial bee colony algorithm (DABC), the improved genetic algorithm (IGA) [17], and the improved discrete particle swarm algorithm (IDPSO) [40], respectively. Each algorithm is run 20 times on each problem scale to record the best fitness value (BF) and the average fitness value (AF), and the results are shown in Table 5.…”
Section: B Algorithm Comparisonmentioning
confidence: 99%
See 1 more Smart Citation
“…The algorithms in this paper are tested on problems of different scales the discrete artificial bee colony algorithm (DABC), the improved genetic algorithm (IGA) [17], and the improved discrete particle swarm algorithm (IDPSO) [40], respectively. Each algorithm is run 20 times on each problem scale to record the best fitness value (BF) and the average fitness value (AF), and the results are shown in Table 5.…”
Section: B Algorithm Comparisonmentioning
confidence: 99%
“…Zheng et al [16] designed iterative rules based on termination algebra and jump conditions by referring to the advantages of dynamic mutation strategy and adaptive mutation strategy, so as to overcome the shortcomings of traditional genetic algorithms, such as easy to fall into local optimization and long solving time. Gao et al [17] introduced the tabu search method and Metropolis rule into the mutation operation of genetic algorithm to accelerate the convergence speed of the algorithm and improve the probability of finding the optimal solution. Habet et al [10] mapped the satellite mission planning problem into a constraint satisfaction optimization problem and performed the construction of the taboo search neighborhood by partial enumeration based on insertion trial.…”
Section: Introductionmentioning
confidence: 99%
“…This combined approach is capable of addressing scenarios that prioritize both the efficiency and stability of satellite data transmission scheduling [12]. Collectively, these methodologies highlight the high efficiency of the GA and its potential for integration with other algorithms to address their inherent limitations, further enhancing their performance [13].…”
Section: Introductionmentioning
confidence: 99%
“…It often has the characteristics of non-linearity and high complexity. In real life, many problems can be expressed as high-dimensional optimization problems, such as large-scale job-shop-scheduling problems [ 1 ], vehicle-routing problems [ 2 ], feature selection [ 3 ], satellite autonomous observation mission planning [ 4 ], economic environmental dispatch [ 5 ], and parameter estimation. These kinds of optimization problems often greatly degrade the performance of the optimization algorithm as the dimension of the optimization problem increases, so it is extremely difficult to obtain the global optimal solution, which poses a technical challenge to solving many practical problems.…”
Section: Introductionmentioning
confidence: 99%