| Autor: |
Lee, Minkeon, Yu, Seunghyeon, Kwon, Kybeom, Lee, Myungshin, Lee, Junghyun, Kim, Heungseob |
| Předmět: |
|
| Zdroj: |
Aerospace (MDPI Publishing); Jan2024, Vol. 11 Issue 1, p83, 17p |
| Abstrakt: |
Satellites have been developed and operated for various purposes. The global satellite market is growing rapidly as the number of satellites and their mission diversity increase. Satellites revolve around the Earth to perform missions and communicate with ground stations repeatedly and sequentially. However, because satellites are orbiting the Earth, there is a limited time window for missions to a specific area and communication with ground stations. Thus, in an environment where multiple satellites and multiple ground stations (MS-MGs) are operated, scheduling missions and communications to maximize the utilization of satellites is a complex problem. For the MS-MG scheduling problem, this study proposes a mixed-integer linear programming (MILP) model to assign time windows for missions and communications with ground stations to individual satellites. The MILP model is based on the concept of a time-space network and includes constraints reflecting on the space mission environment of satellites. The objective function and constraints of the MILP model were validated through numerical experiments based on actual data from Korean satellites. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
