4 citations · 4 across the 2 of their papers we have counts for
6 papers
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…
The k-Server with Preferences Problem
Jannik Castenow, Björn Feldkord, Till Knollmann +2
The -Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. We present a model generalizing the -Ser…
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…
The Online Multi-Commodity Facility Location Problem
Jannik Castenow, Björn Feldkord, Till Knollmann +2
We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set of commodities.…
Local Gathering of Mobile Robots in Three Dimensions
Michael Braun, Jannik Castenow, Friedhelm Meyer auf der Heide
In this work, we initiate the research about the Gathering problem for robots with limited viewing range in the three-dimensional Euclidean space. In the Gathering problem, a set o…