A search is conducted for a target moving in discrete time among a finite number of cells
according to a known Markov process. The searcher must choose one cell in which to …

In this note we show that the problem of finding an optimal searcher path that maximizes the
probability of detecting a stationary target by the end of a fixed time is NP-complete. We also …

A topical collection on “Advances in Search and Rescue at Sea” has appeared in recent
issues of Ocean Dynamics following the latest in a series of workshops on “Technologies for …

We propose and study an iterative Forward And Backward (FAB) algorithm applicable to the
problem of computing optimal search plans when the target's motion is modeled by a …

This paper addresses a search planning and task allocation problem for a Unmanned Aerial
Vehicle (UAV) team that performs a search and destroy mission in an environment where …

This article is based on a talk that I gave at the 1988 TIMS/ORSA meeting in Washington, DC
about developments in search theory since the Lanchester Prize for 1975 was awarded to …

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 …

This book examines how to program artificial search agents so that they act optimally or
demonstrate the same behavior as predicted by the foraging theory for living organisms. It …

Let {X t, t≥ 0} be a stochastic process representing the motion of a target in Euclidean n-
space. Search effort is applied at the rate m (t)> 0 for 0≤ t≤ T, and it is assumed that this …

This paper presents research combining an agent-based modeling and simulation paradigm
with game theory for an in silico historical analysis of the Bay of Biscay submarine war …