This page is located in archive. Go to the latest version of this course pages. Go the latest version of this page.

Lab11 - Game Theory in Robotics

Motivations and Goals
Become familiar with pursuit-evasion scenario
Be able to establish a greedy policy for pursuit-evasion problem
Tasks (teacher)
Implement and verify the functionality of greedy policy for pursuit-evasion problem
Lab resources
Lab sripts: Task11 resource files

Pursuit Evasion

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

Greedy Policy

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 the closest pursuer
  • For pursuers select the closest node to the closest evader

Limitations of Greedy Policy

Find counterexamples where greedy policy will fail.

  • Based on euclidean distance
  • Based on shortest paths distance
courses/b4m36uir/labs/lab11.txt · Last modified: 2018/12/10 13:16 by cizekpe6