4 citations · 8 across the 12 of their papers we have counts for
17 papers
Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation
Jonas Friemel, Tilo Hoitz, Phillip Keldenich +1
We consider a matching problem in which the cost of each edge is a vector with components. The cost of a matching is the sum of the bottlenecks over all components, and we ask…
Pass the Bucket: Efficient, Robust, Local Load Balancing for Teams of Heterogeneous Robots
Tobias Wallner, Dominik Krupke, Arne Schmidt +1
We study the problem of decentralized, self-organized task sharing for a swarm of heterogeneous robots that collaborate in transportation or other objectives that require coordinat…
Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
Javier Garcia, Jonas Friemel, Ramin Kosfeld +9
We implement and evaluate different methods for the reconfiguration of a connected arrangement of tiles into a desired target shape, using a single active robot that can move along…
Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
Aaron T. Becker, Sándor P. Fekete, Jonas Friemel +6
We consider the problem of reconfiguring a two-dimensional connected grid arrangement of passive building blocks from a start configuration to a goal configuration, using a single…
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
Aaron T. Becker, Sándor P. Fekete, Li Huang +5
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of mic…
Computing Motion Plans for Assembling Particles with Global Control
Patrick Blumenberg, Arne Schmidt, Aaron T. Becker
We investigate motion planning algorithms for the assembly of shapes in the \emph{tilt model} in which unit-square tiles move in a grid world under the influence of uniform externa…