This paper addresses the critical problem of co-optimizing the optimal locations for orbital depots and the sequence of in-space servicing for a satellite constellation. While most traditional studies used network optimization for this problem, assuming a fixed set of discretized nodes in the network (i.e., a limited number of depot location candidates), this work is unique in that it develops a method to optimize the depot location in continuous space. The problem is formulated as mixed-integer nonlinear programming, and we propose a solution methodology that iteratively solves two decoupled problems: one using mixed-integer linear programming and the other using nonlinear programming with an analytic transfer solution. To demonstrate the effectiveness of our approach, we apply this methodology to a case study involving a GPS satellite constellation. Numerical experiments confirm the stability of our proposed solutions.
Orbital Depot Location Optimization for Satellite Constellation Servicing with Low-Thrust Transfers
01.05.2025
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Orbital Facility Location Problem for Satellite Constellation Servicing Depots
AIAA | 2024
|Finite thrust orbital transfers
Online Contents | 2014
|Low-thrust, minimum-fuel, orbital transfers
NTRS | 1971
|Minimum-fuel orbital transfers with low-thrust rockets
TIBKAT | 1971
|