2 papers
cs.DC2020
Gathering a Euclidean Closed Chain of Robots in Linear Time
Jannik Castenow, Jonas Harbig, Daniel Jung +2
This work focuses on the following question related to the Gathering problem of autonomous, mobile robots in the Euclidean plane: Is it possible to solve Gathering of robots th…
cs.DC2016
Asymptotically Optimal Gathering on a Grid
Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung +1
In this paper, we solve the local gathering problem of a swarm of indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time $\mathcal{O}(n…