@inproceedings{16454, author = {{Kling, Peter and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11}}, isbn = {{9781450307437}}, title = {{{Convergence of local communication chain strategies via linear transformations}}}, doi = {{10.1145/1989493.1989517}}, year = {{2011}}, } @article{16455, author = {{Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, issn = {{1877-0509}}, journal = {{Procedia Computer Science}}, pages = {{153--155}}, title = {{{Building Simple Formations in Large Societies of Tiny Mobile Robots}}}, doi = {{10.1016/j.procs.2011.09.049}}, year = {{2011}}, } @inbook{16456, author = {{Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{Organic Computing — A Paradigm Shift for Complex Systems}}, isbn = {{9783034801294}}, title = {{{Energy-Awareness in Self-organising Robotic Exploration Teams}}}, doi = {{10.1007/978-3-0348-0130-0_35}}, year = {{2011}}, } @inbook{16459, author = {{Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{Structural Information and Communication Complexity}}, isbn = {{9783642222115}}, issn = {{0302-9743}}, title = {{{Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally}}}, doi = {{10.1007/978-3-642-22212-2_13}}, year = {{2011}}, } @article{17009, author = {{Hsu, D. Frank and Magga, Bruce M. and Ho, Howard C. T. and Hromkovic, Juraj and Lau, Francis C. M. and Meyer auf der Heide, Friedhelm}}, issn = {{0219-2659}}, journal = {{Journal of Interconnection Networks}}, pages = {{vii--viii}}, title = {{{EDITORIAL}}}, doi = {{10.1142/s0219265911002885}}, year = {{2011}}, } @inbook{16409, abstract = {{Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes. }}, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783642220111}}, issn = {{0302-9743}}, title = {{{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}}}, doi = {{10.1007/978-3-642-22012-8_52}}, year = {{2011}}, } @inproceedings{19678, author = {{Briest, Patrick and Röglin, Heiko}}, booktitle = {{Workshop on Approximation and Online Algorithms (WAOA)}}, publisher = {{Springer}}, title = {{{The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}}}, doi = {{10.1007/978-3-642-18318-8_5}}, volume = {{6534}}, year = {{2010}}, } @inproceedings{19711, author = {{Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}}, booktitle = {{International Parallel & Distributed Processing Symposium (IPDPS)}}, title = {{{A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }}}, doi = {{10.1109/IPDPS.2010.5470349}}, year = {{2010}}, } @inproceedings{19796, abstract = {{We introduce the Read-Write-Coding-System (RWC) – a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \leq r,w \leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\left(n,k,d\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.}}, author = {{Mense, Mario and Schindelhauer, Christian}}, booktitle = {{Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems}}, isbn = {{9783642051173}}, issn = {{0302-9743}}, pages = {{624----639}}, title = {{{Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}}}, doi = {{10.1007/978-3-642-05118-0_43}}, volume = {{5873}}, year = {{2010}}, } @inproceedings{19824, abstract = {{We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis.}}, author = {{Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian}}, booktitle = {{Proceedings of the 16th International Conference on Parallel and Distributed Systems}}, isbn = {{9781424497270}}, title = {{{A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}}}, doi = {{10.1109/icpads.2010.42}}, year = {{2010}}, } @inproceedings{19829, author = {{Miao, Huawei and Ooi, Chia Ching and Wu, Xiaowen and Schindelhauer, Christian}}, booktitle = {{Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10}}, isbn = {{9781605586397}}, pages = {{1299--1304}}, title = {{{Coverage-hole trap model in target tracking using distributed relay-robot network}}}, doi = {{10.1145/1774088.1774365}}, year = {{2010}}, } @inproceedings{19933, author = {{Schomaker, Gunnar and Oberthur, Simon and Kortenjan, Michael}}, booktitle = {{8th IEEE International Conference on Industrial Informatics (INDIN'2010)}}, isbn = {{9781424472987}}, title = {{{Distributed and dynamic resource management for self-optimizing mechatronic systems}}}, doi = {{10.1109/indin.2010.5549647}}, year = {{2010}}, } @book{20182, author = {{Hamann, Heiko}}, publisher = {{Springer}}, title = {{{Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming}}}, doi = {{10.1007/978-3-642-13377-0}}, year = {{2010}}, } @inproceedings{20220, author = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl}}, booktitle = {{Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10)}}, pages = {{244----251}}, title = {{{A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning}}}, doi = {{10.1109/CEC.2010.5585994}}, year = {{2010}}, } @inproceedings{20222, author = {{Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Mayet, Ralf and Crailsheim, Karl}}, booktitle = {{Proc. of the ALife XII Conference}}, pages = {{648----655}}, publisher = {{MIT Press}}, title = {{{Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller}}}, year = {{2010}}, } @inproceedings{20223, abstract = {{The semi-automatic or automatic synthesis of robot controller software is both desirable and challenging. Synthesis of rather simple behaviors such as collision avoidance by applying artificial evolution has been shown multiple times. However, the difficulty of this synthesis increases heavily with increasing complexity of the task that should be performed by the robot. We try to tackle this problem of complexity with Artificial Homeostatic Hormone Systems (AHHS), which provide both intrinsic, homeostatic processes and (transient) intrinsic, variant behavior. By using AHHS the need for pre-defined controller topologies or information about the field of application is minimized. We investigate how the principle design of the controller and the hormone network size affects the overall performance of the artificial evolution (i.e., evolvability). This is done by comparing two variants of AHHS that show different effects when mutated. We evolve a controller for a robot built from five autonomous, cooperating modules. The desired behavior is a form of gait resulting in fast locomotion by using the modules' main hinges.}}, author = {{Hamann, Heiko and Stradner, Jürgen and Schmickl, Thomas and Crailsheim, Karl}}, booktitle = {{Artificial Life XII (ALife XII), Odense, Denmark}}, pages = {{773--780}}, publisher = {{MIT Press}}, title = {{{Artificial Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular Robotics}}}, year = {{2010}}, } @inproceedings{20226, author = {{Hamann, Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}}, booktitle = {{From Animals to Animats 11}}, isbn = {{9783642151927}}, issn = {{0302-9743}}, pages = {{639--648}}, publisher = {{Springer}}, title = {{{A Model of Symmetry Breaking in Collective Decision-Making}}}, doi = {{10.1007/978-3-642-15193-4_60}}, volume = {{6226}}, year = {{2010}}, } @inproceedings{20258, abstract = {{Self-organization in natural systems demonstrates very reliable and scalable collective behavior without using any central elements. When providing collective robotic systems with self-organizing principles, we are facing new problems of making self-organization purposeful, self-adapting to changing environments and faster, in order to meet requirements from a technical perspective. This paper describes on-going work of creating such an artificial self-organization within artificial robot organisms, performed in the framework of several European projects.}}, author = {{Kernbach, Serge and Hamann, Heiko and Stradner, Jürgen and Thenius, Ronald and Schmickl, Thomas and Crailsheim, Karl and Rossum, A.C. van and Sebag, Michele and Bredeche, Nicolas and Yao, Yao and Baele, Guy and Peer, Yves Van de and Timmis, Jon and Mohktar, Maizura and Tyrrell, Andy and Eiben, A.E. and McKibbin, S.P. and Liu, Wenguo and Winfield, Alan F.T.}}, booktitle = {{2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns}}, isbn = {{9781424451661}}, title = {{{On Adaptive Self-Organization in Artificial Robot Organisms}}}, doi = {{10.1109/computationworld.2009.9}}, year = {{2010}}, } @article{24282, author = {{Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}}, issn = {{0302-9743}}, journal = {{ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications}}, title = {{{Robust Undetectable Interference Watermarks}}}, doi = {{10.1007/11424826_55}}, year = {{2010}}, } @inproceedings{27159, author = {{Samara, Sufyan and Schomaker, Gunnar}}, booktitle = {{2010 10th IEEE International Conference on Computer and Information Technology}}, title = {{{Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip}}}, doi = {{10.1109/cit.2010.304}}, year = {{2010}}, }