TY - GEN
AU - Bonorden, Olaf
AU - Degener, Bastian
AU - Pietrzyk, Peter
AU - Kempkes, Barbara
ID - 19722
TI - Complexity and approximation of a geometric local robot assignment problem
ER -
TY - JOUR
AU - Ooi, Chia Ching
AU - Schindelhauer, Christian
ID - 19830
JF - Mobile Networks and Applications (MONET)
SN - 1383-469X
TI - Minimal Energy Path Planning for Wireless Robots
ER -
TY - THES
AU - Mense, Mario
ID - 19614
SN - 978-3-939350-79-8
TI - On Fault-Tolerant Data Placement in Storage Networks
ER -
TY - JOUR
AB - By compiling macroscopic models we analyze the adaptive behavior in a swarm of autonomous robots generated by a bio-inspired, distributed control algorithm. We developed two macroscopic models by taking two different perspectives: A Stock & Flow model, which is simple to implement and fast to simulate, and a spatially resolved model based on diffusion processes. These two models were compared concerning their prediction quality and their analytical power: One model allowed easy identification of the major feedback loops governing the swarm behavior. The other model allowed analysis of the expected shapes and positions of observable robot clusters. We found a high correlation in the challenges posed by both modeling techniques and we highlighted the inherent problems of inferring emergent macroscopic rules from a microscopic description of swarm behavior.
AU - Schmickl, Thomas
AU - Hamann, Heiko
AU - Wörn, Heinz
AU - Crailsheim, Karl
ID - 20255
IS - 9
JF - Robotics and Autonomous Systems
SN - 0921-8890
TI - Two different approaches to a macroscopic model of a bio-inspired robotic swarm
VL - 6
ER -
TY - JOUR
AU - Ooi, Chia Ching
AU - Schindelhauer, Christian
ID - 19831
JF - Telecommunication Systems
SN - 1018-4864
TI - Utilizing detours for energy conservation in mobile wireless networks
VL - 43
ER -
TY - CONF
AU - Raptopoulos, Christoforos L.
AU - Nikoletseas, Sotiris E.
AU - Spirakis, Paul G.
ID - 19901
SN - 9781493928637
T2 - 34st International Symposium on Mathematical Foundations of Computer Science
TI - Colouring Non-sparse Random Intersection Graphs
ER -
TY - CONF
AB - For a fixed virtual scene (=collection of simplices) S and given observer
position p, how many elements of S are weakly visible (i.e. not fully occluded
by others) from p? The present work explores the trade-off between query time
and preprocessing space for these quantities in 2D: exactly, in the approximate
deterministic, and in the probabilistic sense. We deduce the EXISTENCE of an
O(m^2/n^2) space data structure for S that, given p and time O(log n), allows
to approximate the ratio of occluded segments up to arbitrary constant absolute
error; here m denotes the size of the Visibility Graph--which may be quadratic,
but typically is just linear in the size n of the scene S. On the other hand,
we present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)
preprocessing time and space with similar approximation properties and query
time O(k*polylog n), where k