相关论文: Lion and Man Game in Compact Spaces

This paper is concerned with continuous-time pursuit and evasion games. Typically, we have a lion and a man in a metric space: they have the same speed, and the lion wishes to catch the man while the man tries to evade capture. We are…

In this paper we analyze, based on an interplay between ideas and techniques from logic and geometric analysis, a pursuit-evasion game. More precisely, we focus on a uniform betweenness property and use it in the study of a discrete lion…

We consider the Lion and Man game, i.e., a two-person pursuit-evasion game with equal players' top speeds. We assume that capture radius is positive and chosen in advance. The main aim of the paper is describing pursuer's winning strategies…

In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restictive capture condition: a…

A lion and a man move continuously in a space $X$. The aim of the lion is to capture his prey while the man wants to escape forever. Which of them has a strategy? This question has been studied for different metric domains. In this article…

This paper focuses on the relation between the fixed point property for continuous mappings and a discrete lion and man game played in a strongly convex domain. Our main result states that in locally compact geodesic spaces, the compactness…

Suppose an escaping player ("human") moves continuously at maximum speed $1$ in the interior of a region, while a pursuing player ("zombie") moves continuously at maximum speed $r$ outside the region. For what $r$ can the first player…

We study a turn-based game in a simply connected polygonal environment $Q$ between a pursuer $P$ and an adversarial evader $E$. Both players can move in a straight line to any point within unit distance during their turn. The pursuer $P$…

We consider a variant of a pursuit and evasion game studied independently by Britnell and Wildon as well as Haslegrave. In their game, a cat has to catch an invisible mouse that moves along the edges of some graph $G$. In our version, the…

We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\ell}$. The players have full information about the environment and the location…

We study computability-theoretic aspects of differential games. Our focus is on pursuit and evasion games played in Euclidean spaces in the tradition of Rado's "Lion versus Man" game. In some ways, these games can be viewed as continuous…

We consider the following generalization of the classical pursuit-evasion problem, which we call k-capture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an m-dimensional Euclidean space, the…

We study the following question dating back to J.E. Littlewood (1885-1977): Can two lions catch a man in a bounded area with rectifiable lakes? The lions and the man are all assumed to be points moving with at most unit speed. That the…

This paper focuses on the relation among the existence of different types of curves (such as directional ones, quasi-geodesic or geodesic rays), the (approximate) fixed point property for nonexpansive mappings, and a discrete lion and man…

This paper investigates obstacle-free simple motion pursuit-evasion problems where the pursuer is faster and game termination is point capture. It is well known that the interior of the Apollonius Circle (AC) is the evader's dominance…

We study a simple motion differential game of many pursuers and one evader in the plane. We give a nonempty closed convex set in the plane, and the pursuers and evader move on this set. They cannot leave this set during the game. Control…

This paper studies a multiplayer reach-avoid differential game in the presence of general polygonal obstacles that block the players' motions. The pursuers cooperate to protect a convex region from the evaders who try to reach the region.…

Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among $n$ discrete locations, and the searcher successively visits individual locations until finding the hider. Known to both players, a search at…

We revisit the two-player planar target-defense game initially posed by Isaacs where a pursuer (or defender) attempts to guard a target set from an attack by an evader (or attacker). This paper builds on existing analytical solutions to…

This paper presents a novel strategy for a multi-agent pursuit-evasion game involving multiple faster pursuers with heterogenous speeds and a single slower evader. We define a geometric region, the evader's safe-reachable set, as the…