Vision-and-Language Navigation in Continuous Environments (VLN-CE) requires instruction-consistent planning and reliable execution under collision constraints. Yet many hierarchical approaches optimize the planner while keeping execution fixed. We introduce MATCH, a framework that jointly learns a language-conditioned planner and a goal-conditioned primitive-action executor. An execution-aware topological graph represents start-dependent execution options and integrates executor value estimates with realized outcome memory, enabling the planner to select execution requests and refine their targets through bounded continuous offsets. A transition-aware dense macro reward balances ordered progress along the reference route against execution residual, encouraging executable requests without substituting local success for instruction following. A staged curriculum culminates in synchronized on-policy updates, with the executor learning on planner-generated requests and the planner adapting its requests to the executor's current behavior. With 0.5B parameters, MATCH achieves state-of-the-art performance on the R2R-CE and RxR-CE benchmarks. Preliminary real-robot deployments further demonstrate its practical potential.
Figures & tables
Fig. 1: Comparison of three Hierarchical paradigms in VLN-CE.
Fig. 2: Overview of MATCH. The language-conditioned planner issues execution requests from an execution-aware graph, while the goal-conditioned executor realizes them with primitive actions. Macro- and micro-level experiences from the same rollouts are used for synchronized updates, enabling mutual adaptation between planning and execution.
Method
Params
Training
Planner output
Executor
Observation
R2R-CE Val-Unseen
RxR-CE Val-Unseen
NE ↓
OS ↑
SR ↑
SPL ↑
NE ↓
SR ↑
SPL ↑
nDTW ↑
ETPNav [ 2 ]
0.3B
IL
frontier
rotate-then-fwd.
pano. RGB-D+odo.
4.71
65.0
57.0
49.0
5.64
54.8
44.9
61.9
HNR [ 8 ]
0.3B
IL
frontier
rotate-then-fwd.
pano. RGB-D+odo.
4.42
67.0
61.0
51.0
5.51
56.4
46.7
63.6
Revisiting [ 5 ]
0.5B
IL+RL
frontier
rotate-then-fwd.
pano. RGB-D+odo.
3.89
72.6
68.1
57.3
5.07
62.3
50.2
66.8
VLN-R1 [ 25 ]
7B
IL+RL
primitives
–
mono RGB
7.00
41.2
30.2
21.8
10.4
22.3
17.5
–
StreamVLN [ 26 ]
7B
IL
primitives
–
mono RGB
4.98
64.2
56.9
51.9
6.22
52.9
46.0
61.9
TABLE I: Comparison on the val-unseen splits of R2R-CE and RxR-CE. ‡ : reproduced with the released checkpoint the rotate-then-forward executor, since the original evaluation follows the predicted waypoint trajectory by teleportation.
Variant
SR ↑
nDTW ↑
Δ SR
Δ nDTW
Time
MATCH
67.7
70.0
–
–
∼ 120
Training (Sec. III-B , IV )
w/o joint HRL
61.8
65.1
−5.9
−4.9
–
heuristic executor
64.3
66.9
−3.4
−3.1
∼ 50
learned executor, frozen
65.6
68.0
−2.1
−2.0
∼ 110
alternating updates
67.0
69.8
−0.7
−0.2
∼ 200
TABLE II: Ablations on RxR-CE val-unseen. Δ is relative to MATCH; time is the wall-clock of the joint stage in hours.
Fig. 3: Training dynamics during Stage 3 joint HRL. The x-axis in all panels denotes the training step. (a) Planner and executor returns, together with the change in success rate ( ΔSR ) on RxR-CE val-unseen. (b) Planner-proposed target distance ρ0 and the execution residual rest after each macro action. (c) The two dense components of the macro reward: normalized ordered-route coverage increment reward, ∑tΔt/L , and normalized execution-residual penalty, −∑trest/L . Together, these curves illustrate how the planner gradually balances target ambition with executability as the planner and executor co-adapt.
Fig. 4: Comparative case study on RxR-CE val-unseen.
Fig. 5: Real robot deployment. We deployed MATCH on a robot modified from TurtleBot 4 and tested it across four episodes.
Module
Size
Init.
S1
S2
S3
Shared encoders
RGB encoder
SigLIP2 ViT-B/16
pretrained
∘
∘
∘
Depth encoder
ResNet-50, 512-d
DD-PPO
∘
∘
∘
Planner
Instruction encoder
InfoXLM-base
pretrained
✓
✓
✓
Panorama encoder
2 layers, 768
random
✓
✓
✓
TABLE I: Modules of MATCH and their status in the three training stages: ✓ trained, ∘ frozen, – not used.
In Vision-Language Navigation (VLN) tasks involving multi-step instructions as guidance, an agent must associate its observations with the relevant instruction content at each decision point. Most graph-based methods commonly match candidate trajectories with the entire instruction, allowing already executed content to interfere with subsequent decisions. Although instruction-execution progress provides a direct cue for separating executed and pending content, existing progress estimation approaches often rely on explicit progress supervision, sophisticated progress-learning stages, or costly online reasoning with LLMs. In this paper, we propose a robust VLN framework with Awareness of Instruction-Execution Progress (VLN-AIEP), which couples progress estimation with navigation decision-making. VLN-AIEP associates the visited trajectory with the instruction to suppress embeddings corresponding to executed content, and then matches candidate locations with the pending content. This coupling makes correct navigation decisions depend on accurate progress estimation, allowing the progress estimator to learn directly from navigation decision labels without explicit progress annotations. To support progress estimation, we construct a landmark-anchored trajectory representation that encodes the semantic labels and viewpoint-relative geometry of instruction-referred landmarks. These landmarks serve as spatial references for associating the visited trajectory with executed instruction content. Extensive experiments on R2R, RxR, CVDN, and R2R-CE demonstrate that the proposed method achieves favorable performance across multiple metrics.
Vision-Language Navigation in Continuous Environments (VLN-CE) requires an agent to follow natural language instructions through unseen environments. Existing imitation learning (IL) pipelines struggle in this closed-loop setting: behavior cloning suffers from distribution shift, and DAgger's expert actions become ambiguous upon trajectory deviation. While Reinforcement Learning (RL) offers a natural paradigm to address this, directly applying RL to micro action spaces is sample-inefficient due to reward sparsity. To overcome this bottleneck, we reformulate VLN-CE as a Hierarchical Markov Decision Process (MDP), explicitly decoupling high-level planning from low-level control. By abstracting the environment into a topological graph, our high-level policy operates on a macro action space of frontier nodes, with a training-free low-level controller acting as its state transition, which significantly compresses the decision horizon and makes closed-loop RL tractable. To support RL optimization on the macro MDP, we propose an action-aware value head to effectively evaluate state values under the dynamic frontier action space, powering a graph-based PPO. Extensive experiments demonstrate the effectiveness of our architecture. Finally, our model achieves state-of-the-art performance on the R2R-CE and RxR-CE benchmarks.
Shuhao Ye, Sitong Mao, Yuxiang Cui +7
Zhejiang University, Hangzhou, China · Huawei Technologies Co., Ltd · Zhejiang Humanoid Robot Innovation Center, Ningbo, China
Vision-Language Navigation (VLN) requires embodied agents to generate actions based on instructions and observations. General-purpose multimodal agents offer a promising basis for this task, but selecting plausible local actions does not ensure that execution remains consistent with the intended route, particularly in long-horizon tasks. Moreover, the accumulated interaction history increases the input required for subsequent decisions, resulting in a significant inference overhead. To this end, we introduce \method, an Agentic VLN framework that includes a Goal Agent that sets adaptive goals for local actions, a Verify Agent that dynamically verifies whether a goal has been completed, a Memory Agent for multimodal context compression, and a Visuomotor Agent to execute adaptive goals. Specifically, the Goal Agent formulates adaptive goals based on the instruction, current observation, and execution history. Then the Visuomotor Agent executes navigation actions to achieve each goal, while the Verify Agent uses a goal-specific verification question to dynamically assess whether the observed outcomes satisfy the intended completion condition. Verified goal completion then marks a boundary for the Memory Agent to compress the corresponding multimodal interaction history while preserving information needed for subsequent navigation. We evaluate navigation on R2R-CE and RxR-CE, examine framework variants across three model backbones, and study context evolution during execution. For Real-World evaluation, \method achieves 83.3% success and 1.51,m navigation error across eight challenging routes evaluated three times each.
Haoxiang Shi, Zaijing Li, Muhe Ding +3
Harbin Institute of Technology (Shenzhen) · Pengcheng Laboratory