LiU Electronic Press
Download:
File size:
1631 kb
Format:
application/pdf
Author:
Kolling, A. (University of Pittsburgh)
Kleiner, Alexander (University of Freiburg)
Lewis, M. (University of Pittsburgh)
Sycara, K. (Carnegie Mellon University, Pittsburgh, PA)
Title:
Computing and Executing Strategies for Moving Target Search
Publication type:
Conference paper (Refereed)
Language:
English
In:
IEEE Int. Conf. on Robotics and Automation (ICRA)
Conference:
2011 IEEE International Conference on Robotics and Automation, Shanghai International Conference Center, May 9-13, 2011, Shanghai, China
Publisher: IEEE
Pages:
4246-4253
Year of publ.:
2011
URI:
urn:nbn:se:liu:diva-72522
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72522
Subject category:
Robotics
Project:
Artificial Intelligence & Integrated Computer Systems
Abstract(en) :

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,000m2 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.

Available from:
2011-11-29
Created:
2011-11-28
Last updated:
2011-12-07
Statistics:
19 hits
FILE INFORMATION
File size:
1631 kb
Mimetype:
application/pdf
Type:
fulltext
Statistics:
117 hits
Version:
Authorʼs version