Overview
The opening figure shows the two-robot hardware arrangement and complete original map comparisons, restored from the PDF.
At a glance
RAMEN learns decentralized neural scene maps when neighboring agents exchange updates intermittently. A weighted consensus optimizer favors feature-grid parameters with more reconstruction updates, reducing the influence of poorly observed regions in stale neighbor models. Dataset experiments show better reconstruction than the tested distributed baselines under message loss, and two physical robots share maps every thirty seconds. The implementation assumes known camera poses and uses external computers; it is a mapping study rather than a complete autonomous localization-and-exploration system.
I Introduction
Sharing neural map parameters can spread observations without transmitting all raw images between mapping agents, but stale parameters can damage consensus optimization. RAMEN assigns reliability weights per feature-grid parameter instead of pausing every agent until fresh messages arrive. The goal is to retain useful older information while reducing influence from poorly learned regions. The experiments test finite delays and disruptions, not guaranteed agreement under permanent disconnection.
II Related Works
The scene representation builds on Co-SLAM [24] and multiresolution neural grids. Existing distributed neural-mapping methods, including DiNNO [13], motivate consensus optimization and provide baselines. Parameter-frequency weighting offers a low-cost alternative to ensembles or Bayesian uncertainty models, with less expressive uncertainty estimates.
The paper primarily studies message drops, with heterogeneous computation also present in the hardware demonstration. Its advantages are established against the selected optimizer implementations, not every asynchronous distributed-learning algorithm.
III Preliminaries
The preliminaries introduce the neural map and the synchronous decentralized optimization problem before deriving the weighted variant.
III-A Single-agent Neural Implicit Mapping
A multiresolution hash grid [38] encodes spatial features. Geometry and color decoders predict signed distance and color, from which RGB and depth images are rendered along known camera rays. Reconstruction losses supervise observed color, depth, signed distance, free space, and geometric smoothness.
RAMEN later fixes the decoders and optimizes the feature grid only. Thus these equations describe the underlying representation, while the actual distributed parameters differ from a fully trainable Co-SLAM model.
Equations 1–5
| (1) |
| (2) |
| (3a) | |||
| (3b) | |||
| (4) |
| (5) |
III-B Synchronous Multi-agent Mapping
Each robot minimizes reconstruction loss on its posed RGBD images while matching neighboring parameter vectors. Auxiliary edge variables and dual variables express local consensus without a central fusion variable. Alternating-direction optimization [42] yields primal map updates and dual disagreement updates; in practice, a few stochastic-gradient steps approximate each primal minimization.
The synchronous formulation assumes current neighbor states are available. An old copy can conflict with newly observed geometry, motivating per-parameter weighting rather than indiscriminate agreement.
Equations 6–9b
| (6) |
| (7a) | ||||
| (7b) | ||||
| (8) |
| (9a) | ||||
| (9b) | ||||
IV Asynchronous Multi-agent Neural Implicit Mapping
The proposed method combines a weighted decentralized optimizer with an update-frequency reliability heuristic. It permits local mapping to continue when neighbor updates are missing.
IV-A Uncertainty-Weighted Decentralized C-ADMM
Each edge assigns diagonal weights to the two agents’ parameter vectors. The auxiliary consensus target becomes their reliability-weighted average; primal and dual updates penalize departure from that target. This allows a robot to retain information from a neighbor about regions it has not itself visited, while reducing influence from weakly updated neighbor parameters.
The retained derivation gives the weighted update rules. It is not a convergence proof for arbitrary nonconvex neural maps, stochastic approximate solves, time-varying weights, or unbounded message loss. Those behaviors are evaluated empirically in the reported settings.
Equations 10–14
| (10) |
| (11) |
| (12a) | ||||
| (12b) | ||||
| (13a) | ||||
| (13b) | ||||
| (14) |

Equations 15–17
| (15) |
| (16) |
| (17) |

