mlsanityData to 14 Oct 2026

Time-to-Collision Based Dynamic Obstacle Avoidance Using Pretrained Vision Models for Robots in Unstructured Environments

arXiv 2607.07885 ↗First posted 8 Jul 2026cs.RO cs.AI cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Dynamic obstacle avoidance in unstructured outdoor environments remains a critical challenge for autonomous mobile robots, particularly when large-scale robot-specific training data and simulation-based policies are impractical. We present a data-efficient, interpretable method for vision-based dynamic obstacle avoidance that operates entirely on real-world data, avoiding the sim-to-real transfer problem inherent in simulation-trained policies. Our approach leverages UniDepth, a large pretrained monocular depth estimation model, to produce dense depth maps from RGB video without requiring stereo cameras or LiDAR at inference time. Dynamic obstacle avoidance is achieved by extending the SuperPoint and SuperGlue feature correspondence pipeline to track keypoints across long frame sequences, projecting their 2D pixel-space positions into 3D using camera intrinsics and predicted depth, running bundle adjustment initialized from these 3D keypoints, and computing per-keypoint time-to-collision (TTC). A 2D motion primitive in the ground plane is then selected to move the robot away from the closest point of approach of the minimum-TTC keypoint. Evaluated on real-world data from the M3ED dataset, our pipeline achieves a precision of 0.49 and a recall of 0.38 in identifying frames with a ground truth TTC below 1 second, and correctly generates the evasive motion direction in 84% of true positive detections. Crucially, it detects at least one frame with TTC less than 1 second for 20 out of 22 unique physical obstacles present in our test sequences. Unlike end-to-end learned methods that demand thousands of hours of robot-specific training data, our approach eliminates model training entirely, requiring only 74 seconds of data for hyperparameter tuning. This demonstrates exceptional data efficiency while preserving interpretable and generalizable behavior across diverse obstacle types.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 32 references that are in the map. First posted on arXiv 8 Jul 2026.

Builds on

21 of 32 references.

References · 21

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2017Proximal Policy Optimization Algorithmscited by 15,215
  4. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  5. 2015Continuous control with deep reinforcement learningcited by 3,407
  6. 2017CARLA: An Open Urban Driving Simulatorcited by 2,449
  7. 2020RAFT: Recurrent All-Pairs Field Transforms for Optical Flowcited by 2,415
  8. 2022RT-1: Robotics Transformer for Real-World Control at Scalecited by 2,061
  9. 2017Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real Worldcited by 1,498
  10. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
  11. 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,320
  12. 2023Mastering Diverse Domains through World Modelscited by 1,253
9 more
  1. 2021Isaac Gym: High Performance GPU-Based Physics Simulation For Robot Learningcited by 998
  2. 2021DROID-SLAM: Deep Visual SLAM for Monocular, Stereo, and RGB-D Camerascited by 687
  3. 2020Reinforcement Learning with Augmented Datacited by 468
  4. 2024UniDepth: Universal Monocular Metric Depth Estimationcited by 382
  5. 2022Masked Visual Pre-training for Motor Controlcited by 248
  6. 2023ViNT: A Foundation Model for Visual Navigationcited by 222
  7. 2022PACT: Perception-Action Causal Transformer for Autoregressive Robotics Pre-Trainingcited by 24
  8. 2021Binary TTC: A Temporal Geofence for Autonomous Navigationcited by 20
  9. 2025Building Rome with Convex Optimizationcited by 8

Built on by

Not cited yet.