The problem the researchers tackle is one of the hardest in modern automation. Traditional assembly lines are inherently linear and sequential, which limits the flexibility that adaptive production sites demand. Multi-agent systems promise a paradigm shift toward decoupled, smart manufacturing, where autonomous agents dynamically transport components and allow customized, non-linear process chains. But coordinating many agents on a shared plane raises a computational challenge known as Multi-Agent Path Finding, or MAPF: every agent must reach its target while avoiding collisions with static obstacles and with each other, ideally while minimizing total travel time or the overall makespan. Existing MAPF algorithms can generate collision-free paths on paper, yet they typically lack real-time monitoring and cannot adapt to dynamic changes such as a malfunctioning or blocked agent.

The team’s testbed was a magnetic planar drive system from Beckhoff Automation, the XPlanar, consisting of a stationary stator built from modular tiles and movable transport units called movers. The stator’s conductor coils generate electromagnetic fields that interact with permanent magnets inside the movers, enabling precise, frictionless, multi-directional movement. The demonstrator used a grid of three-by-four stator tiles with four movers, each acting as an independent agent, controlled via a Beckhoff PLC in the TwinCAT environment. By adding stations for tasks like pipetting liquids and visual inspection, the platform can implement adaptive processes that require flexible modification of mover paths, making it an ideal proving ground for motion planning research.

At the heart of the CB-MPC framework sits Conflict-Based Search, a well-established optimal algorithm for MAPF that works on two levels. At the high level, it performs a best-first search on a conflict tree, where each node contains a set of constraints and the current path solution. At the low level, an A* algorithm computes individual paths that satisfy those constraints. When two agents are found to occupy the same grid vertex at the same time, the algorithm branches, adding a constraint that forbids one agent from occupying that vertex at that moment, and the search continues until all paths are conflict-free and total cost is minimized. Because the number of conflicts grows exponentially with agent count, the team enhanced the basic algorithm with two accelerators: disjoint splitting, which uses paired positive and negative constraints that cannot both be satisfied simultaneously, thereby pruning the search tree, and a dependency graph heuristic. In simulation tests across three grid sizes, the dependency graph heuristic combined with disjoint splitting delivered the highest efficiency in every scenario tested.

But raw pathfinding is only half the story. The discrete waypoints produced by CBS can contain abrupt transitions and extreme acceleration changes that no real machine could follow comfortably. The framework therefore feeds these waypoints into a minimum jerk trajectory optimizer, which minimizes the integral of squared jerk, the third derivative of position, over the trajectory duration. The calculus of variations shows that the optimal solution must be a polynomial of at most fifth order, whose coefficients are chosen to satisfy boundary conditions on position, velocity and acceleration at the start and end times. The result is a smooth, dynamically feasible reference trajectory for every agent, an essential property when transporting delicate items such as biological samples or precision components that must not be jolted.

The final piece is a centralized model predictive controller, built with the open-source acados software package, that executes the smoothed trajectories in real time. Each mover is modeled with double integrator dynamics, essentially a point-mass model in a two-dimensional plane, with positions and velocities as state variables and accelerations as control inputs. The controller solves a time-discretized optimal control problem every sampling step, penalizing deviations from the reference trajectory while enforcing box constraints on acceleration, limited to plus or minus 150 mm/s², and speed, limited to 250 mm/s. Crucially, it also imposes Euclidean-distance collision avoidance constraints, ensuring that no two movers ever come closer than a minimum safe distance of 200 millimeters. Because these constraints make the optimization problem non-convex and NP-hard, the controller uses sequential quadratic programming with a real-time iteration scheme, solving quadratic subproblems with the HPIPM solver so that a feasible control action is available within each sampling interval.

Getting all of this to run on industrial hardware required careful engineering. The pathfinding algorithm runs in Python and communicates with the TwinCAT PLC environment through Beckhoff’s Automation Device Specification protocol, exchanging tile layouts, mover dimensions, binary obstacle maps, start and target positions, and ultimately the computed waypoints. The controller code was generated from Simulink models into C, wrapped as an S-function, and deployed onto the PLC via automatic code generation, producing a real-time function block that encapsulates the entire CMPC algorithm. Slack variables with penalty terms were included in the optimization so that the solver never becomes completely infeasible under unpredictable real-world conditions, a pragmatic safeguard that keeps the system running on actual hardware.

The experimental validation covered ten scenarios of varying complexity, from simple routing tasks to fiendishly difficult ones, including a case where only a single feasible solution existed. Every scenario was solved and executed successfully, a 100 percent success rate. The pathfinding computation times ranged from 0.014 seconds for the easiest scenarios to 848.343 seconds for the hardest, reflecting how quickly MAPF complexity explodes when agents must swap positions in tight spaces or when bottlenecks restrict the solution space. Meanwhile, the model predictive controller kept a remarkably stable average computation time of around 20 milliseconds per cycle, and the total makespan for executing the planned motions ranged from 16 to 39.1 seconds across the scenarios.

Perhaps the most striking result came from the disturbance tests. In a second series of runs, the researchers manually held one mover in place for a few seconds before releasing it, simulating an external disruption. In every scenario, the framework absorbed the disturbance without a single collision or error. Other agents adjusted as needed, and once the blockage was cleared, the paths were completed identically to the undisturbed trials, with the makespan extended only by the duration of the interruption. This proof of principle shows that pairing offline optimal path planning with online predictive control delivers exactly the resilience that adaptive production sites need: guarantees from the planner, adaptability from the controller.

The authors are candid about the limits. Scalability is the greatest weakness: as agents are added, collision constraints grow quadratically, and supplementary simulations showed average controller computation times ballooning exponentially from 19.7 milliseconds with four movers to 2,866.9 milliseconds with ten movers, which would drastically inflate the makespan. Long pathfinding times also emerge whenever free space is scarce or bottlenecks force agents to detour far from their destinations, suggesting that layout design, possibly informed by traffic heatmaps of tile occupancy, could significantly improve solution speed. The researchers also note that no direct comparison with other established MAPF approaches was made, leaving quantitative benchmarking to future work. Still, the study demonstrates that optimal solvers, often dismissed as too slow for practice, can be engineered into a working industrial system, and that the marriage of conflict-based search with model predictive control offers a practical blueprint for the collision-free, self-organizing factories of the near future.

Subject of Research: Real-time multi-agent path finding and collision avoidance using conflict-based model predictive control on a magnetic planar drive system

Article Title: Conflict-based model predictive control for multi-agent path finding experimentally validated on a magnetic planar drive system

Article References: Conflict-based model predictive control for multi-agent path finding experimentally validated on a magnetic planar drive system. (n.d.). https://doi.org/10.3389/fcteg.2025.1645918

Image Credits: AI Generated

DOI: 10.3389/fcteg.2025.1645918

Keywords: multi-agent path finding, conflict-based search, model predictive control, collision avoidance, planar drive system, magnetic levitation transport, smart manufacturing, trajectory optimization, Industry 4.0, multi-agent systems, production intralogistics, control engineering