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 …

Analytical and discrete optimization approaches for routing an aircraft in a threat
environment have been developed. Using these approaches, an aircraft's optimal risk …

The deterministic problem for finding an aircraft's optimal risk trajectory in a threat
environment has been formulated. The threat is associated with the risk of aircraft detection …

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 …

A cooperative system is defined to be multiple dynamic entities that share information or
tasks to accomplish a common, though perhaps not singular, objective. Examples of …

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 propose a new heuristic for the single-searcher path-constrained discrete-time
Markovian-target search. The algorithm minimizes an approximate, instead of exact …

A target moves among a finite number of cells according to a discrete-time homogeneous
Markov chain. The searcher is subject to constraints on the search path, ie, the cells …

Minimizing the risk of detection in a hostile environment is a fundamental requirement of all
military operations. Often the trajectory of a vehicle is dependent on other factors such as …

Two formulations for determining the minimal risk path of a vehicle through a minefield are
considered and compared. Firstly, by following a calculus of variations argument a system of …