Multi-agent pathfinding
Multi-agent pathfinding, or MAPF for short, is a pathfinding problem. Given a maze and a set of agents, the goal is to find a path for each agent from his start location to its goal location. On this path agents agents may never bump into each other. Rumour has it that agents bumping into each other can have tragic consequences.
This website was created as a tool to compare MAPF solvers made by our research group, for our research project at the TU Delft. On this site you can find benchmarks that test MAPF solvers, and compare the results of different algorithms.
Please check out the Help page. Here you can find more information about MAPF, and help with submitting your own solutions.
Happy solving!
- Stef, Noah and Jonathan :)