CORTEXA
← Browse
arxiveess.SPastro-ph.EPastro-ph.IMeess.SYmath.OCphysics.space-ph2026-06-29

Earth-baseline VLBI restores the observability of a lunar surface station in joint orbit-and-clock determination

Chakshu Baweja

Lunar positioning, navigation, and timing (PNT) is moving from concept to hardware, ESA's Moonlight/LCNS, NovaMoon reference stations, LunaNet, and Coordinated Lunar Time, all reducing to one estimation core: fix the orbits and clocks of the lunar infrastructure and tie them to an Earth/inertial frame. We ask which measurements make a surface station's absolute position observable, and prove the answer. In a snapshot batch fit, the internal observables (station-to-satellite and inter-satellite ranging plus clock-sync) constrain only relative geometry and leave a six-dimensional rigid-body datum defect: three translations and three rotations of the cluster. The clocks are fully observable, so the defect is purely positional, and closing it needs a tie to the Earth frame. Two such ties exist and are not interchangeable. An indirect tie (Earth-to-satellite ranging through the constellation) reaches the station only when the satellite geometry is rich; a direct tie (an Earth-baseline VLBI delay to the station beacon) fixes it regardless. This gives a conditional design law, not a single number: VLBI restores absolute observability when the constellation cannot supply it, and merely sharpens the bound when it can. For a sparse three-satellite constellation the station lies in the null space of the Fisher information until VLBI is added, reaching a Cramer-Rao bound of 20.1 m; for a rich six-satellite constellation VLBI tightens the bound from 23.2 m to 9.7 m. A single-epoch baseline informs at most two of three axes, so the datum closes at three non-collinear Earth stations. The Gauss-Newton estimator attains the bound (efficiency 1.02), with a 91x median station-error improvement in the sparse regime. The FIM/CRLB engine is validated against NumPy and published closed forms; the lunar application stays modelled, every figure deterministic and reproducible.

View free PDFSource page

Related papers

arxivmath.OCcs.LGeess.SY2026-07-21

Equilibrium Causal Games: Separation, Identification, and the Identifiability of Cyclic Latent States

Faraz Dadgostari, Neda Nazemi

Power grids, markets, and interacting populations, settle into feedback driven equilibria observed through unknown sensors. Our Equilibrium Causal Game (ECG) joins a game to its cyclic causal model, hidden inputs, sensor map, and rules for interventions and equilibrium selection;…

View free PDFSource page
arxiveess.SPeess.SY2026-07-23

Noncoherent Detection and Interference Nulling for Terrestrial-Satellite Downlinz Coexistence in the Upper Mid-Band

Shizhen Jia, C. Nicolas Barati, Marco Mezzavilla, Sundeep Rangan

Terrestrial--satellite coexistence in the upper mid-band is challenging when a terrestrial base station has limited prior information about non-terrestrial receivers and their uplink transmissions. This paper studies noncoherent victim sensing and interference nulling, where upli…

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

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
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