In search and rescue operations, an efficient search path, colloquially understood as a path
maximizing the probability of finding survivors, is more than a path planning problem …

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 …

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 …

In this letter, we consider the Multi-Robot Efficient Search Path Planning (MESPP) problem,
where a team of robots is deployed in a graph-represented environment to capture a moving …

Perfectly suited for natural or man-made emergency and disaster management situations
such as flood, earthquakes, tornadoes, or tsunami, multi-target search path planning for a …

Panic-buying and shortages of essential commodities is common during early phases of a
disaster or an epidemic. The goal of this paper is develop a methodology which includes …

As discrete multi-agent static open-loop target search path planning known to be
computationally hard recently proved to be solvable in practice in the homogeneous case …

When searching for a dynamic target in an unknown real world scene, search efficiency is
greatly reduced if users lack information about the spatial structure of the scene. Most target …

We are interested in the coverage path planning problem with imperfect sensors, within the
context of robotics for mine countermeasures. In the studied problem, an autonomous …