TY - JOUR AU - Castenow, Jannik AU - Harbig, Jonas AU - Jung, Daniel AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ID - 33947 JF - Theoretical Computer Science KW - General Computer Science KW - Theoretical Computer Science SN - 0304-3975 TI - Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation VL - 939 ER - TY - CONF AU - Castenow, Jannik AU - Harbig, Jonas AU - Jung, Daniel AU - Kling, Peter AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ED - Hillel, Eshcar ED - Palmieri, Roberto ED - Riviére, Etienne ID - 34008 SN - 1868-8969 T2 - Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) TI - A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility VL - 253 ER - TY - CHAP AU - Castenow, Jannik AU - Harbig, Jonas AU - Meyer auf der Heide, Friedhelm ID - 44769 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Unifying Gathering Protocols for Swarms of Mobile Robots ER - TY - THES AU - Castenow, Jannik ID - 45580 TI - Local Protocols for Contracting and Expanding Robot Formation Problems ER - TY - JOUR AU - Castenow, Jannik AU - Kling, Peter AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ID - 29843 JF - Information and Computation KW - Computational Theory and Mathematics KW - Computer Science Applications KW - Information Systems KW - Theoretical Computer Science SN - 0890-5401 TI - A Discrete and Continuous Study of the Max-Chain-Formation Problem ER - TY - CONF AB - The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging). In our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$. We study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear. The two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously. AU - Castenow, Jannik AU - Feldkord, Björn AU - Knollmann, Till AU - Malatyali, Manuel AU - Meyer auf der Heide, Friedhelm ID - 31847 KW - K-Server Problem KW - Heterogeneity KW - Online Caching SN - 9781450391467 T2 - Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures TI - The k-Server with Preferences Problem ER - TY - CONF AU - Castenow, Jannik AU - Harbig, Jonas AU - Jung, Daniel AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ED - Gasieniec, Leszek ED - Klasing, Ralf ED - Radzik, Tomasz ID - 23730 T2 - Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) TI - Gathering a Euclidean Closed Chain of Robots in Linear Time VL - 12961 ER - TY - CONF AU - Castenow, Jannik AU - Götte, Thorsten AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ED - Johnen, C. ED - Schiller, E.M. ED - Schmid, S. ID - 26986 T2 - Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 TI - The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation VL - 13046 ER - TY - CONF AB - Most existing robot formation problems seek a target formation of a certain 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 maximal structure, supporting for example an efficient coverage in exploration scenarios. A recent example is the NASA Shapeshifter project, which describes how the robots form a relay chain along which gathered data from extraterrestrial cave explorations may be sent to a home base. As a first step towards understanding such maximization tasks, we introduce and study the Max-Chain-Formation problem, where $n$ robots are ordered along a winding, potentially self-intersecting chain and must form a connected, straight line of maximal length connecting its two endpoints. We propose and analyze strategies in a discrete and in a continuous time model. In the discrete case, we give a complete analysis if all robots are initially collinear, showing that the worst-case time to reach an $\varepsilon$-approximation is upper bounded by $\mathcal{O}(n^2 \cdot \log (n/\varepsilon))$ and lower bounded by $\Omega(n^2 \cdot~\log (1/\varepsilon))$. If one endpoint of the chain remains stationary, this result can be extended to the non-collinear case. If both endpoints move, we identify a family of instances whose runtime is unbounded. For the continuous model, we give a strategy with an optimal runtime bound of $\Theta(n)$. Avoiding an unbounded runtime similar to the discrete case relies crucially on a counter-intuitive aspect of the strategy: slowing down the endpoints while all other robots move at full speed. Surprisingly, we can show that a similar trick does not work in the discrete model. AU - Castenow, Jannik AU - Kling, Peter AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ED - Devismes , Stéphane ED - Mittal, Neeraj ID - 19899 SN - 978-3-030-64347-8 T2 - Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings TI - A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up VL - 12514 ER - TY - CONF AU - Castenow, Jannik AU - Harbig, Jonas AU - Jung, Daniel AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ED - Devismes, Stéphane ED - Mittal, Neeraj ID - 20185 SN - 978-3-030-64347-8 T2 - Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings TI - Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility VL - 12514 ER - TY - CONF AB - 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 2004) introduced the model as the \emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem. The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances. In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$. A request has to be connected to a set of facilities jointly offering the commodities demanded by it. In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each. To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time. We present results regarding the competitive ratio. On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \( \Omega ( \sqrt{|S|} + \frac{\log n}{\log \log n} ) \) that already holds for simple line metrics. Here, \( n \) is the number of requests. On the other side, we establish a deterministic \( \mathcal{O}(\sqrt{|S|} \cdot \log n) \)-competitive algorithm and a randomized \( \mathcal{O}(\sqrt{|S|} \cdot \frac{\log n}{\log \log n} ) \)-competitive algorithm. Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function. AU - Castenow, Jannik AU - Feldkord, Björn AU - Knollmann, Till AU - Malatyali, Manuel AU - Meyer auf der Heide, Friedhelm ID - 17370 KW - Online Multi-Commodity Facility Location KW - Competitive Ratio KW - Online Optimization KW - Facility Location Problem SN - 9781450369350 T2 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures TI - The Online Multi-Commodity Facility Location Problem ER - TY - CONF AU - Castenow, Jannik AU - Kling, Peter AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm ID - 17371 SN - 9781450369350 T2 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures TI - Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up ER - TY - CONF AB - 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 of initially scattered robots is required to gather at the same position. The robots' capabilities are very restricted -- they do not agree on any coordinate system or compass, have a limited viewing range, have no memory of the past and cannot communicate. We study the problem in two different time models, in FSYNC (fully synchronized discrete rounds) and the continuous time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy and prove a runtime of $\Theta(n^2)$ that matches the currently best runtime bound for the same model in the Euclidean plane [SPAA'11]. Our main result is the generalization of contracting strategies (continuous time) from [Algosensors'17] to three dimensions. In contracting strategies, every robot that is located on the global convex hull of all robots' positions moves with full speed towards the inside of the convex hull. We prove a runtime bound of $O(\Delta \cdot n^{3/2})$ for any three-dimensional contracting strategy, where $\Delta$ denotes the diameter of the initial configuration. This comes up to a factor of $\sqrt{n}$ close to the lower bound of $\Omega (\Delta \cdot n)$ which is already true in two dimensions. In general, it might be hard for robots with limited viewing range to decide whether they are located on the global convex hull and which movement maintains the connectivity of the swarm, rendering the design of concrete contracting strategies a challenging task. We prove that the continuous variant of 3D-Go-To-The-Center is contracting and keeps the swarm connected. Moreover, we give a simple design criterion for three-dimensional contracting strategies that maintains the connectivity of the swarm and introduce an exemplary strategy based on this criterion. AU - Braun, Michael AU - Castenow, Jannik AU - Meyer auf der Heide, Friedhelm ID - 16968 T2 - Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO) TI - Local Gathering of Mobile Robots in Three Dimensions ER - TY - CONF AU - Castenow, Jannik AU - Kolb, Christina AU - Scheideler, Christian ID - 15169 T2 - Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN) TI - A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks ER - TY - JOUR AU - Castenow, Jannik AU - Fischer, Matthias AU - Harbig, Jonas AU - Jung, Daniel AU - Meyer auf der Heide, Friedhelm ID - 16299 JF - Theoretical Computer Science SN - 0304-3975 TI - Gathering Anonymous, Oblivious Robots on a Grid VL - 815 ER - TY - CONF AU - Castenow, Jannik AU - Kolb, Christina AU - Scheideler, Christian ID - 14539 T2 - Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) TI - A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks ER - TY - CONF AB - 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 message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion. In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work. AU - Jung, Daniel AU - Kolb, Christina AU - Scheideler, Christian AU - Sundermeier, Jannik ID - 4563 KW - greedy routing KW - ad hoc networks KW - convex hulls KW - c-competitiveness T2 - Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) TI - Competitive Routing in Hybrid Communication Networks ER - TY - CONF AU - Jung, Daniel AU - Kolb, Christina AU - Scheideler, Christian AU - Sundermeier, Jannik ID - 4565 SN - 9781450357999 T2 - Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA) TI - Brief Announcement: Competitive Routing in Hybrid Communication Networks ER - TY - CONF AB - We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\bigtimes_{i=1}^{d}[a_i,\,b_i]$ in a $d$-dimensional point space.\\ The network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07). We show how to execute such range queries using $\mathcal{O}\left(2^{d'}d\,\log m + d\,|R|\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range. Furthermore, if the peers form a distributed network, the query can be answered in $\mathcal{O}\left(d\,\log m + d\,\sum_{i=1}^{d}(b_i-a_i+1)\right)$ communication rounds. Our algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers. AU - Benter, Markus AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm AU - Setzer, Alexander AU - Sundermeier, Jannik ID - 4375 KW - Distributed Storage KW - Multi-Dimensional Range Queries KW - Peer-to-Peer KW - Hilbert Curve T2 - Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) TI - A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension ER - TY - GEN AU - Sundermeier, Jannik ID - 699 TI - Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions ER -