Robots use pursuit-evasion games for tasks like capturing a target or avoiding obstacles in changing environments. The graph represents the workspace.
Vertices are positions or configurations. Edges are feasible movements. Game-theoretic planning ensures the robot can achieve its goal even if the target moves adversarially. The cop and robber model directly applies: the robot is the cop, the target is the robber, and the graph is the discretized workspace.