1 citations · 1 across the 4 of their papers we have counts for
5 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…
Tilt Automata: Gathering Particles With Uniform External Control
Sándor P. Fekete, Jonas Friemel, Peter Kramer +3
Motivated by targeted drug delivery, we investigate the gathering of particles in the full tilt model of externally controlled motion planning: A set of particles is located at the…
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…
Tile Reconfiguration by a Finite Automaton
Jonas Friemel, David Liedtke, Christian Scheffer
Shape formation is one of the most thoroughly studied problems in programmable matter and swarm robotics. However, in many models, the class of shapes that can be formed is highly…