Warebots: Multi Agent Path Finding


The approach centers around the Conflict-Based Search Algorithm (CBS), a novel method for resolving agent conflicts. CBS operates on two levels: a high level that forms a search tree for conflicts and a low level that finds paths for individual agents. The report compares CBS with traditional pathfinding algorithms, demonstrating its efficiency and scalability in dynamic environments.


Experimental results showcase CBS’s performance in two different environments: a random map and a warehouse map. These tests reveal the algorithm’s strength in handling complex multi-agent scenarios with minimal conflicts and delays. The warehouse map, simulating a real-world logistics scenario, particularly highlights CBS’s practical applicability in managing dynamic agent paths efficiently.

Read Full Report Here