Collisionless Gathering of Robots with an Extent

• Published in: SOFSEM 2011: Theory and Practice of Computer Science pp. 178 - 189
• Main Authors: Cord-Landwehr, Andreas, Degener, Bastian, Fischer, Matthias, Hüllmann, Martina, Kempkes, Barbara, Klaas, Alexander, Kling, Peter, Kurras, Sven, Märtens, Marcus, auf der Heide, Friedhelm Meyer, Raupach, Christoph, Swierkot, Kamil, Warner, Daniel, Weddemann, Christoph, Wonisch, Daniel
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Discrete Version; Mobile Robot; Simulation Step; Spin Operation; Target Position
• ISBN: 3642183808; 9783642183805
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-18381-2_15

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.