Anytime Guaranteed Search using Spanning Trees

(2008)

Cited by: 10|Views10

Abstract:

Abstract This technical report presents an anytime algorithm for solving the multi-robot guaranteed search problem. Guaranteed search requires a team of robots to clear an environment of a po- tentially adversarial target. In other words, a team of searchers must generate a search strategy guaranteed to flnd a target. This problem is know...More

Code:

Data:

ZH
Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments