TY - CONF AU - Koch, S. AU - Kupke, J. AU - Tomow, D. AU - Schoppa, M. AU - Grunow, Paul AU - Krauter, Stefan ID - 6886 T2 - Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition TI - Polarisation Effects and Tests for Crystalline Silicon Cells ER - TY - CONF AU - Böttcher, A. AU - Horstmann, M. AU - Grunow, Paul AU - Pourhashemi, R. AU - Krauter, Stefan ID - 6887 T2 - Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition TI - Spectral Mismatch Correction for Micromorph Tandem Modules. ER - TY - CONF AU - Weber, T. AU - Albert, A. AU - Grunow, Paul AU - Krauter, Stefan ID - 6888 T2 - Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition TI - Electroluminescence Investigation on Thin Film Modules ER - TY - CONF AU - Wendlandt, S. AU - Drobisch, A. AU - Tomow, D. AU - Friedrichs, M. AU - Krauter, Stefan AU - Grunow, Paul ID - 6889 T2 - Proceedings of the ISES Solar Word Congress TI - Operating principle of a shadowed c-Si solar cell in PV modules ER - TY - CONF AB - Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version. AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - Meyer auf der Heide, Friedhelm AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 16410 IS - 6543 SN - 0302-9743 T2 - 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011) TI - Collisionless Gathering of Robots with an Extent ER - TY - CHAP AU - Gehweiler, Joachim AU - Meyer auf der Heide, Friedhelm ID - 16412 SN - 9783642153273 T2 - Algorithms Unplugged TI - Bin Packing - How Do I Get My Stuff into the Boxes ER - TY - CONF AU - Rajaraman, Rajmohan AU - Meyer auf der Heide, Friedhelm ID - 16428 SN - 9781450307437 TI - Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 ER - TY - JOUR AU - Degener, Bastian AU - Fekete, Sándor P. AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16447 JF - Computer Science Review SN - 1574-0137 TI - A survey on relay placement with runtime and approximation guarantees ER - TY - CONF AU - Brandes, Philipp AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16451 T2 - SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity TI - Energy-efficient strategies for building short chains of mobile robots locally ER - TY - CONF AU - Degener, Bastian AU - Kempkes, Barbara AU - Langner, Tobias AU - Meyer auf der Heide, Friedhelm AU - Pietrzyk, Peter AU - Wattenhofer, Roger ID - 16453 SN - 9781450307437 T2 - Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 TI - A tight runtime bound for synchronous gathering of autonomous robots with limited visibility ER -