Skip to content
AI News HubLIVE
Original source2 min read

Racing the Clock: Teaching VLNs Budget-Conditioned Object Search

Summary

This paper studies budget-conditioned object search, comparing two supervision methods for VLN models: a privileged TSP expert using full map and true target locations, and a room-level Bellman expert maximizing expected return under partial observability with semantic priors. Despite higher expert performance of TSP, Bellman-supervised VLN consistently outperforms TSP-supervised VLN on held-out HM3D scenes, with advantage growing at longer budgets. At 2000 steps (500m), Bellman-supervised VLN finds 71.4% of reachable targets vs. 65.5% for TSP-supervised and 44.8% for pretrained VLN.

SourcearXiv RoboticsAuthor: Maitree Meher, Siming He, S. Shankar Sastry, Jitendra Malik, Claire Tomlin, Jonas Frey
Racing the Clock: Teaching VLNs Budget-Conditioned Object Search
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 12 Nov 2026]

Title:Racing the Clock: Teaching VLNs Budget-Conditioned Object Search

View a PDF of the paper titled Racing the Clock: Teaching VLNs Budget-Conditioned Object Search, by Maitree Meher and 5 other authors

View PDF HTML (experimental)

Abstract:A rescue robot entering a building with thirty seconds on the clock should sprint toward the single most promising room; given ten minutes, it should instead explore a broader tour. Yet vision-language-navigation (VLN) models are typically evaluated under a fixed episode limit that the policy never observes, even though time-critical missions require behavior to adapt to the available budget. We study budget-conditioned object search: given a target category and an explicit action budget, an agent must find as many distinct target instances as possible before the budget expires. We investigate how to supervise VLNs for this task by comparing a privileged TSP expert, which plans near-optimal routes using the full map and true target locations, with a room-level Bellman expert that maximizes expected return under partial observability using high-level cross-scene semantic priors. Despite the TSP expert achieving substantially higher expert performance, its demonstrations are less effective for learning exploration: on held-out HM3D scenes, the Bellman-supervised VLN consistently outperforms the TSP-supervised VLN, with the advantage becoming more pronounced at longer budgets. At 2000 steps (500m), the Bellman-supervised VLN finds 71.4% of reachable target instances, compared with 65.5% for the TSP-supervised VLN and 44.8% for the pretrained VLN. These results highlight a distinction between optimal routing and optimal exploration: effective exploration supervision should optimize decisions under partial observability rather than imitate routes that are optimal only once the environment is fully known.

Comments: 12 pages, 4 figures, 3 tables

Subjects:

Robotics (cs.RO); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)

Cite as: arXiv:2611.17442 [cs.RO]

(or arXiv:2611.17442v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2611.17442

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Maitree Meher [view email] [v1] Thu, 12 Nov 2026 19:13:20 UTC (5,081 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Racing the Clock: Teaching VLNs Budget-Conditioned Object Search, by Maitree Meher and 5 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.RO

new | recent | 2026-11

Change to browse by:

cs cs.AI cs.CV cs.LG

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Introduces budget-conditioned object search: agent must find as many target instances as possible within an explicit action budget.
  • Compares privileged TSP expert and room-level Bellman expert for supervising VLN models.
  • Bellman-supervised VLN outperforms TSP-supervised VLN on HM3D scenes, with advantage increasing at longer budgets.
  • At 2000 steps (500m), Bellman-supervised VLN achieves 71.4% reachable target discovery, vs. 65.5% for TSP-supervised and 44.8% for pretrained baseline.

Highlights and analysis are generated automatically and may contain errors. Check the original source.