Aas 20-498 binary integer linear programming formulation for optimal satellite constellation reconfiguration

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.