Learning Navigation from Multimodal Demonstrations with Geometric Candidate Modes
Authors: Chengyang Peng, Zhihao Zhang, Upama Pant, Yiming Wang, Keith A. Redmill, Ayonga Hereid
Organizations: Mechanical and Aerospace Engineering, The Ohio State University, Columbus, OH, USA. · Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA.
Offline navigation demonstrations are multimodal, because one observation often allows several valid actions, such as passing an obstacle on either side. Behavior cloning averages these actions, potentially leading to unsafe routes. Multimodal policies must discover the alternatives from the data, but similar states can lead to different routes whose current actions overlap. In navigation, the alternatives have a geometric cause and can be computed from one observation. We propose a hierarchical neural-network policy that computes candidate modes from local geometry and learns from demonstrations which mode to follow and how. A high-level policy selects a mode using the goal and its previous choice among a set of candidate modes, and a low-level policy turns it into an action. In simulation, the policy succeeds in over 95% of seen and unseen test cases, compared with at most 43% and 20% for four offline learning baselines and 79% and 67% for a heuristic that uses the same modes without learning. The simulation-trained policy also transfers to a LimX Tron 1 bipedal robot.
Figures & tables
Fig. 1 : (a). Averaging two feasible avoidance trajectories in behavior cloning produces a trajectory that collides directly with the obstacle. (b). Two obstacles (red and blue) partition the free space into three feasible forward directions. The tangent lines H1,H2 and the observation-window edges (dashed) give three candidate modes m1,m2,m3 .
Fig. 2 : Overview of the proposed framework. The observation st is shown as the occupancy map socc and the proprioception slow . The geometric module computes the candidate set Mt from socc and the goal gt , and is not learned. Both policies are trained from demonstrations: the high-level policy πH selects a mode, conditioned on st , gt , and the previous mode mt−1 , and the low-level policy πL turns the selected mode m^t into a continuous action.
Fig. 3 : Examples of the four mode types, highlighted by orange circles. Type 0 lies between two obstacles. Types 1 and 2 pass one obstacle on the left and on the right. Type 3 points toward the goal.
Fig. 4 : An early branching case. Demonstrations that start from similar states follow distinct future paths (left), and their current actions form separate groups (right). For display, the paths show the next 20 steps of each demonstration, and colors mark the groups that our mode labeling method finds over these 20 steps.
Fig. 5 : An intermediate case. Demonstrations from similar states follow distinct future paths (left), but their current actions overlap and vary within each group (right). Colors as in Fig. 4 .
Method
SR (%) ↑
CR (%) ↓
TR (%) ↓
Path R. ↓
Step R. ↓
Act. Jump (#/100) ↓
Comput. Time (ms) ↓
Seen
MLP-BC
42.8 ± 5.9
56.0 ± 6.0
1.2 ± 2.0
1.04
1.09
0
1.2
DT
29.1 ± 6.8
70.9 ± 6.8
0
0.94
1.18
0.08 ± 0.07
3.0
BeT
34.8 ± 1.8
65.0 ± 2.0
0.2 ± 0.3
0.97
1.04
1.50 ± 0.60
3.6
DP
42.7 ± 3.2
55.2 ± 4.2
2.1 ± 1.7
1.12
1.18
3.38 ± 0.20
98.7
Ours
96.5 ± 1.0
3.2 ± 1.0
0.3 ± 0.2
1.00
1.00
0.25 ± 0.02
2.9
Unseen
MLP-BC
20.0 ± 7.3
80.0 ± 7.3
0
0.88
0.91
0
1.4
TABLE I: Comparison with offline learning baselines. Path R. and Step R. are relative to Ours, on the cases that both methods complete. Mean ± standard deviation over five training seeds (Sec. IV-A ).
Method
SR (%) ↑
CR (%) ↓
TR (%) ↓
Path R. ↓
Step R. ↓
Act. Jump (#/100) ↓
Comput. Time (ms) ↓
Mode Sw. (#/100) ↓
Seen
w/o Auxi.
70.4 ± 12.4
25.8 ± 11.3
3.8 ± 2.2
0.95
0.94
0
2.6
6.05 ± 0.41
w/o Hier.
25.8 ± 15.5
60.3 ± 4.7
13.8 ± 15.3
1.27
1.17
0
2.4
N/A
Mode-act.-only
97.8 ± 0.7
0.2 ± 0.2
2.0 ± 0.6
1.09
1.10
0.65 ± 0.08
3.0
5.36 ± 0.09
Heuristic
79.2
8.4
12.4
1.01
1.27
12.14
2.2
17.79
Ours
96.5 ± 1.0
3.2 ± 1.0
0.3 ± 0.2
1.00
1.00
0.25 ± 0.02
2.9
5.53 ± 0.05
Unseen
w/o Auxi.
62.0 ± 22.0
30.7 ± 21.5
7.3 ± 3.9
0.91
0.90
0
3.3
7.41 ± 0.77
TABLE II: Comparison with the model variants. Metrics as in Table I . The Heuristic is not trained, so it has no ± . w/o Hier. selects no mode, so it has no mode switches (N/A).
Fig. 6 : Trajectories of the Heuristic and Ours in two test cases. (a) A seen case: the Heuristic collides with an obstacle ( × ), while Ours reaches the goal. (b) An unseen case: both reach the goal by different routes.
Case (a)
Case (b)
Heuristic
Ours
Heuristic
Ours
Outcome
Collision
Success
Success
Success
Steps
108 (F)
103
143
98
Path length (m)
5.3 (F)
6.9
5.9
5.7
Action jumps
30
0
40
1
Large turns
32
0
19
5
TABLE III: The seen case (a) and the unseen case (b) of Fig. 6 . Counts are totals over the trial. (F): failed trial.
Fig. 7 : Navigation on the LimX Tron 1 robot. (a) Laboratory with static obstacles. (b) Map built by the robot’s perception, with the path of the robot from start to goal. (c) Local occupancy maps at three stages of the run, with the candidate modes and the selected mode (circled); the markers in (b) show where each map was taken.
Fig. 8 : Deployments in three more indoor environments: (a) a public study area, (b) table avoidance and return, (c) a doorway from the laboratory into a corridor.
Learning-based methods have demonstrated strong performance in mapless robot navigation. However, a learned policy remains restricted to the embodiment on which it was trained. Many cross-embodiment navigation methods require time-consuming online training and can still underperform target-specific policies. In fact, demonstrations collected on a source embodiment already contain navigation experience that is potentially reusable for deriving a policy for each target embodiment, but the embodiment mismatch prevents these demonstrations from directly serving as valid supervision for the target. In this article, we present CeDR-Nav, a cross-embodiment demonstration recasting framework that trains a dedicated navigation policy for each target embodiment from existing source demonstrations without online data collection. Geometry-consistent scaling with per-demonstration validity assessment converts the source demonstrations into target training data, and a target-specific Gaussian mixture policy generates feasible avoidance maneuvers for each target embodiment. Extensive quantitative simulations and real-world deployments across multiple robot platforms demonstrate the effectiveness of CeDR-Nav, with an average success-rate gain of 13.8 percentage points over DRL-DCLP in cross-embodiment simulations and target-specific policy training completed within seconds.
Xianghui Wang, Xinming Zhang, Yiwei Qian +4
Department of Mechanical Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong · College of Information Science and Technology, Eastern Institute of Technology, Ningbo, China · School of Computer Science and Technology, University of Science and Technology of China, Hefei, China +2
Learning robust navigation policies remains a core challenge in robotics. Offline imitation learning suffers from distribution shift and compounding errors at rollout, while reinforcement learning requires reward engineering and learns inefficiently. In this paper, we propose NavOL, an online imitation learning paradigm that interacts with a simulator and updates itself using expert demonstrations gathered online. Built upon a pretrained navigation diffusion policy that maps local observations to future waypoints, NavOL trains in a rollout update loop: during rollout, the policy acts in the simulator and queries a global planner which has privileged access to the global environment for the optimal path segment as ground truth trajectory labels; during update, the policy is trained on the online collected observation trajectory pairs. This online imitation loop removes the need for reward design, improves learning efficiency, and mitigates distribution shift by training on the policy own explored rollouts. Built on IsaacLab with fast, high-fidelity parallel rendering and domain randomization of camera pose and start-goal pairs, our system scales across 50 scenes on 8 RTX 4090 GPUs, collecting over 2,000 new trajectories per hour, each averaging more than 400 steps. We also introduce an indoor visual navigation benchmark with predefined start and goal positions for zero-shot generalization. Extensive evaluations on simulation benchmarks, including the NavDP benchmark and our proposed benchmark, as well as carefully designed real-world experiments, demonstrate the effectiveness of NavOL, showing consistent performance gains in online imitation learning.
Xiaofei Wei, Chun Gu, Li Zhang
School of Data Science, Fudan University · 2Shanghai Innovation Institute.
Goal-conditioned navigation models for ground robots trained using supervised learning show promising zero-shot transfer, but their collision-avoidance capability nevertheless degrades under distribution shift, i.e. environmental, robot or sensor configuration changes. We propose ViLiNT a multimodal, attention-based policy for goal navigation, trained on heterogeneous data from multiple platforms and environments, which improves robustness with two key features. First, we fuse RGB images, 3D LiDAR point clouds, a goal embedding and a robot's embodiment descriptor with a transformer architecture to capture complementary geometry and appearance cues. The transformer's output is used to condition a diffusion model that generates navigable trajectories. Second, using automatically generated offline labels, we train a path clearance prediction head for scoring and ranking trajectories produced by the diffusion model. The diffusion conditioning as well as the trajectory ranking head depend on a robot's embodiment token that allows our model to generate and select trajectories with respect to the robot's dimensions. Across three simulated environments, ViLiNT improves Success Rate on average by 166% over equivalent state-of-the-art vision-only baseline (NoMaD). This increase in performance is confirmed through real-world deployments of a rover navigating in obstacle fields. These results highlight that combining multimodal fusion with our collision prediction mechanism leads to improved off-road navigation robustness.
Louis Dezons, Quentin Picard, Rémi Marsal +2
AMIAD Pˆole Recherche, Palaiseau, France · U2IS, ENSTA, Institut Polytechnique de Paris, Palaiseau, France