Lab11 - Game Theory in Robotics

A problem in computer science where a set of pursuers is trying to catch a set of evaders.

In greedy policy the next-best state is selected in each discrete step of the game simulation without considering longer prediction horizon.
Usual policies incorporate distances between individual agents as follows:

• For evaders select the most distant node to all pursuers
• For pursuers select the closest node to the closest evader

1. Implement a greedy policy according to the above-described rules
2. Note, you can improve the performance of the algorithm by employing more efficient distance function calculation method (e.g. Floyd-Warshall)
3. Submit archived player.py and planner.py classes into the BRUTE upload system