NaViRrator: Robot Navigation from Human-Readable Maps through a Learned Visual Route
Organizations: Department of Robotics and Mechatronics Engineering, DGIST, Daegu, Republic of Korea
Abstract
Human-readable maps provide an intuitive interface for specifying robot destinations, but connecting their schematic geometry to egocentric observations remains challenging. We present NaViRRator, a framework that translates user-specified start and goal locations on such maps into navigation instructions for a pretrained vision-and-language navigation (VLN) policy. Its core method, RouteScribe, separates route inference from verbalization by first generating an explicit route scaffold in map-image coordinates, which a pretrained vision-language model (VLM) converts into a navigation instruction. We construct the scaffold with start--goal line conditional flow matching (SGL-CFM), which deforms a straight start--goal waypoint sequence into a map-conditioned route. During execution, the VLN policy receives only the instruction and egocentric observations, while the map and scaffold remain upstream, allowing executor replacement without retraining the map-to-language modules. Real-world experiments show higher success rates and success weighted by path length (SPL) than direct map-to-instruction generation, A*-based scaffolding, and Gaussian-source conditional flow matching. Qualitative results further show clearer salient turns and better preservation of the intended maneuver sequence, supporting route-grounded language as a modular interface between human-readable maps and pretrained navigation policies.
Figures & tables
| Case and interpretation | RIA | OIA | GIA |
| Correct route, faithful instruction. Route: right (correct); Instruction: “ Turn right. ” (correct). | ✓ | ✓ | ✓ |
| Route error faithfully propagated. Route: left (incorrect); Instruction: “ Turn left. ” (incorrect). | ✗ | ✓ | ✗ |
| Language-compilation error. Route: right (correct); Instruction: “ Turn left. ” (incorrect). | ✓ | ✗ | ✗ |
| Possible recovery using map cues. Route: left (incorrect); Instruction: “ Turn right. ” (correct). | ✗ | ✗ | ✓ |
| Method | nFD | RIA | OIA | GIA | GoalAcc | |
| Raw | 70 | – | – | – | 34.3 | 71.4 |
| A ∗ | 70 | 0.0350 | 35.7 | 42.9 | 38.6 | 84.3 |
| Gaussian-source CFM | 70 | 0.0406 | 41.4 | 34.3 | 37.1 | 77.1 |
| Ours (SGL-CFM) | 70 | 0.0342 | 60.0 | 62.9 | 45.7 | 85.7 |
| Map-to-language | Physical navigation | |||||||
| Method | RIA | OIA | GIA | GoalAcc | NE | OSR | SR | SPL |
| Raw | – | – | 30.3 | 75.8 | 9.552 | 42.4 | 24.2 | 0.214 |
| A ∗ | 69.7 | 66.7 | 72.7 | 90.9 | 8.018 | 42.4 | 30.3 | 0.277 |
| G-CFM | 51.5 | 36.4 | 45.5 | 87.9 | 8.088 | 33.3 | 24.2 | 0.210 |
| SGL-CFM | 84.8 | 72.7 | 72.7 | 93.9 | 5.388 | 60.6 | 54.5 | 0.504 |
| Map-to-language | Physical navigation | |||||||
| Method | RIA | OIA | GIA | GoalAcc | NE | OSR | SR | SPL |
| Raw | – | – | 45.5 | 81.8 | 9.611 | 18.2 | 9.1 | 0.090 |
| A ∗ | 63.6 | 45.5 | 54.5 | 90.9 | 5.999 | 36.4 | 9.1 | 0.091 |
| G-CFM | 36.4 | 36.4 | 63.6 | 90.9 | 7.713 | 27.3 | 9.1 | 0.091 |
| SGL-CFM | 90.9 | 63.6 | 63.6 | 100.0 | 6.948 | 54.5 | 36.4 | 0.361 |
| Executor | Upstream retraining | NE (m) | OSR (%) | SR (%) | SPL | |
| JanusVLN | No | 22 | 5.505 | 59.1 | 50.0 | 0.486 |
| NaVILA | No | 22 | 9.756 | 45.5 | 22.7 | 0.227 |
| OmniNav | No | 22 | 10.476 | 22.7 | 9.1 | 0.091 |
| VLM | Generated instruction |
| Gemini 3.1 Pro Preview | “Go straight. Turn left at the intersection. Go straight. Turn right at the end of the corridor. Stop in front of room 610. That is your destination.” |
| GPT-5.6 | “Go straight toward room 618. Turn left at the corner and go past the elevator. Turn right at the restroom area. Stop near room 610. That is your destination.” |
| Qwen3.8-27B-FP8 | “Go straight. Turn left at the corner. Go straight. Turn right at the corner. Go straight. Stop in front of the door to room 610. That is your destination.” |
Robot Navigation
Robot navigation studies how robots perceive, localize, plan, and move safely toward goals in static or changing environments.
See all 532 papers