4 citations · 4 across the 2 of their papers we have counts for
3 papers · 1 filter
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
Jannik Castenow, Jonas Harbig, Daniel Jung +3
We consider a swarm of robots in \mathbb{R}^d. The robots are oblivious, disoriented (no common coordinate system/compass), and have limited visibility (observe other robots up…
A Discrete and Continuous Study of the Max-Chain-Formation Problem
Jannik Castenow, Peter Kling, Till Knollmann +1
Most existing robot formation problems seek a target formation of a certain \emph{minimal} and, thus, efficient structure. Examples include the Gathering and the Chain-Formation pr…
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…