Research of Multi-Satellite Mission Planning Method Based on Multi-Chromosome Genetic Algorithm

As the number of satellites increases, traditional satellite mission planning methods, which rely on ground station planning and onboard execution, are becoming inadequate to meet the increasingly complex mission requirements. This paper proposes a multi-chromosome genetic algorithm to solve the problem of multi-satellite coordinated Earth observation mission planning. By analyzing the constraints of satellite observation tasks and resources, an optimization model is constructed with the goal of maximizing task completion weights. A multi-chromosome encoding method is designed to improve the algorithm's convergence speed and solution quality. Simulation results show that, compared to traditional genetic algorithms, this approach offers faster convergence and better optimization performance.

Authors

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/iccsse63803.2024.10823951
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research of Multi-Satellite Mission Planning Method Based on Multi-Chromosome Genetic Algorithm

Shuyi Wang, Xiao Wang, Fanxu Meng
1 citations
Robotic Path Planning Algorithms
0.25
article

Research of Multi-Satellite Mission Planning Method Based on Multi-Chromosome Genetic Algorithm

Shuyi Wang, Xiao Wang, Fanxu Meng
article en
1 citations

Abstract

As the number of satellites increases, traditional satellite mission planning methods, which rely on ground station planning and onboard execution, are becoming inadequate to meet the increasingly complex mission requirements. This paper proposes a multi-chromosome genetic algorithm to solve the problem of multi-satellite coordinated Earth observation mission planning. By analyzing the constraints of satellite observation tasks and resources, an optimization model is constructed with the goal of maximizing task completion weights. A multi-chromosome encoding method is designed to improve the algorithm's convergence speed and solution quality. Simulation results show that, compared to traditional genetic algorithms, this approach offers faster convergence and better optimization performance.

Openalex Percentile: Top 42%
Robotic Path Planning Algorithms
0.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.