Skip to main content
Skip to article control options
AIAA 2023-4658
Session: Space Resource Stewardship II
Published Online:

In this paper, we adapt and reframe the application of mathematical tools originally devised for facility location problems (FLPs) in operations research to address design optimization challenges encountered during the satellite constellation pattern design process. First, we revisit existing applications of FLPs applied to satellite constellation pattern design problems. Second, we identify new classes from existing FLPs and adjust them as necessary, culminating in mixed-integer linear programming (MILP) models, to address new problems that arise during the satellite constellation pattern design, for instance, we provide a framework for obtaining an optimal satellite constellation pattern that delivers the desired percentage of coverage over a target based on the partial set covering location problem. Additionally, a robust network with inter-satellite links is designed to implement the set covering location problem merged with Dirac's Theorem. Lastly, we present two MILP models inherited from the $p$-center formulation to maximize the received signal strength and minimize the maximum revisit time. In all cases, we provide illustrative examples to demonstrate the practical usage of the proposed formulations.