Warebots: Multi Agent Path Finding
The project explores the Multi-Agent Pathfinding (MAPF) problem, focusing on one-shot MAPF and its dynamic counterpart, Lifelong MAPF (LMAPF). It delves into the Conflict-Based Search Algorithm (CBS), a two-level approach for resolving conflicts between agents, showcasing its effectiveness in small-scale environments inspired by the League of Robot Runners competition.