IV-B Frequency-based Epistemic Uncertainty
The reliability statistic counts nonzero reconstruction-gradient updates for each grid parameter. More updates are interpreted as better observation coverage and lower uncertainty. The geometry and color decoders are pretrained on the NICE-SLAM apartment data and frozen, avoiding the harder problem of assigning spatial reliability to shared decoder weights. Agents also share the same map initialization.
Neighbor count vectors are jointly scaled into user-selected lower and upper weight bounds, preserving their relative magnitudes. This is a frequency heuristic, not a calibrated posterior variance. Old neighbor counts lag behind continued local learning; the stated equation does not separately estimate uncertainty from elapsed wall-clock age. Replayed observations can add updates without supplying independent new viewpoints.
Algorithm 1 retains the complete capture, communication, local-gradient, dual-update, and reliability-update loop. Only feature-grid parameters and their statistics enter the consensus exchange.
Equation 18
| (18) |
Equations 19a–19d
| (19a) | |||
| (19b) | |||
| (19c) | |||
| (19d) | |||
V Results
Evaluation uses posed RGBD streams from synthetic Replica and real ScanNet scenes, simulated communication disruption, and a two-robot experiment. Meshes are extracted from the learned fields. “Artifacts” measures reconstructed-to-reference distance, while “holes” measures reference-to-reconstructed distance. Completion uses a five-centimetre proximity threshold; the paper’s wording about which point set defines its percentage is imprecise, so the original metric label and reported numbers are retained rather than silently redefining it.
| Method | Metric | office1 | room1 | scene0000 | scene0106 | Avg. |
| DSGD | Artifacts (cm) | 6.381.76 | 16.390.45 | 14.590.57 | 100.405.02 | 34.341.95 |
| Holes (cm) | 2.700.20 | 2.550.02 | 5.030.16 | 6.350.44 | 4.200.21 | |
| Completion Ratio (%) | 87.210.96 | 90.560.22 | 74.340.82 | 65.011.61 | 79.030.90 | |
| DSGT | Artifacts (cm) | 20.768.31 | 17.661.92 | N/A | N/A | N/A |
| Holes (cm) | 9.096.28 | 2.580.05 | N/A | N/A | N/A | |
| Completion Ratio (%) | 56.471.30 | 90.690.41 | N/A | N/A | N/A | |
| DiNNO | Artifacts (cm) | 2.780.34 | 5.781.50 | 7.562.62 | 61.297.41 | 19.352.97 |
| Holes (cm) | 2.790.22 | 2.330.22 | 4.100.39 | 5.730.82 | 3.740.41 | |
| Completion Ratio (%) | 85.902.55 | 91.451.99 | 79.753.71 | 64.735.94 | 80.463.55 | |
| RAMEN (ours) | Artifacts (cm) | 3.250.35 | 5.470.97 | 5.550.35 | 37.671.64 | 12.980.83 |
| Holes (cm) | 1.780.04 | 2.010.03 | 3.230.08 | 3.280.11 | 2.570.07 | |
| Completion Ratio (%) | 94.370.27 | 94.200.32 | 90.720.84 | 86.480.64 | 91.440.52 |




V-A Simulated Experiments
With three agents, a fully connected graph, and 50% message success, the four-scene average completion ratio is 91.44% for RAMEN versus 80.46% for DiNNO. Average artifact distance is 12.98 versus 19.35 cm, and hole distance 2.57 versus 3.74 cm. The reported runs generally show smaller variability, though DiNNO has fewer artifacts in the office1 scene. The results are means over the stated repeated agent/trial evaluations.
On a separate scene, decreasing message success from 100% to 20% degrades both methods, with RAMEN retaining more scene structure and better metrics. A chain-connected experiment with four, five, and six agents shows improved completion as more observations become available. It tests a small range of agents and one scene, not large-team or arbitrary-network scaling.
In a representative three-agent RTX 4090 experiment, RAMEN runs at 8.58 frames per second versus 9.38 for DiNNO. Reliability handling has a measurable overhead despite its reconstruction benefit; these timings differ from the physical system’s mapping rate.

V-B Real-World Hardware Experiments
Two manually driven Turtlebots each observe roughly half a scene. Vicon supplies poses, and each robot streams images and poses over WiFi to its own external computer. Mapping runs around one update per second, while the computers exchange neural maps every thirty seconds, reported as a 3.33% communication rate relative to mapping updates. This sparse periodic exchange is different from directly measuring a 3.33% packet-delivery probability.
RAMEN completion scores are 78.47% and 69.66% for the two robots, compared with 63.07% and 39.83% for DiNNO. Artifact distances are 6.50 and 5.87 cm versus 26.43 and 10.76 cm. The reference called ground truth is itself a reconstruction made with one robot and four times as many images, rather than an independent metrology-grade scene mesh. No repeated hardware-trial uncertainty is reported.
The demonstration shows useful map sharing under slow communication and unequal processing speeds. It relies on known poses and human-controlled viewpoints, so it does not establish autonomous exploration, onboard mapping performance, or pose-error robustness.
VI Limitations
Counting updates does not distinguish an easy planar region from fine geometry needing many more observations. Keeping and replaying a large keyframe database limits long-duration mapping and can cause storage pressure. Sensor depth noise limits reconstructed detail. Manual robot control introduces selection bias and reproducibility concerns; autonomous active perception is proposed as future work.
VII Conclusion
Reliability-weighted parameter consensus improves the tested neural maps when communication is intermittent, with evidence from dataset replay and a physical two-robot setup. The results support this implementation under the measured conditions, while calibrated uncertainty, broader scaling, pose estimation, and autonomous data collection remain unresolved.
Acknowledgments
The work acknowledges support from three National Science Foundation awards.