@conference {36,
	title = {Coverage search in 3D},
	year = {2013},
	address = {Linkoeping, Sweden},
	abstract = {Searching with a sensor for objects and to observe parts of a known environment efficiently is a fundamental problem 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.},
	keywords = {3D environments, coverage search, Educational institutions, execution time, household robots, image sequences, inspection robots, leaking pipelines search, objects search, path planning, Planning, rescue robots, Robot sensing systems, robot vision, robotic applications, schedule computation, Search problems, sensor, service robots, solid modelling, survivors search, Three-dimensional displays, Traveling salesman problems, view point sequences},
	doi = {10.1109/SSRR.2013.6719340},
	author = {Dornhege, C. and Kleiner, A. and Kolling, A.}
}
@conference {37,
	title = {Coverage search in 3D},
	booktitle = {Proc. of the {IEEE} Int. Workshop on Safety, Security and Rescue Robotics {(SSRR)},
	year = {2013},
	publisher = {IEEE},
	organization = {IEEE},
	address = {Linkoeping, Sweden},
	abstract = {Searching with a sensor for objects and to observe parts of a known environment efficiently is a fundamental problem 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.},
	keywords = {3D environments, coverage search, Educational institutions, execution time, household robots, image sequences, inspection robots, leaking pipelines search, objects search, path planning, Planning, rescue robots, Robot sensing systems, robot vision, robotic applications, schedule computation, Search problems, sensor, service robots, solid modelling, survivors search, Three-dimensional displays, Traveling salesman problems, view point sequences},
	doi = {10.1109/SSRR.2013.6719340},
	author = {Dornhege, C. and Kleiner, A. and Kolling, A.}
}
