TRAVEL: Training-Free Retrieval and Alignment for Vision-and-Language Navigation

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Rajabi, Navid, Kosecka, Jana
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912421534236672
author Rajabi, Navid
Kosecka, Jana
author_facet Rajabi, Navid
Kosecka, Jana
contents In this work, we propose a modular approach for the Vision-Language Navigation (VLN) task by decomposing the problem into four sub-modules that use state-of-the-art Large Language Models (LLMs) and Vision-Language Models (VLMs) in a zero-shot setting. Given navigation instruction in natural language, we first prompt LLM to extract the landmarks and the order in which they are visited. Assuming the known model of the environment, we retrieve the top-k locations of the last landmark and generate $k$ path hypotheses from the starting location to the last landmark using the shortest path algorithm on the topological map of the environment. Each path hypothesis is represented by a sequence of panoramas. We then use dynamic programming to compute the alignment score between the sequence of panoramas and the sequence of landmark names, which match scores obtained from VLM. Finally, we compute the nDTW metric between the hypothesis that yields the highest alignment score to evaluate the path fidelity. We demonstrate superior performance compared to other approaches that use joint semantic maps like VLMaps on the complex R2R-Habitat instruction dataset and quantify in detail the effect of visual grounding on navigation performance.
format Preprint
id arxiv_https___arxiv_org_abs_2502_07306
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle TRAVEL: Training-Free Retrieval and Alignment for Vision-and-Language Navigation
Rajabi, Navid
Kosecka, Jana
Computer Vision and Pattern Recognition
Artificial Intelligence
Computation and Language
Machine Learning
Robotics
In this work, we propose a modular approach for the Vision-Language Navigation (VLN) task by decomposing the problem into four sub-modules that use state-of-the-art Large Language Models (LLMs) and Vision-Language Models (VLMs) in a zero-shot setting. Given navigation instruction in natural language, we first prompt LLM to extract the landmarks and the order in which they are visited. Assuming the known model of the environment, we retrieve the top-k locations of the last landmark and generate $k$ path hypotheses from the starting location to the last landmark using the shortest path algorithm on the topological map of the environment. Each path hypothesis is represented by a sequence of panoramas. We then use dynamic programming to compute the alignment score between the sequence of panoramas and the sequence of landmark names, which match scores obtained from VLM. Finally, we compute the nDTW metric between the hypothesis that yields the highest alignment score to evaluate the path fidelity. We demonstrate superior performance compared to other approaches that use joint semantic maps like VLMaps on the complex R2R-Habitat instruction dataset and quantify in detail the effect of visual grounding on navigation performance.
title TRAVEL: Training-Free Retrieval and Alignment for Vision-and-Language Navigation
topic Computer Vision and Pattern Recognition
Artificial Intelligence
Computation and Language
Machine Learning
Robotics
url https://arxiv.org/abs/2502.07306