Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Knollmann, Till"'
Autor:
Castenow, Jannik, Harbig, Jonas, Jung, Daniel, Kling, Peter, Knollmann, Till, der Heide, Friedhelm Meyer auf
We consider a swarm of $n$ robots in \mathbb{R}^d. The robots are oblivious, disoriented (no common coordinate system/compass), and have limited visibility (observe other robots up to a constant distance). The basic formation task gathering requires
Externí odkaz:
http://arxiv.org/abs/2206.07567
Autor:
Castenow, Jannik, Feldkord, Björn, Knollmann, Till, Malatyali, Manuel, der Heide, Friedhelm Meyer auf
The $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. We present a model generalizing the $k$-Server Problem by preferences of the requests, where the servers are not
Externí odkaz:
http://arxiv.org/abs/2205.11102
We consider n robots with limited visibility: each robot can observe other robots only up to a constant distance denoted as the viewing range. The robots operate in discrete rounds that are either fully synchronous (FSync) or semi-synchronized (SSync
Externí odkaz:
http://arxiv.org/abs/2109.11856
Autor:
Castenow, Jannik, Harbig, Jonas, Jung, Daniel, Knollmann, Till, der Heide, Friedhelm Meyer auf
This work focuses on the following question related to the Gathering problem of $n$ autonomous, mobile robots in the Euclidean plane: Is it possible to solve Gathering of robots that do not agree on any axis of their coordinate systems (disoriented r
Externí odkaz:
http://arxiv.org/abs/2010.04424
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 problem. In this work, we study formation problems that try to reach a \
Externí odkaz:
http://arxiv.org/abs/2010.02043
Autor:
Castenow, Jannik, Feldkord, Björn, Knollmann, Till, Malatyali, Manuel, der Heide, Friedhelm Meyer auf
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 $S$ of commodities. Ravi and Sinha (SODA'04) introduced the model as the Multi-Commodity F
Externí odkaz:
http://arxiv.org/abs/2005.08391
We extend the Mobile Server Problem, introduced in SPAA'17, to a model where k identical mobile resources, here named servers, answer requests appearing at points in the Euclidean space. In order to reduce communication costs, the positions of the se
Externí odkaz:
http://arxiv.org/abs/1907.09834
Autor:
Castenow, Jannik, Harbig, Jonas, Jung, Daniel, Knollmann, Till, Meyer auf der Heide, Friedhelm
Publikováno v:
In Theoretical Computer Science 4 January 2023 939:261-291
Autor:
Knollmann, Till, Scheideler, Christian
While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. Considering crashing peers in peer-to-peer networks, i
Externí odkaz:
http://arxiv.org/abs/1809.04923
Publikováno v:
In Information and Computation May 2022 285 Part B