.png){kind=icon}
.png){kind=icon}
Return
Multi-satellite scheduling framework and algorithm for very large area observation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.actaastro.2019.10.041.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a multi-satellite scheduling problem for very large area observation with given specific constraints, derived from satellite capacity and customer requests. It is assumed that the profit was proportional to the coverage of acquired area, and the objective is therefore to maximize the total profits of generated observation schedule. To address the satellite scheduling problem, we first demonstrate a detailed problem description and then transform the problem into set covering problem within several criteria and constraints. Based on that, a mathematical model is established. In order to solve the multi-satellite scheduling problem for large area observation, a new solving framework is proposed. The framework is composed of three phases. In the discretizing phase, an area discretization method is adopted to establish the evaluation system. In the target decomposing phase, area target is decomposed into strips and corresponding visible time windows are calculated. In the scheduling phase, with crossover, mutation and feasibility operators, a genetic algorithm is introduced to generate an optimal observation schedule. Through extensive computational experiments on realistically generated problem with Chinese satellite platform, the effectiveness and reliability of the proposed solving framework are verified.
Keywords:
Multi-satellite scheduling
Very large area observation
Preprocessing
Set covering problem
Genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.1W
Citations:
2.1W