Title:
A Lagrangian Relaxtion-Based Heuristic Approach to Regional Constellation Reconfiguration Problem
A Lagrangian Relaxtion-Based Heuristic Approach to Regional Constellation Reconfiguration Problem
Author(s)
Lee, Hang Woon
Ho, Koki
Ho, Koki
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
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.
Sponsor
Date Issued
2021-08
Extent
Resource Type
Text
Resource Subtype
Paper
Rights Statement
Unless otherwise noted, all materials are protected under U.S. Copyright Law and all rights are reserved