The path-constrained moving target search problem has been subject to research since
1979 and is still investigated due to its important application, namely: search missions. This …

The search theory open literature has paid little, if any, attention to the multiple‐searcher,
moving‐target search problem. We develop an optimal branch‐and‐bound procedure and …

The problem of searching for randomly moving targets such as children and submarines is
known to be fundamentally difficult, but finding efficient methods for generating optimal or …

This paper presents a novel search-path optimization method for moving target search by an
aerial vehicle, applicable to realistically sized search areas. For such missions, long …

Various recent events in the Mediterranean sea have shown the enormous importance of
maritime search-and-rescue missions. By reducing the time to find floating victims, the …

We consider an extension of the optimal searcher path problem (OSP), where a searcher
moving through a discretised environment may now need to spend a non-uniform amount of …

We consider a search for a target moving within a known indoor environment partitioned into
interconnected regions of varying sizes. The knowledge of target location is described as a …

Anti-submarine warfare (ASW) missions are the linchpin of maritime operations involving
effective allocation and path planning of scarce assets to search for, detect, classify, track …

In this paper, the problem of path planning for a ground search unit looking for an object of
unknown location is considered. As in the classical optimal searcher path problem, the …

Piracy on the high seas is a problem of world-wide concern. In response to this threat, the
US Navy has developed a visualization tool known as the Pirate Attack Risk Surface (PARS) …