相关论文: The Cat and the Noisy Mouse

In this paper we consider a pursuit-evasion game on a graph. A team of cats, which may choose any vertex of the graph at any turn, tries to catch an invisible mouse, which is constrained to moving along the vertices of the graph. Our main…

A cat and mouse play a pursuit and evasion game on a connected graph $G$ with $n$ vertices. The mouse moves to vertices $m_1,m_2,\dots$ of $G$ where $m_i$ is in the closed neighbourhood of $m_{i-1}$ for $i\geq2$. The cat tests vertices…

This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At each time step the second player guesses a vertex, winning if…

The game of Cat Herding is one in which cat and herder players alternate turns, with the evasive cat moving along non-trivial paths between vertices, and the herder deleting single edges from the graph. Eventually the cat cannot move, and…

The optimal strategies to catch a randomly walking cat in various environments are presented. All games have a player that opens a box at step $i$. If the cat is in this box the player wins, if not, the cat moves randomly to an adjacent…

The pursuit-evasion game with two persons is considered. Both players are moving in a metric space, have equal maximum speeds and complete information about the location of each other. We study the sufficient conditions for a capture (with…

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…

Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any…

We consider a variation of a cops and robbers game in which the cop---here referred to as "hunter"---is not constrained by the graph but must play in the dark against a "mole." We characterize the graphs---which we will call…

This paper investigates a partial-information pursuit evasion game in which the Pursuer has a limited-range sensor to detect the Evader. Given a fixed final time, we derive the optimal evasion strategy for the Evader to maximize its…

We introduce the game of Cat Herding, where an omnipresent herder slowly cuts down a graph until an evasive cat player has nowhere to go. The number of cuts made is the score of a game, and we study the score under optimal play. In this…

The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others' initial locations, but can only communicate if they are on the…

We propose a decentralized solution for a pursuit-evasion game involving a heterogeneous group of rational (selfish) pursuers and a single evader based on the framework of potential games. In the proposed game, the evader aims to delay (or,…

We consider a class of pursuit-evasion differential games in which the evader has continuous access to the pursuer's location, but not vice-versa. There is an immobile sensor (e.g., a ground radar station) that can sense the evader's…

We consider a class of pursuit-evasion differential games in which the evader has continuous access to the pursuer's location, but not vice-versa. There is a remote sensor (e.g., a radar station) that can sense the evader's location upon a…

We study a pursuit-evasion game between two players with car-like dynamics and sensing limitations by formalizing it as a partially observable stochastic zero-sum game. The partial observability caused by the sensing constraints is…

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…

This paper studies a two-person linear-quadratic-Gaussian pursuit-evasion differential game with costly but controlled information. One player can decide when to observe the other player's state. However, one observation of another player's…

Pursuit and evasion conflicts represent challenging problems with important applications in aerospace and robotics. In pursuit-evasion problems, synthesis of intelligent actions must consider the adversary's potential strategies.…

A new surveillance-evasion differential game is posed and solved in which an agile pursuer (the prying pedestrian) seeks to remain within a given surveillance range of a less agile evader that aims to escape. In contrast to previous…