This work presents NeurRAFT, a generative planning framework based on anchor-level flow matching and clearance-aware preference tuning that operates on compact anchor waypoints, and directly reshape the pretrained planner's distribution toward safer solutions without augmenting inference.
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/.
This report adopts a two-piece MINCO parameterization, trading time for smoothness without altering the trajectory's spatial profile, and replaces score regression with a ranking loss, preventing small score errors from reordering the candidate set.
A training-free diffusion-based motion planner that replaces learned global trajectory scores with analytical local scores derived from obstacle, smoothness, velocity, and inter-agent feasibility terms, which yields a decomposed denoising procedure that retains the optimization structure of classical trajectory methods...
Michael Y. Fatemi, Jin-Hao Liang, Ferdinando Fioretto· 0 citations
PASSAGE, a perception-conditioned planner--tracker framework for humanoid traversal, using virtual reality and inertial motion capture to collect 100 h of scene-aligned human motion across 1,500 cluttered scenes and tests across 50 unseen physical layouts demonstrate traversal without prebuilt maps or offboard computat...
Yuxuan Ma, Zi-Cheng Zeng, Chun-Li Peng et al.· 1 citation
Topological visual navigation is attractive for biologically-inspired robots because it requires only a monocular camera and can be transferred to robots unseen during training, without dense maps or expensive sensors. Yet many systems rely on waypoint-only open-loop following: even when velocity commands are published...
Seunghyun Lim, Jeyoung Park, Junmo Yang et al.· IEEE Robotics and Automation...· 0 citations
Generative robotic motion planning requires synthesizing smooth, collision-free trajectories that remain feasible across diverse tasks and dynamic constraints. Prior planners, both traditional and generative, often struggle to couple high-level semantics with low-level constraints, especially the link between task conf...
Khang Nguyen, M. Vu· 2026 IEEE 22nd International...· 1 citation
Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While traditional grid-based planners efficiently find collision-free paths, their reliance on stop-and-turn mechanics over $2^k$-connected grids produ...
Marat Agranovskiy· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.