2025 Rss Semrob.github.io Paper5
2025 Rss Semrob.github.io Paper5
Image
Query Water Tower
Radio Tower
Metal Stairs
Time
Red Building
Road Cracks
(3) Fine-Grained
Open-Set Querying Wooden Picnic Tables To
Voxels
Fig. 1: RayFronts is a real-time semantic mapping system that enables fine-grained scene understanding both within and beyond
the depth perception range. Given an example mission through multi-modal queries to locate red buildings & a water tower, RayFronts
enables: (1) Significant search volume reduction for online exploration (as shown by the red and blue cones at the top) and localization
of far-away entities (e.g., the water & radio tower). (2) Online semantic mapping, where prior semantic ray frontiers evolve into semantic
voxels as entities enter the depth perception range (e.g., the red buildings query on the right side). (3) Multi-objective fine-grained open-set
querying supporting various open-set prompts such as “Road Cracks”, “Metal Stairs”, and “Green Dense Canopy”.
Cosine Similarity
Empty Occupied First 3 PCA Features
First 3 PCA Features
RayFronts Text Query Text Query
Frontier Map Ft Semantic Ray Fronts Rt Thick Forest Trash Container
Posed RGBD Frontier Map Semantic Ray Fronts
Low
Frontiers First 3 PCA Features
45#+61*0"3--2$/%072+8'/-9$1*01,
!"#$% &'()*+"%,-."/0"1-2'##0"3 )0"'/-2'# :0%;0"-'"8-<1(+"8-&'"31-
Fig. 2: Overview of our online mapping system, RayFronts is designed for multi-objective & multi-modal open-set querying of both
in-range and beyond-range semantic entities. Given posed RGB-D images, we first extract dense features with our fast language-aligned
image encoder. Then, posed depth information and features are used to construct a semantic voxel map for in-range queries. In parallel,
RayFronts also maintains a VDB-based occupancy map to generate frontiers, which are further associated with multi-directional semantic
rays. These semantic ray fronts enable us to perform beyond-range querying of open-set concepts in the unobserved region.
discretized coordinates into a single voxel. the normalized direction vector, and fr represents semantic
features.
C. Occupancy Mapping for Frontiers and Pruning Associate (Matching Rays to Frontiers): In the presence
To represent occupancy map Ot efficiently, we employ of depth information, rather than keeping rays at the robot’s
OpenVDB [22], recently used in modern 3D frontier-based origin as in [30], we leverage the mapped area to push rays
exploration works [1, 9, 17] for its sparse tree representation closer to their observed entities, improving localization. For
and multi-resolution capability. Following standard practice, each semantic ray (or , dr , fr ), we select a frontier from the
we store log-odds occupancy o j in a signed byte. To better candidate set Ft+1 through a two-step filtering process. First,
tolerate dynamic environments and to avoid overflow, we we prune frontiers by (1) removing those not in front of the ray
limit probocc (o j ) to lower and upper limits. Fig. 2 shows (2) computing the shortest orthogonal distance dortho between
the OpenVDB map with large free voxels showing the multi- the ray and frontiers, discarding those where dortho > b
resolution aspect of the occupancy representation. (exceeding the frontier grid cell size), and (3) calculating the
Pruning Semantic Voxels: When accumulating voxels over distance from ray origin or to frontier origin p, obtaining dorig
long distances and time periods, odometry drifts and dynamic and removing frontiers where dorig > 4 ⇥ depth range.
objects can introduce inconsistencies, not to mention the Next, for the remaining k candidate frontiers, we compute
growing memory consumption. To mitigate this, we prune a cost function
invalid semantic voxels by querying the occupancy map Ot !
and removing those with occupancy below 0.5. dortho dorig
dcost = + /2, dcost 2 [0, 1]
r
max({dortho }kr=0 ) max({dorig
r }k )
r=0
D. Finding the “Fronts”: Computing 3D Frontiers (1)
We identify frontiers by iterating over all free observed We select the frontier with the minimum dcost as the best
voxels using efficient OpenVDB iterators and examining their match. We qualitatively find that utilizing both dortho and dorig
neighbors. A voxel is considered a frontier if its neighbors improves results and prevents distant frontiers from receiving
meet the minimum thresholds for unobserved (minunobsrv ), noisy semantics.
occupied (minocc ), and free (min f ree ) counts, allowing us to For further refinement, we optionally apply ray tracing,
emphasize frontiers near surfaces or open space as needed. To marching each ray through the occupancy map Ot+1 until
reduce density, we subsample the frontier map using a coarser it reaches its assigned frontier or encounters occupied or
voxel grid of size b . Fine-grid frontiers are accumulated into unobserved (possibly occupied) cells. At this stage, each
a coarser grid, and cells with enough frontiers remain as semantic ray is associated with a frontier, updating its origin
frontiers. (or ) to the corresponding frontier origin p. Since we lack depth
information about the underlying semantic entity, we maintain
E. Semantic Ray Frontiers for Beyond-Depth Mapping the ray’s direction dr when shifting its origin.
Need for richer frontiers: Existing semantic frontier meth- Discretize and Accumulate (“Ray Binning”): Similar
ods have fundamentally constrained beyond-range semantic to voxelization techniques, we organize semantic rays into
encoding, where only a single object can be pursued at a angle bins with a resolution of y degrees. The normalized
time due to feature collisions from distinct objects observed ray directions dr are converted to spherical angles using:
through the same frontier. To enable multi-object semantic qr = atan2(dr1 , dr0 ), fr = acos(dr2 ) where atan2 is the four-
guidance for search and exploration, we transition from con- quadrant inverse tangent. We then discretize these angles and
ventional semantic frontiers Fsem = {(pk , fk )}Fk=1 to semantic merge rays that correspond to the same frontier and the same
ray frontiers Rsem = {(or , qr , fr , fr )}Rr=1 , where or is ray angle bin from both the local update Rtlocal and the global set
origin, qr 2 [ p, p) and fr 2 [0, p) are azimuthal and zenith Rt . We use 1 dcost for weighing the features while merging,
angles, and fr are semantic features. This shift drastically assigning lower trust to high-cost associations. This yields the
enhances the mapping system by allowing efficient storage of updated ray-frontier Rt+1 .
rich multi-object semantics with minimal feature collisions, Pushing the ray fronts onward: Semantic ray frontiers
enabling rough triangulation of object locations, and reducing must be updated as new areas are mapped. After computing
the search space volume needed for exploration. We discuss the frontier update Ft+1 , we use a voxel grid to perform a set
the ray mapping process (observe, associate, discretize & intersection between all ray origins and frontier origins, similar
accumulate) and how rays are pruned and propagated below. to pruning voxels, and remove rays no longer associated
Observe: To identify out-of-range regions in the feature with active frontiers. If ray tracing is enabled, removed rays
map Ft we compute a boolean mask Mt 2 RH⇥W from the are added back to the ray accumulation buffer to be re-
depth Dt (obtained via stereo, LiDAR, or monocular depth es- cast in the next iteration. This preserves previously observed
timation). The mask encompasses either +• values from depth semantics that may no longer be directly visible as the frontier
sensors or far low-certainty values. Mt is eroded to prevent shifts (e.g., from a side view). However, without ray tracing,
Scene Bound • Semantic Poses (Sem Pose): Emulates EPG [30] by using
Unmapped Region
Mapped global encoding for the image, resulting in a single ray
Search volume
Region per frame located at the robot origin.
• Semantic Voxels (Sem Voxels): Subsumes representa-
Traditional
Object of
Interest
tions that encode only within-range semantics [32, 14, 8].
Semantic • Semantic Frontiers: Emulates in 3D the 2D approaches
Segmentation different semantic
mapping capability that paint frontiers with semantics [36, 4]. We recog-
nize that there are two ways semantic frontiers can be
Search Volume Recall Search Cut Volume (SCV) interpreted; (1) As a spherical region encompassing the
semantic entity (i.e Spherical Sem Fronts), or (2) as a
* =
Search Cut
Volume Recall single ray pointing away from the observed region (i.e
TP Added to allow (SCVR) Unidirectional Sem Fronts). We evaluate both.
SCV to be 1 for
perfect prediction We define search volume as the unmapped region unless
Fig. 3: An illustration of our proposed planner-agnostic metric further evidence is provided. Ray-based approaches cast search
(Search Cut Volume Recall) for open-world online search bench- cones while Spherical Sem Fronts define a sphere volume
marking. Intuitively, the metric captures “How much of the search extending to the nearest frontier. Multiple search volumes
volume is eliminated correctly?” An optimal mapper should promptly are summed in a voxel grid, counts are normalized, and
and accurately reduce the search space, enabling fast multi-object
thresholded at 0.05 to get the final search volume for a
localization and exploration.
class. For Unidirectional Sem Fronts, frontier directions are
inferred using the occupancy map Ot by computing a weighted
combination of all directions around a frontier in a 3x3x3
removed rays would continue to propagate indefinitely, so we
window where mapped voxels have a weight of -1 (Pushing
disable the behavior under that setting. In our experiments, we
away) and unmapped voxels have a weight of +1 (Pulling
use ray tracing unless otherwise stated.
toward).
Evaluation Protocol: We ask the question “Can an online
IV. E XPERIMENTAL S ETUP semantic mapping system’s utility for search and exploration
A good online mapping system should (1) intelligently be assessed independently of specific planners ?” Yes, the
guide the robot toward regions of interest in any environment, key is examining how accurately and efficiently the map
eliminating irrelevant volumes early, (2) accurately capture constrains the search space. Traditional mapping metrics such
fine-grained open-set semantics within a metric map, and (3) as mIoU, mAcc, F1 measure fine-grained semantic localization
do so efficiently. In this section, we first introduce our pro- but overlook search volume efficiency, as they ignore true
posed online mapping evaluation framework, which assesses negatives. In search and exploration, a high true negative
the utility of a mapping system in guiding exploration with- rate in the unobserved region reduces wasted search time.
out a planner in-the-loop, and introduce competitive baseline Therefore, for beyond-range search volume estimation, we
representations. We then present our extensive offline map introduce a novel metric below, and to evaluate within-range
evaluation following established protocols. Finally, we conduct fine-grained online performance, we use the area under the
a deployability and throughput analysis. mIoU-time curve.
Search Cut Volume Recall Metric: Our proposed metric,
A. Planner-Agnostic Online Semantic Mapping Evaluation shown in Figure 3, measures how accurately and efficiently a
mapping system cuts search volume. The intuitive definition is
Dataset: Originally designed to challenge visual SLAM to compute total unmapped volume volunmapped and subtract
with large, cluttered, long-tail objects in indoor and the search volume from it, however to avoid punishing true
outdoor environments, TartanAirV2[31] serves as a stress positives, we define search cut volume (SCV) as:
test for our representation. To simulate scenarios with
FPunmapped
severely limited depth, we choose four large outdoor scenes SCV = 1 , SCV 2 [0, 1] (2)
AbandonedCableday, Factory, Downtown and volunmapped
ConstructionSiteOvercast where bounding boxes To temper the metric against incorrectly cutting down volume,
span approximately 8 million m3 with a 50m range cutoff. We we compute Recall in the unmapped region and multiply it
generate ground truth occupancy (defining the scene volume) with SCV yielding the Search Cut Volume Recall (SCVR)
and a semantic label map at 1-meter voxel resolution from metric:
the provided posed RGBD input. T Punmapped
Baselines: There are no established online mapping baselines SCV R = SCV ⇤ , SCV R 2 [0, 1]
FNunmapped + T Punmapped
for 3D open-world environments. Therefore, we take inspira- (3)
tion from existing works and design the following baselines, The SCVR metric is robust to both naive cases (1) not
keeping the encoder fixed to isolate the impact of our mapping constraining the search volume, or (2) constraining it to 0
approach: volume, yielding 0 for both. For an aggregate, we compute
TABLE I: Online & Unbounded Semantic Mapping Benchmarking on TartanAirV2 [31]. Ranking shown as first , second , and third .
0m Depth (AUC) " 10m Depth (AUC) " 20m Depth (AUC) "
Methods mIoU(%) SCV(%) Recall(%) SCVR(%) mIoU(%) SCV(%) Recall(%) SCVR(%) mIoU(%) SCV(%) Recall(%) SCVR(%)
Sem Poses 0.00 11.37 91.91 4.02 – – – – – – – –
Sem Voxels – – – – 20.49 0.00 100.00 0.00 13.03 0.00 100.00 0.00
Spherical Sem Fronts – – – – 20.49 18.00 82.35 0.40 13.03 13.33 87.02 0.41
Unidirectional Sem Fronts – – – – 20.49 16.12 85.93 3.15 13.03 11.58 89.54 2.07
RayFronts (Ours) 0.00 36.59 75.37 16.27 20.49 22.94 81.15 7.08 13.03 14.32 88.69 4.56
the area under the SCVR-time curve, stopping time for each ranges. Sem Poses fails to capture any fine-grained reconstruc-
class when 50% of it has entered the mapped region. To further tions scoring 0 mIoU-AUC, while Sem Voxels fails to provide
assess the robustness of RayFronts, we vary depth sensing any information about the unmapped region scoring 0 SCVR-
range at 0m, 10m, and 20m. AUC. At 0 depth range, RayFronts attaches dense semantic
rays at each pose as opposed to the global encoding scheme
B. Offline 3D Open-Vocabulary Semantic Segmentation employed by Sem Poses. This allows us to encode non-
Datasets: We follow prior work [14, 8, 32] and evalu- prominent objects seamlessly and results in a ⇠ 4⇥ SCVR-
ate on Replica (office[0-4], room[0-2]) and ScanNet AUC than Sem Poses. This observation is illustrated in Fig. 4
(scene[0011,0050,0231,0378,0518]). In line with where for a simple prominent object such as “building”, both
previous protocols, we report results while ignoring back- Sem Poses and RayFronts perform similarly. However,
ground classes (“floor”, “wall”, “ceiling”, “door”, “window”). for a more distant object like “chimney”, Sem Poses fails
However, we additionally evaluate across all classes to demon- to capture its semantics entirely. At higher depth ranges, we
strate our ability to handle background seamlessly. More- observe that RayFronts consistently outperforms semantic
over, to showcase RayFronts’s effectiveness in outdoor, frontier baselines at ⇠ 2.2⇥ the SCVR-AUC. We attribute this
unstructured, “in-the-wild” environments, we further evaluate to (1) less semantic collisions as distinct objects are unlikely to
on the TartanAirV2 [31] scenes referenced in IV-A excluding be fused in the same ray unlike semantic frontiers which can
methods that cannot function outdoors. have many collisions, (2) better preservation of the angle at
Baselines: We compare our method with two categories of which the semantic entity was observed from, and (3) allowing
approaches: (1) vision-language representations that create 3D each frontier to have multiple rays attached, increasing the
semantic maps, namely, ConceptFusion [14], ConceptGraphs density of beyond-range semantics. RayFronts is superior
[8], and HOV-SG[32]; and (2) zero-shot semantic segmen- to all baselines across depth ranges empowering both fine-
tation encoders, namely, NACLIP[10] and Trident[28]. We grained localization and beyond-range guidance.
extend the latter encoder-based methods to 3D using the same B. Offline 3D Semantic Segmentation
projection and fusion method as our system.
Evaluation Protocol: We follow standard open-vocabulary Table II provides a detailed comparison of the performance
semantic segmentation evaluation protocols. We generate 3D between our framework and other zero-shot approaches, out-
segmentations by running HOV-SG and ConceptGraph code lined in Section IV-B. RayFronts consistently outperforms
ensuring an accurate representation of their scene graph the baselines in mIoU, and achieves SOTA performance
method. For all others, we generate segmentations by com- beating the next best baselines by +18.07% and +9.63% mIoU
puting the cosine similarity between the embedded feature and on Replica and Scannet, respectively, excluding background.
the class-name text embedding, making a voxel prediction if RayFronts is also able to handle background seamlessly
its softmax probability exceeds 0.1. We encode class names with its single-forward pass approach while segment-and-
using each method’s specified templates. For our approach, encode approaches fall short.
we follow NACLIP and use 80 templates [10], with a prompt For outdoor in-the-wild performance on TartanAirV2, Ta-
denoising [38] threhsold of 0.5 to suppress irrelevant classes. ble III shows that RayFronts exceeds the performance of
We also apply k-NN matching (k=5) following HOV-SG [32] the baselines by 3.36% mIoU. While Trident-3D serves as a
protocol, assigning each GT voxel the majority label. All close second to our approach and achieves a slightly higher
baselines use the ViT-L model architecture for consistency. f-mIoU on TartanAirV2 by a marginal 0.13%, it does so at
We resize images to 480x640, apply a frame skip of 10, 5cm the cost of integrating multiple foundational models into their
voxels for Replica and ScanNet and 1m voxels for TartanAir. pipeline, which significantly reduces efficiency—an essential
factor for online semantic mapping.
V. R ESULTS & D ISCUSSION
C. Encoder & Mapping Throughput Analysis
A. Online Semantic Mapping To assess deployability, we run RayFronts on an NVIDIA
Table I summarizes online performance of the five meth- Jetson AGX Orin and perform a quantitative comparison of
ods in their respective operating ranges. We observe that image encoder throughput shown in Fig. 5. Our mapping
RayFronts excels and is the upper bound across depth system achieves SOTA performance in 3D open-set semantic
20m Depth 0m Depth
RayFronts Spherical Sem Fronts Unidirectional Sem Fronts RayFronts Sem Poses
Building
Chimney
Fig. 4: RayFronts consistently surpasses baselines for online semantic mapping. Two query scenarios are shown: (1) querying for a
prominent object (i.e Building) that enters depth range, and (2) a distant object (i.e Chimney) that remains beyond range. Through unified
dense voxel mapping, and beyond-range semantic ray frontiers, RayFronts sets the upper-bound in both scenarios.
A PPENDIX
RayFronts Spherical Sem Fronts Unidirectional Sem Fronts RayFronts (No-Depth) / Sem Poses
Frontier
Inferred-direction away
from mapped region
Fig. A.1: Top left shows how RayFronts is able to avoid feature collisions through the use of multiple rays that capture distinct semantics
observed through the same frontier, where semantic frontier approaches [4, 36] fail. The top right illustrates that even with no depth
information, RayFronts dense language-aligned encoding can allow it to capture non-prominent semantics where semantic pose approaches
[30] fail. The bottom row highlights that RayFronts is the upper bound in accurately reducing search volume.
Building
Spherical Sem Fronts (20m) Unidirectional Sem Fronts (20m) Sem Poses (0m)
Chimney
Spherical Sem Fronts (20m) Unidirectional Sem Fronts (20m) Sem Poses (0m)
Ground Truth Search Volume Mapped Voxels Activated Voxels Rays Activated Rays
Fig. A.2: Two query scenarios are shown with GT generated at 80m as opposed to 50m cutoff for more clarity: (1) querying for a prominent
object (i.e, Building) that enters depth range, and (2) a distant object (i.e, Chimney) that remains beyond range. Through unified dense voxel
mapping and beyond-range semantic ray frontiers, RayFronts sets the upper bound in both scenarios.
Fig. A.3: Sample visualizations of offline semantic mapping generated by RayFronts for scenes from Replica [29] (room0 and office2),
ScanNet [5](scene0050 and scene00378), and the chosen four scenes from TartanAir [31]. “RGB”, “GT” and “PRED” refer to the RGB
scene reconstruction, Ground Truth semantics, and semantic segmentation prediction by RayFronts, respectively, for each corresponding
scene. RayFronts achieves SOTA mIoU for 3D open-vocabulary semantic segmentation.
Fig. A.4: Examples of long-tail classes segmented by RayFronts across outdoor scenes from TartanAir [31]. We set the voxel size to 0.5
(50cm) for the visualizations. For each set, we present the RGB image, the corresponding 3D reconstructed view, and the classified voxels
left to right respectively. RayFronts effectively segments long-tail concepts.