- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a new task setting, relational ObjectNav, and designs a navigation framework built around future relation graph prediction and goal graph matching. The authors validate the effectiveness of the framework through a newly constructed relational benchmark, comparisons with state-of-the-art methods, module ablations, and experiments on different relation types.
Critical strengths
- The relational ObjectNav setting addresses a meaningful problem. The paper extends conventional ObjectNav from "finding any instance of a given category" to "finding a specific instance that satisfies relational constraints". This setting is closer to the needs of real-world language-guided navigation, and it also makes relational reasoning a necessary capability.
- The method fits the task well, and the experimental results support its effectiveness. RWMNav designs a complete pipeline around the relational goal, future relation prediction, and goal graph matching, and outperforms existing methods on multiple benchmarks. The ablation study also shows that these relational modeling components make a clear contribution to performance.
Critical weaknesses
- The core pipeline mainly combines existing techniques, including scene graph reasoning, VLM-based future state prediction, and frontier selection, and applies them to relational ObjectNav. Within this framework, the future relation graph appears to be a natural extension of existing representations rather than a fundamentally new world-modeling or planning mechanism. Furthermore, the novelty of the task setting itself is also limited. Although the specific task formulation differs from prior work, related navigation studies, such as HRON and SOON, have already explored finding specific object instances using language and relational constraints. Therefore, the paper's contributions in terms of both task formulation and methodological design remain relatively limited.
- This paper shows that having future relational reasoning is better than removing the module entirely, but it lacks a direct comparison with simpler future value prediction or with direct VLM frontier scoring. It therefore remains unclear whether the performance gain actually comes from representing the future as a graph, or from the relational goal itself together with stronger adaptation to the task.
Questions for authors
- How were the existing category-level ObjectNav methods adapted to the relational setting of this paper? In particular, how do they handle the relational instructions, target-instance determination, and the stopping condition? The answer to this question will directly affect my assessment of the fairness of the SOTA comparison.
- How much additional benefit does explicitly constructing the future relation graph actually bring compared with simpler future prediction? For example, using the same VLM, the same relational instruction, and the current environment context, what would the performance be if the VLM directly scored the candidate frontiers, without constructing and matching a future relation graph? This comparison will directly affect my assessment of the contribution of the core method.
W1: Novelty of RWMNav’s task formulation and methodology
Thank you for the comment. HRON and SOON study navigation to instances specified by relational or linguistic descriptions. Building on this work, we ask a more specific question: what environmental information should an agent predict to guide exploration when the target and its reference objects have not yet been sufficiently observed?
We develop a geometrically verifiable evaluation protocol for compositional relational navigation. It links linguistic relational constraints to a unique target instance in the 3D scene and enables consistent evaluation across HM3D and MP3D. It assesses whether an agent finds the instance satisfying these relations.
To our knowledge, RWMNav is the first framework for object-instance navigation with compositional relational goals that combines frontier-conditioned future relation graph prediction with relational goal graph matching to select exploration directions, without requiring task-specific navigation training. Although HRON and SOON study navigation to relationally specified targets, their learned navigation methods do not use this per-frontier prediction and matching mechanism. RWMNav uses a frozen vision-language model to predict potential entities and relations beyond each candidate frontier, then ranks directions by the compatibility of predicted configurations with the relational goal. Thus, even when two directions may contain potential targets of the same category, the agent can distinguish them based on the predicted relations between those targets and their reference entities.
W2: Do future relation graphs offer additional benefits over simpler prediction and direct VLM frontier scoring?
Thank you for the suggestion. We have added a comparison with direct VLM frontier scoring. Both methods use the same VLM (Qwen2.5-VL-Instruct), relational goals, current environmental context, and task adaptation procedure. The direct scoring variant replaces future relation graph construction and matching with direct VLM estimates of the expected value of exploring each candidate frontier for achieving the goal.
Compared with direct scoring, RWMNav improves RSR and RSPL by 10.9 and 6.6 percentage points, respectively. The comparison shows that the additional gains come from explicitly representing future states as relation graphs and matching them to the relational goal graph to guide exploration. We will include these results in the revised manuscript.
Q1: How are category-level ObjectNav baselines adapted for relational instructions, target instance selection, and STOP decisions?
Thank you for pointing this out. All baselines receive the same relational instructions and retain their original exploration strategies. Interfaces that accept only object categories use the target category for search, while those supporting full language input use the complete instruction. A shared verifier checks all relational constraints. Thus, although the methods differ in how they explore, they use the same criteria to verify the intended target instance.
When a candidate target is detected, the verifier uses actual observations to check whether all relations hold for the same target instance under a consistent assignment of reference objects. The agent continues exploring if the evidence is insufficient. It stops only after relational verification succeeds and the minimum Euclidean distance from its horizontal position to the horizontal footprint of the target’s bounding box is at most 0.2 m. Ground truth target annotations are used only for offline data generation and evaluation, and do not inform online navigation decisions. This prevents the original category-based stopping rules from introducing an additional source of bias while preserving each method’s exploration strategy.
Q2: How much does explicit future relation graph modeling improve performance over direct VLM frontier scoring?
Thank you for the suggestion. We compare the two methods using the same VLM, full relational instructions, and current environmental context, while keeping the task adaptation procedure unchanged. Direct VLM scoring without constructing or matching future relation graphs achieves an RSR of 50.1 and an RSPL of 23.7, compared with 61.0 and 30.3 for the full RWMNav. Explicitly predicting future relation graphs and matching them to the goal graph therefore improves RSR and RSPL by 10.9 and 6.6 percentage points, respectively, over direct scoring. These gains reflect higher navigation success and better path efficiency for relational goals.
If our response addresses your concerns, we would be grateful if you could consider revising your score upward. Thank you again for your time and consideration.