Günter Rote
ABSTRACT
We consider a game between two persons where one person tries to chase the other, but the pursuer only knows an approximation of the true position of the fleeing person. The two players have identical constraints on their speed. It turns out that the fugitive can increase his distance from the pursuer beyond any limit. However, when the speed constraints are given by a polyhedral metric, the pursuer can always remain within a constant distance of the other person.We apply this problem to buffer minimization in an online scheduling problem with conflicts.
Index Terms
- Pursuit-evasion with imprecise target location
Recommendations
Uncertain pursuit-evasion game
AbstractPursuit-evasion game deals with the situation in which a pursuer tries to catch an evader. Taking into account the subjectivity of the players’ strategies and the fact that the noise of system state does not obey the statistical regularity, this ...
Two coupled pursuit-evasion games in target-attacker-defender problem
2017 IEEE 56th Annual Conference on Decision and Control (CDC)This paper addresses a differential game with three players: a target, an attacker and a defender, where the Attacker aims to capture the Target while avoiding being captured by the Defender, and the Defender tries to defend the Target from being captured ...
Pursuit-evasion games in the presence of obstacles
This paper studies planar pursuit-evasion games in the presence of obstacles that inhibit the motions of the players. The goal is to construct the dominance regions, where a point in the plane is said to be dominated by one of the players if that player ...
Comments