Kolling, Andreas Kleiner, Alexander Rudol, Piotr 2013 (English)In: Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013), 2013, 6013-6018Konferensbidrag (Refereed)
In this paper we consider the problem of searching for an arbitrarily smart and fast evader in a large environment with a team of unmanned aerial vehicles (UAVs) while providing guarantees of detection. Our emphasis is on the fast execution of efficient search strategies that minimize the number of UAVs and the search time. We present the first approach for computing fast search strategies utilizing additional searchers to speed up the execution time and thereby enabling large scale UAV search. In order to scale to very large environments when using UAVs one would either have to overcome the energy limitations of UAVs or pay the cost of utilizing additional UAVs to speed up the search. Our approach is based on coordinating UAVs on sweep lines, covered by the UAV sensors, that move simultaneously through an environment. We present some simulation results that show a significant reduction in execution time when using multiple UAVs and a demonstration of a real system with three ARDrones.
National CategoryComputer Systems Robotics
Identifiersurn:nbn:se:liu:diva-95888 (URN)10.1109/IROS.2013.6697229 (DOI)oai:DiVA.org:liu-95888 (OAI)
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013), November 3-8, 2013, Tokyo, Japan
ProjectsArtificial Intelligence & Integrated Computer SystemsCollaborative Robotics
eLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications