Binary Integer Linear Programming Formulation for Optimal Satellite Constellation Reconfiguration

Thumbnail Image
Files
LeeHo_AAS_20-498_2020.pdf (1.18 MB)
Author(s)
Lee, Hang Woon
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Daniel Guggenheim School of Aerospace Engineering
The Daniel Guggenheim School of Aeronautics was established in 1931, with a name change in 1962 to the School of Aerospace Engineering
Series
Collections
Research Publications
Supplementary to:
Permanent Link
https://hdl.handle.net/1853/74023
Abstract
Satellite constellations are commonly designed for fixed mission requirements. However, these systems are often subject to change in mission operations. This paper integrates the constellation transfer problem and the constellation design problem that are otherwise independent and serial in nature. Building upon the integrated model, this paper provides a solution to the following general problem statement. Suppose an existing satellite constellation system, a group of satellites with some form of shared orbital characteristics, is undertaking a reconfiguration process from its initial configuration to a final configuration due to variations in mission operations. The problem is to find the specifications of the reconfiguration process that maximizes the utility. An illustrative example is conducted to demonstrate the value of the framework.
Sponsor
Date
2020-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
Rights URI
https://rightsstatements.org/page/InC/1.0/?language=en