TY - CONF AB - 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. AU - Fischer, Matthias AU - Renken, Hendrik AU - Laroque, Christoph AU - Schaumann, Guido AU - Dangelmaier, Wilhelm ID - 17422 SN - 9781424498666 T2 - Proceedings of the 2010 Winter Simulation Conference TI - Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations ER - TY - GEN AU - Gehweiler, Joachim AU - Meyer auf der Heide, Friedhelm AU - Schroeder, Ulf-Peter ID - 17462 TI - A Large-Scale Distributed Environment for Peer-to-Peer Services ER - TY - GEN AU - Blesa, Maria J. AU - Blum, Christian AU - de Caro, Angelo AU - Degener, Bastian AU - Kempkes, Barbara AU - Leone, Piere AU - Persiano, Giuseppe AU - Meyer auf der Heide, Friedhelm AU - Mylonas, Georgios ID - 17464 TI - Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study ER - TY - GEN AB - 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. AU - Brandes, Philipp AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 17586 TI - Building short chains of mobile robots locally with a bounded stepwidth ER - TY - CONF AU - Bar-Yehuda, Reuven AU - Polevoy, Gleb AU - Rawitz, Dror ID - 17665 T2 - DIALM-PODC TI - Bandwidth allocation in cellular networks with multiple interferences ER - TY - CHAP AU - Hamann, Heiko AU - Schmickl, Thomas AU - Stradner, Jürgen AU - Crailsheim, Karl AU - Levi, Paul AU - Kernbach, Serge ID - 18761 T2 - Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution TI - Hormone-based Control for Multi-modular Robotics ER - TY - THES AU - Bienkowski, Marcin ID - 18910 SN - 978-3-942647-01-4 TI - Page migration in dynamic networks VL - 282 ER - TY - THES AU - Dynia, Miroslaw ID - 18927 SN - 978-3-942647-03-8 TI - Collective graph exploration VL - 284 ER - TY - JOUR AU - Degener, Bastian AU - Gehweiler, Joachim AU - Lammersen, Christiane ID - 19011 IS - 3 JF - Algorithmica SN - 0178-4617 TI - Kinetic Facility Location VL - 57 ER - TY - CONF AU - Gehweiler, Joachim AU - Meyerhenke, Henning ID - 19013 SN - 9781424465330 T2 - Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC) TI - A distributed diffusive heuristic for clustering a virtual P2P supercomputer ER -