Dynamic Multi-Agent Pathfinding

In multi-agent path finding (MAPF), multiple agents need to find paths from their respective locations to their goal locations, ensuring that the paths do not collide with obstacles or other moving agents. This problem is important for many applications, such as computer games, environmental monitoring, patrolling, multi-robot planning, etc. This project involves studying MAPF in a dynamic environment, using graph theory and AI methods.