Dornhege, Christian Kleiner, Alexander Kolling, Andreas 2013 (English)In: , 1-8Conference paper (Refereed)
Searching with a sensor for objects and to observe parts of a known environment efficiently is a fundamental prob- lem in many real-world robotic applications such as household robots searching for objects, inspection robots searching for leaking pipelines, and rescue robots searching for survivors after a disaster. We consider the problem of identifying and planning efficient view point sequences for covering complex 3d environments. We compare empirically several variants of our algorithm that allow to trade-off schedule computation against execution time. Our results demonstrate that, despite the intractability of the overall problem, computing effective solutions for coverage search in real 3d environments is feasible.
National CategoryComputer and Information Science
Identifiersurn:nbn:se:liu:diva-97300 (URN)10.1109/SSRR.2013.6719340 (DOI)978-1-4799-0879-0 (ISBN)oai:DiVA.org:liu-97300 (OAI)diva2:646258 (DiVA)
11th IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR 2013), 21-26 October 2013, Linköping, Sweden
eLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Accepted for Publication.2013-09-072013-09-072014-11-28Bibliographically approved