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

The core challenge the researchers set out to solve is twofold. First, aircraft are not free-floating points; they are large, elongated vehicles with real geometry, and they cannot slide sideways or pivot on the spot. Their motion is governed by what roboticists call nonholonomic kinematic constraints, meaning the direction a plane can travel at any instant is tied to the orientation of its nose. Second, when multiple aircraft move at once, their paths and schedules must not intersect in ways that produce collisions, either at the same moment or in sequence as one plane follows another through shared deck space. A planner that ignores either requirement produces trajectories that look elegant on paper but are physically impossible or outright dangerous.

Existing approaches tend to sacrifice one requirement for the other. Classical multi-agent path planning methods, which treat aircraft as abstract tokens moving on a grid or graph, can schedule many agents efficiently but produce paths a real aircraft could never follow, with sharp turns and instantaneous changes of direction. Conversely, kinodynamic planners that respect vehicle dynamics often struggle to coordinate many vehicles at once, because the search space explodes combinatorially as agents are added. The theoretical difficulty is well documented: optimal multi-robot path planning on graphs is computationally intractable in the general case, which has pushed the field toward clever approximations rather than exhaustive search.

HA-SIPP attacks the problem by fusing two established techniques, each compensating for the other’s blind spots. The first ingredient is Hybrid A*, a search algorithm beloved in autonomous driving because it searches over discretized states while propagating motion primitives that obey the vehicle’s actual turning behavior. This ensures every candidate trajectory is something a nosewheel-steering aircraft could genuinely execute. The second ingredient is Safe Interval Path Planning, or SIPP, a framework designed for planning through environments where obstacles appear and disappear over time. SIPP compresses time into safe intervals, windows during which a given region of space is guaranteed to be free of other agents, allowing a single planner to route one vehicle after another through a shared, dynamic map without re-planning everything from scratch.

Embedding Hybrid A* motion primitives inside the SIPP framework is the paper’s central move. The planner searches over a hybrid state space that captures both where an aircraft is and when it will be there, while the safe-interval structure keeps track of which portions of the deck are occupied by already-planned trajectories. When a potential conflict arises between a new trajectory and an existing one, the algorithm does not simply abandon the plan. Instead, it invokes a hybrid validation mechanism that operates on two levels: a fast, conservative screening step followed by a precise geometric certification.

That two-stage safety check is where the discrete-continuous philosophy becomes concrete. In the screening stage, the planner derives conservative collision time windows using the circumradii of the aircraft’s footprint envelopes, essentially circumscribing each aircraft within a circle whose radius guarantees containment of the vehicle’s full outline. If two such circumscribed circles cannot possibly overlap during a given time window, the planner can dismiss the conflict instantly and keep searching. Only when the cheap test flags a possible danger does the algorithm escalate to the second stage: an exact intersection check between the actual polygonal outlines of the two aircraft at the relevant moments. This layered design means the planner pays the computational cost of precise geometry only when it matters, while never certifying a trajectory as safe unless the true shapes have been verified against each other.

The collision model itself is also carefully engineered. Rather than inflating aircraft into oversized bounding circles, which wastes precious deck space and renders tight maneuvers infeasible, the researchers construct a polygon-based collision model that expands the aircraft’s actual geometric contour. The polygon preserves the elongated shape of a carrier aircraft, with its narrow nose and wider wingspan, so that clearance is assessed where the airframe really extends rather than where a crude envelope says it might. The authors note that this preserves shape characteristics while reducing unnecessary conservativeness, a seemingly modest refinement that translates directly into more feasible trajectories in the narrow corridors between deck edge, elevators, catapults and parked aircraft.

To evaluate the approach, the team ran experiments on representative flight-deck layouts with varying fleet sizes, all under fixed computational time budgets, a realistic constraint given that deck operations cannot wait indefinitely for a planner to finish thinking. The results showed that HA-SIPP improved both planning success rates and trajectory feasibility compared with traditional SIPP-based algorithms, and delivered more reliable multi-aircraft conflict avoidance. In practical terms, the hybrid planner was more often able to find complete, executable taxi plans for all aircraft within the allotted time, and the plans it produced were more likely to respect both the kinematic limits of the vehicles and the safety separations demanded by a crowded deck.

The significance of this work extends beyond the carrier deck. The same mathematical structure, kinematically constrained vehicles sharing a confined, time-varying space, describes automated airport ground movement, warehouse fleets of autonomous tugs, and any setting where large vehicles must be marshaled efficiently through tight quarters. The paper situates itself within a rich literature spanning multi-agent path finding with continuous time, prioritized planning for differential-drive robots, and cooperative dispatch frameworks for carrier aircraft, and its contribution is a pragmatic synthesis: keep the scheduling power of safe-interval reasoning, keep the physical realism of hybrid motion primitives, and bind them together with a collision-checking pipeline that is conservative where cheap and exact where necessary.

Challenges remain before such algorithms guide real steel on a real deck. The study is computational, demonstrated on representative layouts rather than at sea, and the authors state that the code is available from the corresponding author on reasonable request, inviting replication and refinement. Real deck operations involve human directors, traction vehicles, weather, and uncertainty in taxi times, factors that the deterministic planner does not fully capture. Yet the direction of travel is clear. As navies pursue autonomous dispatch and as ports and airports automate ground handling, planners like HA-SIPP, which refuse to trade physical feasibility for scheduling convenience, will define the safety envelope within which machines and aircraft share the world’s most congested pavements. The work was partially supported by the National Natural Science Foundation of China under Grant 52171299, and the authors report no conflict of interest.

Subject of Research: Multi-aircraft taxi trajectory planning on aircraft carrier flight decks using hybrid discrete-continuous path planning

Article Title: A Hybrid Discrete-Continuous Strategy for Multi-aircraft Trajectory Planning on Flight Deck

Article References: Fu, W., & Zhu, Q. (2026). A Hybrid Discrete-Continuous Strategy for Multi-aircraft Trajectory Planning on Flight Deck. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01243-2

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01243-2

Keywords: aircraft carrier deck, multi-aircraft taxi planning, trajectory planning, Hybrid A*, Safe Interval Path Planning, collision avoidance, kinematic constraints, nonholonomic motion, multi-agent path finding, autonomous dispatch, motion planning, aerospace engineering