Pith. sign in

REVIEW

Efficient search of optimal Flower Constellations

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2003.11970 v1 pith:5T3DBSAB submitted 2020-03-25 astro-ph.IM

Martín Avendaño , David Arnas , Richard Linares , Miles Lifson This is my paper · ORCID
classification astro-ph.IM
keywords distancesatellitescomputeconstellationsefficientflowerminimumaltitude
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We derive an analytical closed expression to compute the minimum distance (quantified by the angle of separation measured from the center of the Earth) between any two satellites located at the same altitude and in circular orbits. We also exploit several properties of Flower Constellations (FCs) that, combined with our formula for the distance, give an efficient method to compute the minimum angular distance between satellites, for all possible FCs with up to a given number of satellites.

Discussion (0). Continue with ORCID to comment.

Pith tools