Pith. sign in

REVIEW

Cislunar Satellite Constellation Design Via Integer Linear Programming

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.10252 v2 pith:AMAQ6BRY submitted 2023-11-17 math.OC

Cislunar Satellite Constellation Design Via Integer Linear Programming

classification math.OC
keywords demandspacecislunarconstellationdesignproblemawarenessdomain
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Cislunar space domain awareness is of increasing interest to the international community as Earth-Moon traffic is projected to increase, which raises the problem of placing space-based sensors optimally in a constellation to satisfy the space domain awareness demand in cislunar space. This demand profile can vary over space and time, making the design optimization problem challenging. This paper tackles the problem of satellite constellation design for spatio-temporally varying coverage demand by leveraging an integer linear programming formulation. The developed optimization formulation assumes the circular restricted 3-body dynamics and attempts to minimize the number of satellites required for the requested demand profile.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.