In this work, we reconsider the well-known Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering in the plane n autonomous mobile robots with limited viewing range. The above authors have introduced it as a discrete, round-based algorithm and proved its correctness. In [8], by Degener et al. it is shown that the algorithm gathers in Θ (n~2) rounds. Remarkably, this algorithm exploits the fact, that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is o.k. under the assumption, those robots have no extent. Otherwise, collisions should be avoided. In this paper, we consider a continuous Go-To-The-Center (GTC) strategy in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of O (n~2) for gathering in two-dimensional Euclidean space, and Θ (n) for the one-dimensional case. Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robots w.r.t. the Gabriel subgraph of the visibility graph (GTGC). We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the GTC and the GTGC strategy: Whereas lots of collisions occur during a run of the GTC strategy, typically only one, namely the final collision occurs during a run of the GTGC strategy. We can prove this "collisionless property" of the GTGC algorithm for the one-dimensional case. In the case of the two-dimensional Euclidean space, we conjecture that the "collisionless property" holds for almost every initial configuration.
展开▼
