Papers for

indoor robot navigation teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Memory aware management keeps dense maps on small robots working

Memory-Aware Keyframe Management for Dense Maps on Memory-Constrained Robots

Abstract: Running a language model and a dense 3D map on one device means the two share one memory, and exceeding its limit is an out-of-memory failure. Map systems that keep a bounded working set bound it by a count of keyframes, but the memory one keyframe occupies varies widely with what it carries, so a count does not control what the working set occupies. The unit of admission is as poorly matched, since a radius around the pose, a fixed cell, or the graph neighbors of the last matched keyframe all move parts of the map that are not needed. We therefore propose two decisions. First, the memory the resident map uses is bounded directly, and the cost of every admission is known before any data is read, from per-keyframe resident sizes computed offline and carried with the map. Second, keyframes are admitted and released at a semantic spatial unit, the rooms and corridors of the building, so that the robot holds the zone it occupies together with the zone it is about to enter while the zones it has passed are released. Every admission measures the resident total, makes room, and only then reads, so the budget is never overshot. On two NVIDIA Jetson boards the budget holds in every run and the model gives up at most 0.8 percent of its throughput, whereas without it the operating system kills the model or the map. Under that budget, and over the environments evaluated, admission by semantic zone localizes 6-9 points more of the query frames than a geometric partition of matched zone count and about twice as much as the retrieval of RTAB-Map, at a lower ATE. Bounding memory lets the map and the model coexist, and moving the map in semantic zones makes the bounded map usable.

Sat 24 OctRobotics
The gist
When small robots try to run both a language model and keep a detailed 3D map, they can run out of memory because both use the same storage space. The authors propose a way to carefully control how much memory the map uses by limiting it directly instead of just limiting the number of map snapshots, which can vary greatly in size. They group map information by meaningful spaces like rooms and corridors, keeping only the areas the robot is in or about to enter. This lets the robot avoid crashes and still localize itself more accurately compared to other methods.
Open → 2610.33574v1

Cooperative robots improve scene understanding with shared maps

CoRef-GS: Cooperative Referring Gaussian Splatting for Multi-Agent Scene Understanding

Abstract: Referring scene understanding for embodied robots requires grounding object- and relation-centric language queries from a designated viewpoint. While a local semantic Gaussian map can support such grounding within one agent's observations, cooperative settings require this ability to remain effective after independently reconstructed maps are aligned and fused. In this setting, the referred target or its contextual landmark may come from another agent's observations, while spatial relations must still be interpreted from the querying robot's viewpoint. We formulate this problem as cooperative referring Gaussian grounding over fused maps, which requires geometric alignability, instance-level semantic comparability, and view-conditioned relation reasoning. Existing language-aware Gaussian methods mainly focus on single-map querying, whereas Gaussian registration methods optimize geometric or photometric alignment without preserving language-grounding-oriented semantic compatibility. We propose CoRef-GS, a cooperative referring Gaussian splatting framework. CoRef-GS constructs local open-vocabulary instance-aware Gaussian maps, then aligns partially overlapping maps with a cross-agent alignment module by geometric and semantic consistency, and grounds queries using a view-conditioned mask relation graph. We further introduce CoQuad-Ref, a dual-quadruped benchmark spanning both real-world and simulated indoor scenes. Experiments show that, on simulated scenes, CoRef-GS reduces the rotation error from 2.58° after coarse initialization to 0.15° after refinement, and improves real-world referring mIoU over ReferSplat from 52.6% to 68.8%. The established benchmark and source code will be publicly released at https://github.com/ruojiruoli17/CoRef-GS.git.

Thu 17 SeptRoboticsComputer Vision and Pattern Recognition
The gist
Robots often need to find objects and understand their surroundings using language, but it’s tricky when multiple robots combine their separate views. The authors designed a system that helps robots share and align their 3D maps so they can understand language referring to objects seen by different robots. Their method improves alignment accuracy and object identification when robots work together. They also created a new test set with two four-legged robots to evaluate their system in both simulated and real settings.
Open → 2609.20586v1