@inproceedings{20001,
author = {von Mammen, Sebastian and Hamann, Heiko and Heider, Michael},
booktitle = {ACM Symposium on Virtual Reality Software and Technology (VRST)},
isbn = {9781450344913},
title = {{Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems}},
doi = {10.1145/2993369.2993400},
year = {2016},
}
@inproceedings{16360,
abstract = {We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. },
author = {Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)},
pages = {689--699},
publisher = {IEEE},
title = {{Gathering a Closed Chain of Robots on a Grid}},
doi = {10.1109/IPDPS.2016.51},
year = {2016},
}
@inproceedings{149,
abstract = {In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).},
author = {Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander},
booktitle = {Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {593----607},
title = {{Strategic Online Facility Location}},
doi = {10.1007/978-3-319-48749-6_43},
year = {2016},
}
@proceedings{163,
editor = {Dressler, Falko and Meyer auf der Heide, Friedhelm},
location = {Paderborn, Germany},
publisher = {ACM},
title = {{Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}},
doi = {10.1145/2942358},
year = {2016},
}
@inproceedings{207,
abstract = {We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\beta$. While for $\beta series = {LNCS}},
author = {Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
booktitle = {Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {578----592},
title = {{Cost-efficient Scheduling on Machines from the Cloud}},
doi = {10.1007/978-3-319-48749-6_42},
year = {2016},
}
@misc{187,
booktitle = {Transactions on Parallel Computing (TOPC)},
editor = {Meyer auf der Heide, Friedhelm},
number = {1},
pages = {1},
title = {{Introduction to the Special Issue on SPAA 2014}},
doi = {10.1145/2936716},
year = {2016},
}
@inproceedings{19961,
abstract = {The self-organizing bio-hybrid collaboration ofrobots and natural plants allows for a variety of interestingapplications. As an example we investigate how robots can beused to control the growth and motion of a natural plant, using LEDs to provide stimuli. We follow an evolutionaryrobotics approach where task performance is determined bymonitoring the plant's reaction. First, we do initial plantexperiments with simple, predetermined controllers. Then weuse image sampling data as a model of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve robot controllers in simulation. The task is to makethe plant approach three predetermined, distinct points in anxy-plane. Finally, we test the evolved controllers in real plantexperiments and find that we cross the reality gap successfully. We shortly describe how we have extended from plant tipto many points on the plant, for a model of the plant stemdynamics. Future work will extend to two-axes image samplingfor a 3-d approach.},
author = {Wahby, Mostafa and Hofstadler, Daniel Nicolas and Heinrich, Mary Katherine and Zahadat, Payam and Hamann, Heiko},
booktitle = {Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems},
isbn = {9781509035342},
title = {{An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap}},
doi = {10.1109/saso.2016.8},
year = {2016},
}
@inproceedings{20002,
author = {Rybář, Milan and Hamann, Heiko},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)},
isbn = {9781450342063},
title = {{Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes}},
doi = {10.1145/2908812.2908815},
year = {2016},
}
@inproceedings{17655,
author = {Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.},
booktitle = {Proceedings of the 2016 European Conference on Artificial Intelligence},
keyword = {agents, action, repeated reciprocation, fixed, floating, network, Nash equilibrium, social welfare, price of anarchy, price of stability, convex combination},
pages = {417--425},
title = {{The Game of Reciprocation Habits}},
doi = {10.3233/978-1-61499-672-9-417},
volume = {Volume 285: ECAI 2016},
year = {2016},
}
@inproceedings{16359,
abstract = {In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2).},
author = {Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {301--312},
publisher = {ACM},
title = {{Asymptotically Optimal Gathering on a Grid}},
doi = {10.1145/2935764.2935789},
year = {2016},
}
@unpublished{16450,
abstract = {In this paper, we solve the local gathering problem of a swarm of $n$
indistinguishable, point-shaped robots on a two dimensional grid in
asymptotically optimal time $\mathcal{O}(n)$ in the fully synchronous
$\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)
swarm of robots, the gathering problem on the grid is to locate all robots
within a $2\times 2$-sized area that is not known beforehand. Two robots are
connected if they are vertical or horizontal neighbors on the grid. The
locality constraint means that no global control, no compass, no global
communication and only local vision is available; hence, a robot can only see
its grid neighbors up to a constant $L_1$-distance, which also limits its
movements. A robot can move to one of its eight neighboring grid cells and if
two or more robots move to the same location they are \emph{merged} to be only
one robot. The locality constraint is the significant challenging issue here,
since robot movements must not harm the (only globally checkable) swarm
connectivity. For solving the gathering problem, we provide a synchronous
algorithm -- executed by every robot -- which ensures that robots merge without
breaking the swarm connectivity. In our model, robots can obtain a special
state, which marks such a robot to be performing specific connectivity
preserving movements in order to allow later merge operations of the swarm.
Compared to the grid, for gathering in the Euclidean plane for the same robot
and time model the best known upper bound is $\mathcal{O}(n^2)$.},
author = {Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {arXiv:1602.03303},
title = {{Asymptotically Optimal Gathering on a Grid}},
year = {2016},
}
@article{145,
abstract = {Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. },
author = {Feldotto, Matthias and Graffi, Kalman},
journal = {Concurrency and Computation: Practice and Experience},
number = {5},
pages = {1655--1677},
publisher = {Wiley Online Library},
title = {{Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}},
doi = {10.1002/cpe.3716},
volume = {28},
year = {2016},
}
@inproceedings{157,
abstract = {Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.},
author = {König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
booktitle = {Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)},
pages = {563----577},
title = {{Scheduling with Interjob Communication on Parallel Processors}},
doi = {10.1007/978-3-319-48749-6_41},
year = {2016},
}
@misc{210,
author = {Leder, Lennart},
publisher = {Universität Paderborn},
title = {{Congestion Games with Mixed Objectives}},
year = {2016},
}
@misc{5406,
author = {Bülling, Jonas},
title = {{Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}},
year = {2016},
}
@misc{688,
author = {Kutzias, Damian},
publisher = {Universität Paderborn},
title = {{Friendship Processes in Network Creation Games}},
year = {2016},
}
@inproceedings{19979,
author = {Hamann, Heiko and Divband Soorati, Mohammad},
booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)},
title = {{Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures}},
doi = {10.1109/IROS.2016.7759845},
year = {2016},
}
@inproceedings{20003,
author = {Khaluf, Yara and Hamann, Heiko},
booktitle = {ANTS 2016},
pages = {298},
title = {{On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations}},
volume = {9882},
year = {2016},
}
@inproceedings{169,
abstract = {We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study.},
author = {Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor},
booktitle = {Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)},
pages = {278----293},
title = {{Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}},
doi = {10.1007/978-3-319-30668-1_18},
year = {2016},
}
@inproceedings{17656,
author = {Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn},
booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems},
isbn = {978-1-4503-4239-1},
keyword = {agent's influence, behavior, convergence, perron-frobenius, reciprocal interaction, repeated reciprocation},
pages = {1431--1432},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
title = {{The Convergence of Reciprocation}},
year = {2016},
}