Searcharxiv⌕ Search

arXiv · 2611.17442

Racing the Clock: Teaching VLNs Budget-Conditioned Object Search

Abstract

How do action budgets shape vision-language navigation (VLN) exploration, and what expert supervision best teaches budget-aware search? We study budget-conditioned object search: finding as many distinct instances of a requested category as possible within a budget, with discovery defined geometrically by camera field of view and proximity. Distinct discoveries provide a denser evaluation signal than single-target success. We cast expert design as a choice of scene abstraction: a single budget-indexed Bellman recursion, applied to different abstractions of the full environment, yields experts that differ in what they know. An object-level Bellman expert is given every target location and reduces search to budgeted routing. A room-level Bellman expert retains observed room connectivity, doorway evidence, and cross-scene semantic priors but withholds the contents of unexplored rooms, so it must search for targets that its student also cannot see. We distill both experts into Uni-NaVid under matched training conditions and also evaluate greedy-frontier supervision on held-out HM3D scenes. Changing only the stated budget changes learned trajectories. Despite higher object-level expert return, room-level supervision achieves the highest mean collection among evaluated VLNs at every tested budget. At 2000 steps, it finds 72.7% of reachable targets, versus 68.5% under greedy-frontier supervision, 65.5% under object-level supervision, and 44.8% for the pretrained VLN. These results show that expert-return rankings need not predict supervision quality for VLN exploration, and motivate choosing an expert's abstraction with the student's information in mind rather than by expert return alone.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maitree Meher, Siming He, S. Shankar Sastry, Jitendra Malik, Claire Tomlin, Jonas Frey. 2026-11-16. Racing the Clock: Teaching VLNs Budget-Conditioned Object Search. https://searcharxiv.com/abs/2611.17442

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Human-like Semantic Navigation for Autonomous Driving using Knowledge Representation and Large Language Models

Achieving full automation in self-driving vehicles remains a challenge, especially in dynamic urban environments where navigation requires real-time adaptability. Existing systems struggle to handle navigation plans when faced with unpredictable changes in road layouts, spontaneous detours, or missing map data, due to their heavy reliance on predefined cartographic information. In this work, we explore the use of Large Language Models to generate Answer Set Programming rules by translating informal navigation instructions into structured, logic-based reasoning. ASP provides non-monotonic reasoning, allowing autonomous vehicles to adapt to evolving scenarios without relying on predefined maps. We present an experimental evaluation in which LLMs generate ASP constraints that encode real-world urban driving logic into a formal knowledge representation. By automating the translation of informal navigation instructions into logical rules, our method improves adaptability and explainability in autonomous navigation. Results show that LLM-driven ASP rule generation supports semantic-based decision-making, offering an explainable framework for dynamic navigation planning that aligns closely with how humans communicate navigational intent.

cs.RO↗

InFeR: Informed Failure Resilience in Learned Visual Navigation Control

While imitation learning (IL) has enabled successful visual navigation in many common environments, IL policies are prone to unpredictable failures under out-of-distribution (OOD) scenarios. This necessitates failure-resilient policies, which not only detect failures, but also recognise their sources and recover from them autonomously. We propose InFeR, a general framework for building IL policies with informed failure resilience without failure or recovery demonstrations. Given an IL policy's architecture and training dataset, InFeR retrains a new OOD-aware policy with a latent space structured for OOD failure detection, with a modified objective based on the Variational Information Bottleneck. It applies a visual explainability technique, Grad-CAM, to attribute failures to specific image regions and inform a heuristic policy for recovery. All these are achieved without requiring additional training data. Real-world experiments show that InFeR enables informed failure recovery across two different policy architectures, supporting long-range navigation in complex environments.

cs.RO↗

Delay-Aware Distributed Multi-Robot Motion Planning

This paper examines why distributed optimization degrades when multi-robot systems coordinate under realistic communication delays. Using consensus ADMM as a representative framework for generating collision-free, dynamically feasible motion plans in both trajectory optimization and receding-horizon control settings, we show that delay degrades performance structurally: the consensus and dual updates weight stale and current information identically, so staleness enters the optimizer disguised as genuine disagreement and accumulates through the multipliers. Delay-agnostic adaptation (e.g. residual balancing) inherits this contamination and can perform worse than a fixed penalty. We introduce a Delay-Aware ADMM (DA-ADMM) variant that adapts penalty parameters to real-time delay statistics and re-derives the global consensus update as a delay-weighted average, down-weighting stale information in favor of recent updates. Simulations in 2D and 3D show that DA-ADMM improves robustness, success rate, and solution quality over fixed-parameter, residual-balancing, lower-bound, and fixed-constraint baselines. Degradation is therefore governed not by delay length or frequency, but by the optimizer's ability to reason over the age of the information it receives.

cs.RO↗