CORTEXA
← Browse
arxiveess.SYastro-ph.EPmath.OC2026-07-11

Tulip-Shaped Orbits for Lunar South-Pole PNT and Direct-to-Earth Relay Missions

Darin C. Koblick, Michael Casey

This geometric study evaluates a compact seven-petal, 6:5-resonant tulip-shaped orbit constellation for lunar south-pole positioning, navigation, and timing (PNT) and direct-to-Earth relay services. The tulip-shaped orbits are compared against elliptical lunar frozen orbit (ELFO) constellations over the NASA LunaNet Service Volume 2 (SV2), covering lunar latitudes south of -75 degrees. We compare a six-satellite tulip baseline with a minimum-cost five-satellite variant; both use the same shared three-body orbit and differ only in satellite count and along-track phasing. Performance is scored against three Initial Operating Capability C (IOC-C) metrics: line-of-sight (LOS) link availability, Lunar Augmented Navigation System (LANS) geometric dilution of precision (GDOP) below 6, and daily extravehicular activity (EVA) usable-PNT windows. Both tulip constellations satisfy all three IOC-C metrics across SV2. The six-satellite configuration meets requirements with wide margin: 75% worst-point daily GDOP availability and 18 hours of daily EVA support. The five-satellite variant also passes, but with thinner margin: 44% availability and 10 hours of EVA support. Unlike the ELFO configurations, each spacecraft in the tulip-shaped constellation maintains continuous Earth line of sight, providing persistent geometric opportunity for direct single-hop Earth relay. Because all spacecraft share a single three-body orbit, initial phasing and post-failure reconstitution reduce to along-track drift maneuvers between neighboring orbits, with screening-level estimates indicating low maneuver cost.

View free PDFSource page

Related papers

arxivmath.OCeess.SY2026-07-17

Polynomial-Based Solutions to Targeting Problems for Onboard Applications

Adam Evans, Alberto Fossa, Roberto Armellin, Didier Henrion, Renato Zanetti

This paper solves the targeting problem focusing on accuracy, computational efficiency, and reliability. The trajectory optimization problem is first recast as a polynomial optimization problem (POP) by leveraging differential algebra to compute high-order Taylor expansions of th…

View free PDFSource page
arxivstat.MEcs.MAeess.SYmath.OC2026-07-23

Equilibrium Causal Digital Twins: Validation, Transport, and Identification Limits

Faraz Dadgostari, Neda Nazemi

Digital twins are often used to predict how a system would respond to an intervention. In systems with feedback, a twin must reproduce an equilibrium counterfactual, and a twin developed in one domain may fail after mechanisms change. We study when these predictions can be valida…

View free PDFSource page
arxivmath.OCeess.SY2026-07-31

Admissible Set for Linear Systems under Linear State Constraints

Jean Lévine, Philipp Rumschinski, Franz Rußwurm, Stefan Streif

This paper presents a method for computing inner polytopic approximations of admissible sets for continuous-time linear control systems subject to affine state constraints. Building upon barrier theory and the explicit solution of linear systems, a structured sampling procedure i…

View free PDFSource page
arxivmath.OCeess.SY2026-07-31

Node-Wise Dynamic Optimal Control for Evolutionary Games on General Multilayer Networks

Rio Aurachman, Giuliano Punzo

Promoting cooperative behaviour amongst decision makers has key implications for the long term sustainability of social systems. Incentives can promote cooperation in situations where defection is more favourable. Previous research has identified optimal decentralised incentives…

View free PDFSource page
arxivcs.LGeess.SYmath.OC2026-07-22

Local Stability and Gaussian Smoothing of Quantized Neural Networks

Sergey Salishev, Anton Makarov, Oleg Granichin

We study Gaussian averaging as a smooth surrogate for quantized neural models. Under bounded local oscillation, we derive a local dimension-dependent bound on |f-g|, linking Gaussian smoothing to the stability analysis of discontinuous networks. We compute closed-form Gaussian av…

View free PDFSource page