[PDF][PDF] A Lagrangian Relaxation-Based Heuristic Approach to Regional Constellation Reconfiguration Problem

H Lee, K Ho - AAS/AIAA Astrodynamics Specialist Conference, 2021 - ssdl.gatech.edu
AAS/AIAA Astrodynamics Specialist Conference, 2021ssdl.gatech.edu
A group of satellites—with either heterogeneous or homogeneous orbital characteristics
and/or hardware specifications—can undertake a reconfiguration process due to variations
in operations pertaining to regional coverage missions. This paper is concerned with the
optimization of the specifications of the reconfiguration process that maximizes (resp.,
minimizes) the utility (resp., the cost). The specifications refer to the final design
configuration and the transportation of satellites from one configuration to another. The utility …
A group of satellites—with either heterogeneous or homogeneous orbital characteristics and/or hardware specifications—can undertake a reconfiguration process due to variations in operations pertaining to regional coverage missions. This paper is concerned with the optimization of the specifications of the reconfiguration process that maximizes (resp., minimizes) the utility (resp., the cost). The specifications refer to the final design configuration and the transportation of satellites from one configuration to another. The utility refers to the coverage performance of the final configuration; the cost refers to the∆ V consumed or the time of flight incurred due to the reconfiguration process. We present an integer linear program formulation of the regional satellite constellation reconfiguration problem and two heuristic solution methods based on Lagrangian relaxation.
ssdl.gatech.edu
以上显示的是最相近的搜索结果。 查看全部搜索结果