We study the visibility-based pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can move arbitrarily fast. Our goal is to develop techniques for coordinating teams of robots to execute this task in application domains such as clearing a building, for reasons of security or safety. To this end,...

This paper presents a method to address the pursuit-evasion problem which incorporates the behaviors of the opponent, in which a continuous-time Markov decision process (CTMDP) model is introduced, where the significant difference from Markov decision process (MDP) is that the influence of the transition time between the states is taken into account. By introducing the concept of situation, the...

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

We extend the adversarial/non-stochastic multi-play multi-armed bandit (MPMAB) to case where number of arms play is variable. The work motivated by fact that resources allocated scan different critical locations in an interconnected transportation system change dynamically over time and depending on environment. By modeling malicious hacker intrusion monitoring as attacker defender, respectivel...

This work deals with the problem of navigation while avoiding detection by a mobile adversary, which is a novel variant of pursuit-evasion featuring adversarial modeling. In this problem, an evading agent is placed on a graph, where one or more nodes are defined as safehouses. The agent’s goal is to find a path from its current location to a safehouse, while minimizing the probability of meetin...

We propose a framework for reactive motion and sensing planning based on critical events. A critical event amounts to crossing a critical curve, which divides the environment. We have applied our approach to two different problems: i) object finding and ii) pursuit-evasion. We claim that the proposed framework is in general useful for reactive motion planning based on information provided by se...

Purpose: the article seeks to show frontline employee sensemaking in service encounters. The purpose is to reveal the processual nature of the dysfunctional behaviour category and to point out the dilemmas that organizations face when drawing the line between what is acceptable and what is not. Methodology: the article focuses on fare evasion management in urban bus transport, and more specific...

We study versions of cop and robber pursuit-evasion games on the visibility graphs of polygons, and inside polygons with straight and curved sides. Each player has full information about the other player’s location, players take turns, and the robber is captured when the cop arrives at the same point as the robber. In visibility graphs we show the cop can always win because visibility graphs ar...