- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes GhostAnchor Navigation (GA-Nav), a training-free zero-shot ObjectNav framework that uses an execution-updated Node–Ghost Topology Memory (NGTM) for VLM-guided exploration and a Locate–Verify–Ground (LVG) procedure for target approach. Experiments on HM3D v0.1, HM3D v0.2, and MP3D report improved navigation performance, supported by component ablations.
Critical strengths
- Practical framework. GA-Nav presents a relatively complete navigation pipeline, and the reported results demonstrate its practical effectiveness.
- Substantial evaluation. The experiments cover multiple ObjectNav benchmarks and include component ablations, reflecting considerable implementation and experimental effort.
Critical weaknesses
- Insufficient differentiation from existing topological-navigation ideas. Node–Ghost structures, cross-view candidate association, and exploration-state-based decisions have been studied in Neural Topological SLAM, ETPNav, and Frontier-enhanced Topological Memory. The paper does not yet clearly establish whether pose-based Ghost updates and direction filtering provide a sufficiently distinct capability beyond existing state maintenance, failure marking, and backtracking. This distinction should be made more explicit in the Introduction.
- Incomplete evidence for robustness and comparative coverage. Spatial proximity does not necessarily imply the same navigable candidate, and sufficient movement toward a Ghost does not necessarily mean that its direction has been fully explored. Erroneous association or premature reached/failed updates could exclude useful directions, yet the paper lacks corresponding error analysis and threshold sensitivity results. In addition, Table 1 should include more recent zero-shot methods, such as MSGNAV, to strengthen the direct comparison.
Overall, the framework is effective, and the experimental effort is substantial, but stronger evidence is needed to show that its success comes from the proposed central idea rather than an incremental combination of effective components.
Minor presentation suggestions: Figure 2 is dense because it includes six VLM functions and multiple control branches. Figure 3 would be clearer if it explicitly illustrated how Ghost-state changes modify the VLM’s available directions. The figures could be refined accordingly.
Questions for authors
- Novelty of execution-updated control. Relative to prior topological-navigation methods, what fundamentally different decision-making capability does the execution-feedback mechanism provide beyond tracking exploration states, marking failed nodes, and backtracking? What is its incremental contribution in this indoor navigation setting?
- Validity of Ghost state updates. In complex indoor scenes, how does the method prevent spatially close but topologically different candidates from being incorrectly associated? How is it ensured that progress toward a Ghost indicates that the corresponding exploration direction has been completed? Could the authors provide Ghost association accuracy, representative state-update failures, and sensitivity analyses for the key thresholds, particularly cases where valid directions might be prematurely filtered out?
- Coverage of recent baselines. Could the authors include more recent zero-shot ObjectNav methods (e.g., MSGNAV) in the main comparison in Table 1, or explain why such comparisons are unavailable?
5 comments
Q2/W2: Validity of Ghost state updates.
(1) What "reached" means. Our wording in Sec. 3.3 ("made sufficient progress along that direction") caused this concern, and we have rewritten it. "Reached" only ends the current attempt toward one specific candidate waypoint. It does not declare the direction explored, and it never removes a direction from the allowed set. Reached Ghosts are excluded from further association, so they neither block nor absorb new candidates, and the panorama at the new position generates new candidates further ahead. The allowed set shrinks only when:
- (i) a direction matches a failed Ghost, i.e., one with two failed attempts (displacement < 0.25 m, no decrease in distance, or a non-translational action);
- (ii) a Node–Node edge has been traversed at least twice while an unexplored Ghost is visible;
- (iii) a target-memory Ghost is visible (only its direction is kept); or
- (iv) ObserverVLM describes a direction as non-traversable.
When no Ghost direction remains, the agent deterministically backtracks toward the nearest unresolved frontier; if no direction is executable, all six directions are re-opened. Filtering therefore cannot trap the agent.
(2) Is completion premature? The full method makes 7,740 Ghost adjudications, 73.3% of which end as reached. In 88.8% of reached cases, the agent actually came within 0.65 m of the waypoint (86.7% satisfy both the distance and progress conditions, 2.1% only the distance condition); the remaining 11.2% satisfy only the progress condition, i.e., the agent covered at least half of the initial distance. Requiring the agent to get closer before completion (ρ_reach = 0.50 m) brings no improvement (ΔSR −1.2 [−3.6, 1.1], ΔSPL −0.1 [−1.4, 1.2]), indicating that the default does not end attempts prematurely.
(3) Association errors and their reach. We agree that spatial proximity does not guarantee the same navigable candidate; association is an approximation. Its effect is bounded by design: reached Ghosts are never matched, matching an unexplored or pending Ghost keeps the direction selectable, and among Ghost states only failed removes a direction. A wrong association can therefore remove a valid direction only through the failed state (matching an already failed Ghost, or a matched Ghost failing twice afterwards). Empirically:
- Association radii of 0.60 m and 0.90 m give no detectable difference (ΔSR −0.3 [−2.7, 2.1] and −0.9 [−3.3, 1.5]).
- Removals due to failed Ghosts are rare: 1.12 per episode by default and 0.85–1.25 across radii.
- N_fail = 1, which nearly triples these removals (3.05 per episode), gives no detectable SR change (−1.1 [−3.5, 1.3]); N_fail = 3 gives −1.3 [−3.7, 1.1].
- If the filtering often removed valid directions, disabling it should help; instead, SR drops by 2.1 pp (see Part 1/3).
(4) Association accuracy and failure cases. The simulator provides no ground-truth identities for depth-derived candidates, so association accuracy cannot be measured directly. The revised Appendix H now provides step-by-step visualizations of representative episodes (Figs. 7–10; full replays of six episodes at https://anonymous.4open.science/r/GA-Nav-visualization-E8AF/README.md) that list every removed direction and the reason for its removal (e.g., "Matched a failed Ghost (G18, failures=2)"), so that state-update errors can be inspected directly.
W2/Q3: Recent zero-shot baselines.
We have added MSGNav to the TF-ZS group of Table 1, together with ApexNav and CogNav. A key difference lies in the models: these methods build on different and stronger model stacks, whereas GA-Nav uses a single open-weight VLM for all modules, without any dedicated detector or segmenter. SR / SPL as reported in the original papers:
| Method | Models | HM3D v0.1 | HM3D v0.2 | MP3D |
|---|---|---|---|---|
| CogNav (ICCV'25) | GPT-4V + GPT-3 (proprietary) + OpenSEED | 72.5 / 26.2 | – | 46.6 / 16.1 |
| ApexNav (RA-L'25) | YOLOv7 + Grounding-DINO + Mobile-SAM + BLIP-2 + DeepSeek-V3 | 59.6 / 33.0 | 76.2 / 38.0 | 39.2 / 17.8 |
| MSGNav (CVPR'26) | GPT-4o (proprietary) + YOLO-World + SAM + CLIP | – | 74.1 / 33.4 | – |
| WMNav (IROS'25) | Gemini (proprietary) | 58.1 / 31.2 | 72.2 / 33.3 | 45.4 / 17.2 |
| GA-Nav (ours) | Qwen3-VL-32B only (open-weight) | 58.5 / 35.6 | 73.1 / 39.1 | 49.5 / 24.9 |
These model differences matter:
- CogNav: its own ablation shows that replacing GPT-4V and GPT-3 with the open-source CogVLM2-19B and Llama3.1-8B lowers its HM3D SR from 72.5 to 62.6.
- ApexNav: it recognizes targets with dedicated detectors (YOLOv7 and Grounding-DINO) and uses the 671B-parameter DeepSeek-V3 for semantic priors. YOLOv7 is trained with box-level supervision on COCO, whose label set covers all six HM3D goal categories. On MP3D, whose 21 goal categories go beyond COCO, GA-Nav outperforms ApexNav by 10.3 SR and 7.1 SPL.
- MSGNav: it combines proprietary GPT-4o with three dedicated perception models (YOLO-World, SAM, CLIP) to build an explicit 3D scene graph.
- WMNav: it uses proprietary Gemini; GA-Nav outperforms it on all six metrics.
Among the TF-ZS methods in the updated Table 1, GA-Nav achieves the best SPL on all three benchmarks (+2.6, +1.1, and +7.1 pp over the next best) and the best SR on MP3D (+2.9 pp), using only one open-weight VLM. On HM3D, methods built on these stronger model stacks report higher SR. Under an identical backbone, GA-Nav outperforms prior TF-ZS methods by a large margin (Table 2: +9.5 SR / +7.6 SPL over ReMemNav), and its performance improves directly with stronger VLMs (Table 4). The revised abstract, introduction, Sec. 4.2, and conclusion now state our claims precisely: best SPL on all three benchmarks and best SR on MP3D among TF-ZS methods.
Figures. Thank you for these suggestions. We have simplified Fig. 2 around its three-stage backbone (observation, search, approach), with shorter labels and more compact notation; the complete control flow of the six VLM functions is given in Algorithm 1 (App. A) and their prompts in App. D. Regarding your suggestion for Fig. 3: the former Fig. 6 in Appendix B illustrates, with an example, how Ghost states determine the allowed direction set. To make this easier to follow, we have moved it into the main text as Fig. 4, directly after Fig. 3. The revised Appendix H also adds step-by-step visualizations of successful and failed episodes (Figs. 7–10), which show how Ghost-state changes alter the allowed direction set from step to step.
Thank you again for the insightful comments, which helped us state our contribution more precisely. If our responses resolve your concerns, we would be grateful if you would consider updating your score, and we are glad to discuss further.
We thank the reviewer for the thorough and expert review. Your questions target exactly what the paper needs to establish, so we designed controlled experiments around them, each on all 1,000 HM3D v0.2 validation episodes with Qwen3-VL-32B-Instruct. Every variant changes one setting and is paired by episode with a re-run of the full method (SR 72.2 / SPL 38.6); 95% CIs come from 10,000 paired bootstrap resamples.
Q1/W1: What does execution-updated control add beyond prior topological navigation?
We agree that Node–Ghost graphs, cross-view candidate merging, failure marking, and backtracking are established ideas (NTS, ETPNav, FTM). The revised introduction now states this explicitly, and we do not claim these primitives as our contribution.
The difference lies in who makes the decisions and how the state reaches them:
The capability this adds is that a frozen, untrained VLM makes long-horizon decisions that stay consistent with what the agent has actually executed, without having to learn how to use a map. We tested this directly:
In the text-only variant, directions toward failed Ghosts and repeatedly traversed Nodes are no longer removed: they stay selectable and are flagged in the prompt ("[Failed Ghost Frontier, failures=N]", "[WARNING: Path traversed N times]"). Each episode thus exposes the VLM to 1.65 failed-Ghost and 4.77 repeated-Node directions that the full method would remove. Despite the explicit warnings, the VLM re-enters used edges 29% more often, and SR drops by 2.1 pp.
Together with Table 3, where cross-step NGTM contributes far more than any other component (+7.5–8.8 SR and +4.5–5.9 SPL, vs. +1.5 and +1.2 SR for adding VerifierVLM and GrounderVLM to the full configuration), this indicates that GA-Nav's gains come mainly from its central idea, persistent execution-grounded topology used as a hard constraint, rather than from an incremental combination of equally important components. Accordingly, the revised introduction states that GA-Nav inherits Node–Ghost graphs, cross-view candidate merging, failure marking, and backtracking from this line of work, in which the planner is trained to exploit the graph state, whereas in TF-ZS ObjectNav the planner is a frozen VLM and prior training-free methods supply memory only as soft context; the remaining problem is to make the outcome of each executed action constrain the next decision of a frozen VLM. The first contribution now reads: