Hierarchical visibility for guaranteed search in large-scale outdoor terrain

  • Authors:

  • A. Kleiner;A. Kolling;M. Lewis;K. Sycara

  • Affiliations:

  • Computer Science Department, University of Freiburg, Freiburg, Germany 79110;School of Information Sciences, University of Pittsburgh, Pittsburgh, USA 15260;School of Information Sciences, University of Pittsburgh, Pittsburgh, USA 15260;Robotics Institute, Carnegie Mellon University, Pittsburgh, USA 15213

  • Venue:
  • Autonomous Agents and Multi-Agent Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Searching for moving targets in large environments is a challenging task that is relevant in several problem domains, such as capturing an invader in a camp, guarding security facilities, and searching for victims in large-scale search and rescue scenarios. The guaranteed search problem is to coordinate the search of a team of agents to guarantee the discovery of all targets. In this paper we present a self-contained solution to this problem in 2.5D real-world domains represented by digital elevation models (DEMs). We introduce hierarchical sampling on DEMs for selecting heuristically the close to minimal set of locations from which the entire surface of the DEM can be guarded. Locations are utilized to form a search graph on which search strategies for mobile agents are computed. For these strategies schedules are derived which include agent paths that are directly executable in the terrain. Presented experimental results demonstrate the performance of the method. The practical feasibility of our approach has been validated during a field experiment at the Gascola robot training site where teams of humans equipped with iPads successfully searched for adversarial and omniscient evaders. The field demonstration is the largest-scale implementation of a guaranteed search algorithm to date.