arXiv 1402.61362014-02-25cs.DM

The Role of Visibility in Pursuit / Evasion Games

Athanasios Kehagias, Dieter Mitsche, Pawel Pralat

英文摘要：

The cops-and-robber (CR) game has been used in mobile robotics as a discretized model (played on a graph G) of pursuit/evasion problems. The "classic" CR version is a perfect information game: the cops' (pursuer's) location is always known to the robber (evader) and vice versa. Many variants of the classic game can be defined: the robber can be invisible and also the robber can be either adversarial (tries to avoid capture) or drunk (performs a random walk). Furthermore, the cops and robber can reside in either nodes or edges of G. Several of these variants are relevant as models or robotic pursuit / evasion. In this paper, we first define carefully several of the variants mentioned above and related quantities such as the cop number and the capture time. Then we introduce and study the cost of visibility (COV), a quantitative measure of the increase in difficulty (from the cops' point of view) when the robber is invisible. In addition to our theoretical results, we present algorithms which can be used to compute capture times and COV of graphs which are analytically intractable. Finally, we present the results of applying these algorithms to the numerical computation of COV.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Finding a princess in a palace: A pursuit-evasion problem

This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied `Cops and Robbers Game', the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prince has a winning strategy, and determine, for each such graph, the minimum number of days the prince requires to guarantee to find the princess.

2012-04-24cs.DMmath.CO

Pursuit-evasion games on latin square graphs

We investigate various pursuit-evasion parameters on latin square graphs, including the cop number, metric dimension, and localization number. The cop number of latin square graphs is studied, and for $k$-MOLS$(n),$ bounds for the cop number are given. If $n>(k+1)^2,$ then the cop number is shown to be $k+2.$ Lower and upper bounds are provided for the metric dimension and localization number of latin square graphs. The metric dimension of back-circulant latin squares shows that the lower bound is close to tight. Recent results on covers and partial transversals of latin squares provide the up…

2021-09-29cs.DMmath.CO

Comparing the power of cops to zombies in pursuit-evasion games

We compare two kinds of pursuit-evasion games played on graphs. In Cops and Robbers, the cops can move strategically to adjacent vertices as they please, while in a new variant, called deterministic Zombies and Survivors, the zombies (the counterpart of the cops) are required to always move towards the survivor (the counterpart of the robber). The cop number of a graph is the minimum number of cops required to catch the robber on that graph; the zombie number of a graph is the minimum number of zombies required to catch the survivor on that graph. We answer two questions from the 2016 paper of…

2018-09-09cs.DMmath.CO

Selfish Cops and Active Robber: Multi-Player Pursuit Evasion on Graphs

We introduce and study the game of "Selfish Cops and Active Robber" (SCAR) which can be seen as an multiplayer variant of the "classic" two-player Cops and Robbers (CR) game. In classic CR all cops are controlled by a single player, who has no preference over which cop captures the robber. In SCAR, on the other hand, each of N-1 cops is controlled by a separate player, and a single robber is controlled by the N-th player; and the capturing cop player receives a higher reward than the non-capturing ones. Consequently, SCAR is an N-player pursuit game on graphs, in which each cop player has an i…

2018-09-12cs.DMcs.GT

Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor

We study zombies and survivor, a variant of the game of cops and robber on graphs. In this variant, the single survivor plays the role of the robber and attempts to escape from the zombies that play the role of the cops. The zombies are restricted, on their turn, to always follow an edge of a shortest path towards the survivor. Let $z(G)$ be the smallest number of zombies required to catch the survivor on a graph $G$ with $n$ vertices. We show that there exist outerplanar graphs and visibility graphs of simple polygons such that $z(G) = Θ(n)$. We also show that there exist maximum-degree-$3$ o…

2022-04-25cs.DMmath.CO

追逃博弈中的算法、难度与图积

Algorithms, hardness and graph products on a pursuit-evasion game

本文研究守卫先放置的$(s,d)$-间谍游戏，给出守卫数为常数时的多项式时间算法（对$P_4$-稀少性固定参数可解），并证明在二部图中该问题NP难。

2023-10-11cs.CCcs.DMmath.CO

更多相关论文收起更多论文

警察与强盗问题的参数化分析

Parameterized Analysis of the Cops and Robber Problem

本文针对警察与强盗问题在参数化复杂性下的难解性，研究以顶点覆盖数等结构参数为参数的算法，证明其属于FPT并构造指数核，同时给出多项式压缩的否定性证据，并将结果推广到多种变体。

2023-07-10cs.DM

Fully Active Cops and Robbers

We study a variation of the classical pursuit-evasion game of Cops and Robbers in which agents are required to move to an adjacent vertex on every turn. We explore how the minimum number of cops needed to catch the robber can change when this condition is added to the rules of the game. We study this `Fully Active Cops and Robbers' game for a number of classes of graphs and present some open problems for future research.

2018-08-21cs.DMmath.CO

Pursuit on a Graph under Partial Information from Sensors

We consider a class of pursuit-evasion problems where an evader enters a directed acyclic graph and attempts to reach one of the terminal nodes. A pursuer enters the graph at a later time and attempts to capture the evader before it reaches a terminal node. The pursuer can only obtain information about the evader's path via sensors located at each node in the graph; the sensor measurements are either green or red (indicating whether or not the evader has passed through that node). We first show that it is NP-hard to determine whether the pursuer can enter with some nonzero delay and still be g…

2016-09-13cs.DMmath.COmath.OC

Meyniel's conjecture on graphs of bounded degree

The game of Cops and Robbers is a well known pursuit-evasion game played on graphs. It has been proved \cite{bounded_degree} that cubic graphs can have arbitrarily large cop number $c(G)$, but the known constructions show only that the set $\{c(G) \mid G \text{ cubic}\}$ is unbounded. In this paper we prove that there are arbitrarily large subcubic graphs $G$ whose cop number is at least $n^{1/2-o(1)}$ where $n=|V(G)|$. We also show that proving Meyniel's conjecture for graphs of bounded degree implies a weak Meyniel's conjecture for all graphs.

2020-11-21cs.DMmath.CO

图上灭火问题的复杂性

Complexity of Firefighting on Graphs

Technical University of Munich（慕尼黑工业大学）；University of Bremen（不来梅大学）

研究图上灭火问题的复杂性，证明确定所需最少灭火器数量为m的问题是NP难的，并展示最短策略可能具有超多项式长度，同时将结果扩展到猎人与兔子游戏。

2026-04-14cs.CCcs.DM

The localization capture time of a graph

The localization game is a pursuit-evasion game analogous to Cops and Robbers, where the robber is invisible and the cops send distance probes in an attempt to identify the location of the robber. We present a novel graph parameter called the capture time, which measures how long the localization game lasts assuming optimal play. We conjecture that the capture time is linear in the order of the graph, and show that the conjecture holds for graph families such as trees and interval graphs. We study bounds on the capture time for trees and its monotone property on induced subgraphs of trees and …

2021-05-20cs.DMmath.CO