NeurRAFT: Robot Motion Planning via Anchor-Level Flow Matching with Clearance-Aware Preference Tuning

• URL: http://arxiv.org/abs/2608.24026v1
• Date: Tue, 25 Aug 2026 03:31:24 GMT
• Title: NeurRAFT: Robot Motion Planning via Anchor-Level Flow Matching with Clearance-Aware Preference Tuning
• Abstract summary: We present NeurRAFT, a generative planning framework based on anchor-level flow matching and clearance-aware preference tuning.<n> Experiments show substantial improvements over state-of-the-art planners, while real-world experiments demonstrate zero-shot transfer to a Franka robot.
• Score: 5.973392871392725
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent end-to-end neural motion planners generate trajectories from raw sensor observations, avoiding the privileged geometric models required by classical planners. However, collision-free planning in cluttered environments remains challenging. We present NeurRAFT, a generative planning framework based on anchor-level flow matching and clearance-aware preference tuning. Unlike prior neural planners that model dense waypoint sequences and spend capacity on redundant local details and smoothness, NeurRAFT operates on compact anchor waypoints. We train the planner using a Jacobian-weighted loss that accounts for the task-space impact of each anchor. At inference, the anchors are generated in two integration steps, followed by cubic-spline interpolation to recover a smooth, full-resolution trajectory. Since imitation learning from positive demonstrations cannot distinguish collision-free from near-collision trajectories, collision-prone behaviors persist at test time. Rather than relying on post-hoc corrections, we directly reshape the pretrained planner's distribution toward safer solutions without augmenting inference. Specifically, Direct Preference Optimization shifts probability mass toward trajectories with larger obstacle clearance, with the resulting improvement directly absorbed into the planner parameters. Experiments show substantial improvements over state-of-the-art planners, while real-world experiments demonstrate zero-shot transfer to a Franka robot under noisy and partially occluded depth observations. Video results available at https://neurraft.github.io/.

Related papers

• Some Modifications to Our End-to-End UAV Planner [2.3190673374277524]
  The one-stage planner maps a single depth image and the robot state directly to a set of candidate trajectories.<n>We show that YOPO's multi-modal prediction span to distinct homotopy classes, treating each motion as a trajectory that confines the trajectory to a feasible - without explicit safe-building or construction penalties.
  arXiv  Detail & Related papers  (2026-08-16T13:39:46Z)
• Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles [49.315843050082925]
  We present a bi approach for minimum-time motion planning convex obstacles that is guaranteed to converge.<n>We find that the proposed method produces high-quality trajectories with times to produce state-of-the-art decomposition of variables.
  arXiv  Detail & Related papers  (2026-08-03T19:48:24Z)
• Model Predictive Planner for UAV Navigation in Non-Convex Air Corridors [1.2617078020344616]
  This work presents a motion motion framework for UAV air corridors.<n>The planner is based on a mixed-integer tracking model that enforces external feasibility.
  arXiv  Detail & Related papers  (2026-07-27T12:42:38Z)
• iGSP:Implicit Gradient Subspace Projection for Efficient Continual Learning of Vision-Language Models [14.623213614166259]
  iGSP is a novel framework that achieves efficient adaptation via implicit gradient subspace projection.<n>Experiments on the MTIL benchmark demonstrate that iGSP achieves state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2026-05-19T03:22:14Z)
• RAD-2: Scaling Reinforcement Learning in a Generator-Discriminator Framework [49.531001563853984]
  RAD-2 is a unified generator-discriminator framework for closed-loop planning.<n>It produces diverse trajectory candidates, while an RL-optimized discriminator reranks these candidates according to their long-term driving quality.<n>It reduces the collision rate by 56% compared with strong diffusion-based planners.
  arXiv  Detail & Related papers  (2026-04-16T17:59:44Z)
• Amortizing Trajectory Diffusion with Keyed Drift Fields [2.5352713493505785]
  Keyed Drifting Policies is a one-step trajectory generator trained with a drift-field objective.<n>It repels generated trajectories toward condition-matched dataset windows.<n>It achieves strong performance with one-step inference and substantially lower planning latency than diffusion sampling.
  arXiv  Detail & Related papers  (2026-03-14T17:56:15Z)
• ResAD: Normalized Residual Trajectory Modeling for End-to-End Autonomous Driving [64.42138266293202]
  ResAD is a Normalized Residual Trajectory Modeling framework.<n>It reframes the learning task to predict the residual deviation from an inertial reference.<n>On the NAVSIM benchmark, ResAD achieves a state-of-the-art PDMS of 88.6 using a vanilla diffusion policy.
  arXiv  Detail & Related papers  (2025-10-09T17:59:36Z)
• NoTVLA: Narrowing of Dense Action Trajectories for Generalizable Robot Manipulation [54.87964060934928]
  Vision-Language-Action (VLA) models confront critical barriers to real-world deployment, most notably catastrophic forgetting.<n>We propose the Narrowing of Trajectory VLA framework: a novel approach that narrows its focus to sparse trajectories.<n>NoTVLA achieves superior performance and generalization compared to pi0 while operating under two critical constraints.
  arXiv  Detail & Related papers  (2025-10-04T18:26:55Z)
• Centaur: Robust End-to-End Autonomous Driving with Test-Time Training [84.78837437133234]
  We propose Centaur, which updates a planner's behavior via test-time training without relying on hand-engineered rules or cost functions.<n>We develop a novel uncertainty measure, called Cluster Entropy, which is simple, interpretable, and compatible with state-of-the-art planning algorithms.
  arXiv  Detail & Related papers  (2025-03-14T17:59:41Z)
• Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction [82.72686460985297]
  We tackle the problem of estimating a Manhattan frame. We derive two new 2-line solvers, one of which does not suffer from singularities affecting existing solvers. We also design a new non-minimal method, running on an arbitrary number of lines, to boost the performance in local optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:03:25Z)
• Adaptive Selection of Informative Path Planning Strategies via Reinforcement Learning [6.015556590955814]
  "Local planning" approaches adopt various spatial ranges within which next sampling locations are prioritized to investigate their effects on the prediction performance as well as incurred travel distance. Experiments on use cases of temperature monitoring robots demonstrate that the dynamic mixtures of planners can not only generate sophisticated, informative plans but also ensure significantly reduced distances at no cost of prediction reliability.
  arXiv  Detail & Related papers  (2021-08-14T21:32:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.