Computing and executing strategies for multi-robot search

May 2011

Computing and executing strategies for multi-robot search

Authors:

Andreas Kolling, Alexander Dieter Kleiner, and Katia Sycara
Conference Paper
Proceedings of (ICRA) International Conference on Robotics and Automation

Abstract:

We address the problem of searching for moving targets in large outdoor environments represented by height maps. To solve the problem we present a complete system that computes from an annotated height map a graph representation and search strategies based on worst-case assumptions about all targets. These strategies are then used to compute a schedule and task assignment for all agents. We improve the graph construction from previous work and for the first time present a method that computes a schedule to minimize the execution time. For this we consider travel times of agents determined by a path planner on the height map. We demonstrate the entire system in a real environment with an area of 700,000m 2 in which eight human agents search for two intruders using mobile computing devices (iPads). To the best of our knowledge this is the first demonstration of a search system applied to such a large environment.
@conference{Kolling-2011-7279,
author = {Andreas Kolling And Alexander Dieter Kleiner And And Katia Sycara},
title = {Computing and executing strategies for multi-robot search},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {2011},
month = {May},
pages = {4246 - 4253},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.