Multi-agent path planning problem involves navigating units from their starting position to their respective goals, whilst going around any static obstacles and other moving units along the way.
The goal of this project is to develop a simulator that will help to observe the different behaviors of different multi-agent pathfinding algorithms, in both grid map environment, and real-map environment.
The algorithms that will be tested in this simulator will be all based on the basic A-star algorithm:
The goal of this project is to develop a simulator that will help to observe the different behaviors of different multi-agent pathfinding algorithms, in both grid map environment, and real-map environment.
The algorithms that will be tested in this simulator will be all based on the basic A-star algorithm:
- A-star (A*), by Peter Hart, Nils Nilsson, and Bertram Raphael, (1968)
- Hierarchical Cooperative A* (HCA*), by Silver, D. (2005).
- Cooperative Pathfinding, by Standley, T. (2010).
