Kolling, Andreas Kleiner, Alexander 2013 (English)In: Proc. of the 12th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2013), 2013, 79-86Conference paper (Refereed)
We consider the problem of detecting all moving and evading targets in 2.5D environments with teams of UAVs. Targets are assumed to be fast and omniscient while UAVs are only equipped with limited range detection sensors and have no prior knowledge about the location of targets. We present an algorithm that, given an elevation map of the environment, computes synchronized trajectories for the UAVs to guarantee the detection of all targets. The approach is based on coordinating the motion of multiple UAVs on sweep lines to clear the environment from contamination, which represents the possibility of an undetected target being located in an area. The goal is to compute trajectories that minimize the number of UAVs needed to execute the guaranteed search. This is achieved by converting 2D strategies, computed for a polygonal representation of the environment, to 2.5D strategies. We present methods for this conversion and consider cost of motion and visibility constraints. Experimental results demonstrate feasibility and scalability of the approach. Experiments are carried out on real and artificial elevation maps and provide the basis for future deployments of large teams of real UAVs for guaranteed search.
National CategoryComputer Science Computer Vision and Robotics (Autonomous Systems)
Identifiersurn:nbn:se:liu:diva-87289 (URN)978-1-4503-1993-5 (ISBN)oai:DiVA.org:liu-87289 (OAI)diva2:588779 (DiVA)
12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2013)
ProjectsArtificial Intelligence & Integrated Computer Systems
eLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications