相关论文: A Covering Pursuit Game

In this paper, a pursuit-evasion game of two players known as the game of two identical cars is examined. It is assumed that the game proceeds on a two-dimensional plane. Both players have constant speeds and limited turn radii. The goal of…

We consider a patrolling game on a graph recently introduced by Alpern et al. (2011) where the Patroller wins if he is at the attacked node while the attack is taking place. This paper studies the periodic patrolling game in the case that…

This paper presents an algorithm to deploy a team of {\it free} guards equipped with omni-directional cameras for tracking a bounded speed intruder inside a simply-connected polygonal environment. The proposed algorithm partitions the…

In the classic version of the game of firefighter, on the first turn a fire breaks out on a vertex in a graph $G$ and then $k$ firefighters protect $k$ vertices. On each subsequent turn, the fire spreads to the collective unburnt…

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 provide a game theoretic framework for the game of cops and robbers (CR). Within this framework we study certain assumptions which underlie the concepts of optimal strategies and capture time. We also point out a connection of these…

Several variants of the cops and robbers (CR) game have been studied in the past. In this paper we examine a novel variant, which is played between two cops, each one independently trying to catch a "passive robber". We will call this the…

Various models to quantify the reliability of a network have been studied where certain components of the graph may fail at random and the probability that the remaining graph is connected is the proxy for reliability. In this work we…

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…

Mohar recently adapted the classical game of Cops and Robber from graphs to metric spaces, thereby unifying previously studied pursuit-evasion games. He conjectured that finitely many cops can win on any compact geodesic metric space, and…

This paper addresses a multi-pursuer single-evader pursuit-evasion game where the free-moving evader moves faster than the pursuers. Most of the existing works impose constraints on the faster evader such as limited moving area and moving…

In the Localization game played on graphs, a set of cops uses distance probes to identify the location of an invisible robber. We present an extension of the game and its main parameter, the localization number, to directed graphs. We…

Hopping forcing is a single player combinatorial game in which the player is presented a graph on $n$ vertices, some of which are initially blue with the remaining vertices being white. In each round $t$, a blue vertex $v$ with all…

We adapt the Gy\'{a}rf\'{a}s path argument to prove that $t-2$ cops can capture a robber, in at most $t-1$ moves, in the game of cops and robbers played in a graph that does not contain the $t$-vertex path as an induced subgraph.

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…

This paper investigates a pursuit-evasion problem involving three agents: a pursuer, an evader, and a defender. Cooperative guidance laws are developed for the evader-defender team that guarantee interception of the pursuer by the defender…

We investigate the computational complexity of deciding whether k cops can capture a robber on a graph G. In 1995, Goldstein and Reingold conjectured that the problem is EXPTIME-complete when both G and k are part of the input; we prove…

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,…

The localization game is played by two players: a Cop with a team of $k$ cops, and a Robber. The game is initialised by the Robber choosing a vertex $r \in V$, unknown to the Cop. Thereafter, the game proceeds turn based. At the start of…

We consider a search and rescue game introduced recently by the first author. An immobile target or targets (for example, injured hikers) are hidden on a graph. The terrain is assumed to dangerous, so that when any given vertex of the graph…