What does a simulator tuned on one-step odometry noise get wrong about drift, relocalisation and loop closure?
research/odometry-twin
A twin tuned on one-step odometry noise cannot see drift: variance ratio exactly 1+(T−1)ρ, relocalisation interval 3.4× too long (real miss 51.6% vs 5%), twin-tuned loop-closure gate recall 0.64 at T=200, closed-loop runaway, aliasing limits calibrated gates.
What it found
A traversal has a persistent bias plus white noise, so real error after T steps has variance σ12(ρT2+(1−ρ)T); a twin fitted to one-step increments, identical for every ρ, predicts σ12T and is off by exactly 1+(T−1)ρ. With 5% of step variance persistent, the twin’s relocalisation interval is 3.4× too long (real miss probability 51.6% against a claimed 5%), and a 3σ loop-closure gate tuned in it accepts true closures with probability 0.64 at T = 200 instead of 0.997; in a closed loop the rejections let error run away (RMS 8.8 m against 0.17 m calibrated). A calibrated gate accepts 97–99% of aliased closures once drift uncertainty exceeds the alias offset, and a variance ratio fitted at one loop length does not transfer to others. Stylised: 1-D Gaussian, assumed one-step-fitted twin, no real odometry data.
A figure from its own output
Paper, code and results
More in Digital twins & sim-to-real
- How wrong is a safety margin certified in a Gaussian-disturbance simulator when real gusts are heavy-tailed?A corridor-keeping safety margin certified in a Gaussian-disturbance twin: same variance, heavy-tailed real gusts give 0.29 real failure at a claimed 0.01, needed margin 7.3× at
δ=0.001 (ν=3), variance inflation misses by 24×, conformal needsn≥1/δ, a Hill tail fit from one-step data repairs it. - How wrong is the thinnest obstacle a lidar twin certifies as detectable when real beam dropout is clustered?A lidar twin with i.i.d. beam dropout certifies the thinnest detectable obstacle: real clustered dropout (same rate, lag-1 correlation 0.6) misses 41× more at the certified width and the range claim is 4× too long (exact Markov miss law,
p·q^(m−1)); a fitted persistence recovers the median width but needs a margin. - Can a digital twin shorten a real-world safety certification?Can a twin shorten a real-world safety certification? Worst-case size of any
k ≤ crule is exactlyP(Bin(n,ε) ≤ c), so a twin prior cannot cut real trials at a fixed level (299 exact zero-failure trials; twin prior reaches 133 only at size 0.26); wrong twins inflate size or block certification. - How optimistic is the cost a planner quotes from its own twin rollouts?The cost a planner quotes from its own twin rollouts is optimistic by exactly
e_K·s(winner's curse; 95% intervals cover 60% at K=20), fresh rollouts fix the sampling part at a selection-quality price, but not the twin's own model error−e_K τ²/√(τ²+s²). - How many retries does a grasp need when the simulator treats attempts as independent?How many retries a grasp needs when the twin treats attempts as independent: exact Beta-mixture failure law (power law
k^{−a}vs geometric), twin budget 6 claims 0.004 and delivers 0.010–0.151, real budget 7–571, closed-form give-up rule, and a two-attempts-per-object repair that still needs a margin. - How optimistic is the best of K controllers chosen in a noisy digital twin?The best of K controllers picked in a noisy twin: winner's claim optimistic by exactly
τ²c_K/√(v²+τ²)(c_K=E max of K normals), under a fixed rollout budget more candidates can make the deployed one worse (best K=5–22), an exact-plant LQ twin's claim falls below what any gain can achieve, and screen-then-verify cuts claim bias 4.5×.
All 164 Digital twins & sim-to-real projects →
Other research topics
Proper scoring & elicitation28Effort & peer prediction9Verification games & slashing19Detection & tolerances14Markets as routers13Prediction-market design9Paying contributors8Decentralised training systems23Digital twins & sim-to-real164LLM chip design loops40Robot manufacturing loops53Ambient AI assistant46Self-replicating manufacturing34Simulation-first design64Engineered clothing45Task-specific AI accelerators40Algorithmic chip-design loops42Open-source purpose-built robots44The software-engineering loop43Adversarial human imitation41Open-source residential construction41Autonomous multi-angle capture34Sensing, imaging and 3D31Energy supply and dense energy storage39Robot societies among people31Agentic co-design of low-cost robots27Laundry-hanging robots25Machine learning on qualitative data23Robots on the building site27Civilizations & group psychology1History & human sciences1
Produced with AI assistance (Claude). Results are from the code in this repository and are simulated or stylised unless the abstract says otherwise; nothing here implies affiliation with or endorsement by any lab, researcher or company cited. MIT licensed.