@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}}, } @inproceedings{17422, abstract = {{Commercial software of material flow simulations has the ability to layout the simulated models. Arranged equipment, such as conveyors or machines, includes the need to model and determine motion paths for moving objects like forklifts or automatically guided vehicles, so that the simulation framework is able to navigate all vehicles across those motion paths. After analyzing first scenarios, the user often carries out layout changes in the simulation model, e.g. moving, adding or deleting equipment. However, those changes cause time consuming, additional modeling of the motion paths for the user. Our motion planning algorithm reduces these changes by automatically determining the motion paths for moving objects, depending on an actual model layout without colliding with other objects. The algorithm works on the basis of the virtual scene’s 3D-data used for the simulation model’s visualization. We demonstrate the technique with a multi-floor building example.}}, author = {{Fischer, Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier, Wilhelm}}, booktitle = {{Proceedings of the 2010 Winter Simulation Conference}}, isbn = {{9781424498666}}, title = {{{Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations}}}, doi = {{10.1109/wsc.2010.5678906}}, year = {{2010}}, } @techreport{17462, author = {{Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Schroeder, Ulf-Peter}}, publisher = {{Heinz Nixdorf Institut}}, title = {{{A Large-Scale Distributed Environment for Peer-to-Peer Services}}}, year = {{2010}}, } @techreport{17464, author = {{Blesa, Maria J. and Blum, Christian and de Caro, Angelo and Degener, Bastian and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe and Meyer auf der Heide, Friedhelm and Mylonas, Georgios}}, title = {{{Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study}}}, year = {{2010}}, } @unpublished{17586, abstract = {{We are given a winding chain of $n$ mobile robots between two stations in the plane, each of them having a limited viewing range. It is only guaranteed that each robot can see its two neighbors in the chain. We analyze a simple and natural parallel strategy to shorten the chain in a time model where each relay is allowed to move up to a distance of $\delta$ in each time step. This model fills the gap between the previously used discrete time model and the continuous time model which was introduced recently in \cite{sirocco}. We analyze the strategy with respect to two quality measures: the number of time steps and the maximum distance to be traveled by the robots, which are the major energy consumers in this scenario. We provide asymptotically tight or almost tight bounds in this time model for both quality measures and it turns out that the best choice for $\delta$ is $\delta \in \Theta(\frac{1}{n})$, since this minimizes the number of time steps as well as the maximum traveled distance.}}, author = {{Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, title = {{{Building short chains of mobile robots locally with a bounded stepwidth}}}, year = {{2010}}, } @inproceedings{17665, author = {{Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}}, booktitle = {{DIALM-PODC}}, pages = {{33--42}}, title = {{{Bandwidth allocation in cellular networks with multiple interferences}}}, year = {{2010}}, } @inbook{18761, author = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Levi, Paul and Kernbach, Serge}}, booktitle = {{Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution}}, pages = {{240----263}}, publisher = {{Springer}}, title = {{{Hormone-based Control for Multi-modular Robotics}}}, year = {{2010}}, } @phdthesis{18910, author = {{Bienkowski, Marcin}}, isbn = {{978-3-942647-01-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Page migration in dynamic networks}}}, volume = {{282}}, year = {{2010}}, } @phdthesis{18927, author = {{Dynia, Miroslaw}}, isbn = {{978-3-942647-03-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Collective graph exploration}}}, volume = {{284}}, year = {{2010}}, } @article{19011, author = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, number = {{3}}, pages = {{562--584}}, title = {{{Kinetic Facility Location}}}, doi = {{10.1007/s00453-008-9250-7}}, volume = {{57}}, year = {{2010}}, } @inproceedings{19013, author = {{Gehweiler, Joachim and Meyerhenke, Henning}}, booktitle = {{Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)}}, isbn = {{9781424465330}}, title = {{{A distributed diffusive heuristic for clustering a virtual P2P supercomputer}}}, doi = {{10.1109/ipdpsw.2010.5470922}}, year = {{2010}}, }