This paper surveys recent results in pursuit-evasion and autonomous search relevant to
applications in mobile robotics. We provide a taxonomy of search problems that highlights …

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 …

Search and rescue path planning is known to be computationally hard, and most techniques
developed to solve practical size problems have been unsuccessful to estimate an optimality …

Unmanned aerial vehicles (UAVs) have been used extensively for search and rescue
operations, surveillance, disaster monitoring, attacking terrorists, etc. due to their growing …

We formulate and solve a discrete‐time path‐optimization problem where a single searcher,
operating in a discretized three‐dimensional airspace, looks for a moving target in a finite …

This paper formulates and proposes a discrete solution for the problem of finding a lost
target under uncertainty in minimum time (Minimum Time Search). Given a searching region …

We consider a discrete time‐and‐space route‐optimization problem across a finite time
horizon in which multiple searchers seek to detect one or more probabilistically moving …

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 …

This article considers a sensor management problem where a number of road bounded
vehicles are monitored by an unmanned aerial vehicle (UAV) with a gimballed vision …

We describe a genetic algorithm (GA) for designing efficient search paths, against a moving
target, in complicated environments. The immediate application is acoustic search for …