Applying the Pebble Motion problem: studying the feasibility of the Train Unit Shunting Problem

Multi-Agent Pathfinding with Matching using Increasing Cost Tree Search

Solving Multi-Agent Pathfinding with Matching using A*+ID+OD

Matching in Multi-Agent Pathfinding using M*

Multi-Agent Pathfinding with Matching using Enhanced Partial Expansion A*

Adapting CBM to optimize the Sum of Costs

Analysis of the influence of graph characteristics on MAPFW algorithm performance

Multi-agent pathfinding with waypoints using Branch-Price-and-Cut

Extending CBS to efficiently solve MAPFW

Extending the Multi-Label A* Algorithm for Multi-Agent Pathfinding with Multiple Waypoints