1 citations · 1 across the 4 of their papers we have counts for
8 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…
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…
Competitive Routing in Hybrid Communication Networks
Daniel Jung, Christina Kolb, Christian Scheideler +1
Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a mess…
Gathering Anonymous, Oblivious Robots on a Grid
Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide
We consider a swarm of autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (…
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…
Gathering a Closed Chain of Robots on a Grid
Sebastian Abshoff, Andreas Cord-Landwehr, Matthias Fischer +2
We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of indistinguishable, point shaped robots on a two dimensional gr…
Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case
Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung +1
In the gathering problem, n autonomous robots have to meet on a single point. We consider the gathering of a closed chain of point-shaped, anonymous robots on a grid. The robots on…
Multilevel Network Games
Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung +1
We consider a multilevel network game, where nodes can improve their communication costs by connecting to a high-speed network. The nodes are connected by a static network and…