FlowMP: Learning Motion Fields for Robot Planning with Conditional Flow Matching

Khang Nguyen, An T. Le, Tien Pham, Manfred Huber, Jan Peters, Minh Nhat Vu

Abstract

In robot motion planning, generating trajectories that are both computationally efficient and physically feasible remains a significant challenge. While generative models like diffusion have shown promise in learning complex motion priors, they often suffer from slow inference speeds and produce "jerky" trajectories that neglect high-order dynamics. We present FlowMP, a motion planning framework based on Conditional Flow Matching (CFM). By explicitly modeling second-order dynamics and leveraging the efficiency of flow matching, FlowMP generates smooth, collision-free trajectories significantly faster than diffusion-based alternatives. Our experiments across 2D and 3D environments, as well as real-world robot deployments, demonstrate that FlowMP achieves a 100% success rate on long-horizon tasks and operates at sub-0.1 second inference speeds.

Introduction

For a robot to navigate from an initial state to a goal, the resulting path must be more than just a geometric line; it must be a physically executable trajectory. Traditional motion planning has long grappled with a "Goldilocks" problem. Optimization-based methods, such as CHOMP, provide precision but are prone to getting trapped in local minima. Conversely, sampling-based methods like RRT are robust but often produce jagged paths that require extensive post-processing to smooth.

Recent advancements in generative AI have introduced diffusion models as a way to learn motion priors from expert data. However, these models are computationally expensive due to their iterative denoising process and typically only model first-order dynamics (position and velocity). This often results in trajectories with sudden changes in acceleration—mathematically valid in a vacuum, but physically damaging or impossible for real-world robot hardware. FlowMP addresses these limitations by replacing diffusion with Conditional Flow Matching and incorporating acceleration-aware learning.

The FlowMP Framework

1. Conditional Flow Matching (CFM)

FlowMP shifts the generative paradigm from diffusion to CFM. Unlike diffusion models, which require a complex forward-noising process and many steps to recover a signal, CFM learns a continuous vector field (a motion field) that directly maps a simple noise distribution to the target trajectory distribution. This "simulation-free" training is more stable and allows for high-quality trajectory sampling in significantly fewer steps using standard ODE solvers like the 4th-order Runge-Kutta integrator.

2. Second-Order Dynamics and Smoothness

A critical innovation in FlowMP is the explicit modeling of higher-order physics. Instead of merely predicting a sequence of positions, the model is trained to learn velocity, acceleration, and jerk fields simultaneously. This ensures $C^2$ continuity, meaning the acceleration of the robot arm does not jump instantaneously. By treating acceleration as a core component of the learning process, the model develops an inherent "understanding" of the physical effort required for movement, acting as a natural regularizer against erratic motions.

3. B-Spline Representation

To maintain computational efficiency while ensuring geometric smoothness, FlowMP represents trajectories as B-splines. The model learns to manipulate the "via-points" (control points) of these splines. This representation naturally enforces a degree of smoothness and reduces the dimensionality of the planning problem, making it easier for the model to scale to complex, high-degree-of-freedom (DOF) robots.

Experimental Evaluation

The researchers evaluated FlowMP across three increasingly complex environments:

  • RobotPointMass (2D): A 2D maze navigation task requiring the avoidance of cluttered obstacles.
  • PandaSphere (3D): A simulated 7-DOF Franka Emika Panda robot arm navigating a 3D workspace with spherical obstacles.
  • Real-Robot Deployment: Testing on a Kinova Gen3 7-DOF manipulator to validate the physical feasibility of the generated trajectories in real-world settings.

Key Results and Insights

Superior Speed and Efficiency

FlowMP demonstrated remarkable inference speeds, achieving sub-0.1 seconds for 2D tasks and approximately 0.13 seconds for complex 3D planning. This represents a 2x speedup over state-of-the-art diffusion-based planners (such as MPD). Furthermore, the model is highly compact, requiring only 4.5 MB of parameters, which facilitates deployment on edge-computing robot controllers.

Robustness in Long-Horizon Planning

A significant finding was FlowMP's performance on long trajectories. While diffusion-based models often experience "mode collapse" or failure when planning for extended horizons (e.g., 256 steps), FlowMP maintained a 100% success rate. This stability is attributed to the continuous nature of the flow matching objective, which handles long-range dependencies more effectively than iterative denoising.

Physical Feasibility

Quantitative metrics confirmed that FlowMP's trajectories were significantly smoother than those produced by first-order models. By minimizing point-to-point slope variance through its acceleration-aware training, FlowMP produces motions that are ready for immediate execution on hardware without the need for additional smoothing layers.

Conclusion and Future Work

FlowMP represents a significant step forward in making generative motion planning practical for real-world robotics. By combining the efficiency of Conditional Flow Matching with a deep integration of second-order dynamics, it provides a fast, smooth, and robust alternative to existing diffusion models.

Future research will focus on reducing the dependency on "expert" data (currently generated via CMA-ES) and extending the framework to handle dynamic environments with moving obstacles. Additionally, integrating raw sensory inputs, such as point clouds or RGB-D data, directly into the flow matching process could pave the way for a truly end-to-end, vision-based motion planning system.

Summary updated

BibTeX
@inproceedings{nguyen2025flowmp,
  author = {Khang Nguyen and An T. Le and Tien Pham and Manfred Huber and Jan Peters and Minh Nhat Vu},
  title = {{FlowMP: Learning Motion Fields for Robot Planning with Conditional Flow Matching}},
  booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
  year = {2025},
  doi = {10.1109/iros60139.2025.11246537},
}
Figure