In this paper, we consider one of the most important missing target search problems, in
which the bounded linear search interval has been divided into a number of small sub …

We introduce the study of search problems, in a setting in which the searcher has some
information, or hint concerning the hiding target. In particular, we focus on one of the …

The coordinated search method for a one-dimensional Brownian particle in the fluid is
investigated in this paper. This technique helps to remove pollutants and impurities from the …

We study search games between a mobile Searcher and an immobile Hider in which the
Searcher aims to minimize some payoff, which is either the time to find the Hider (the search …

We study the general setting of weighted search in which a number of weighted targets are
hidden in a star-like environment, and a mobile searcher must locate a subset of targets with …

We consider a discrete search problem to detect a hidden target on one of the M-intersected
real lines at the origin. The target position is a vector of independent random variables with a …

We introduce a discrete-time search game, in which two players compete to find an invisible
object first. The object moves according to a time-varying Markov chain on finitely many …

A Searcher wants to find the Home node on a given Network, but his directions are
unreliable. At every branch node of a network Q, a Satnav (GPS) points to the arc leading to …

We study routing and searching decisions of a search-and-detection (SDT) team on a road
network under online uncertainty setting. Given an undirected edge-weighted bounded …

This paper presents a booby trap game played between a defender and an attacker on a
search space, which may be a compact subset of Euclidean space or a network. The …