GSST: anytime guaranteed search

  • Authors:

  • Geoffrey Hollinger;Athanasios Kehagias;Sanjiv Singh

  • Affiliations:

  • Robotics Institute, Carnegie Mellon University, Pittsburgh, USA 15217;Faculty of Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124;Robotics Institute, Carnegie Mellon University, Pittsburgh, USA 15217

  • Venue:
  • Autonomous Robots
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present Guaranteed Search with Spanning Trees (GSST), an anytime algorithm for multi-robot search. The problem is as follows: clear the environment of any adversarial target using the fewest number of searchers. This problem is NP-hard on arbitrary graphs but can be solved in linear-time on trees. Our algorithm generates spanning trees of a graphical representation of the environment to guide the search. At any time, spanning tree generation can be stopped yielding the best strategy so far. The resulting strategy can be modified online if additional information becomes available. Though GSST does not have performance guarantees after its first iteration, we prove that several variations will find an optimal solution given sufficient runtime. We test GSST in simulation and on a human-robot search team using a distributed implementation. GSST quickly generates clearing schedules with as few as 50% of the searchers used by competing algorithms.