Computing and Executing Strategies for Moving Target Search
2011 (English)In: IEEE Int. Conf. on Robotics and Automation (ICRA), IEEE, 2011, 4246-4253Conference paper (Refereed)
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.
IdentifiersURN: urn:nbn:se:liu:diva-72522DOI: 10.1109/ICRA.2011.5980277OAI: oai:DiVA.org:liu-72522DiVA: diva2:459931
2011 IEEE International Conference on Robotics and Automation, Shanghai International Conference Center, May 9-13, 2011, Shanghai, China
ProjectsArtificial Intelligence & Integrated Computer Systems