5 papers
Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
Henning Hillebrandt, Andreas Padalkin, Christian Scheideler +2
The decomposition of complex structures into simpler substructures is a powerful technique with a wide range of applications. We study the computation of decompositions in the cont…
Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements
Manish Kumar, Othon Michail, Andreas Padalkin +1
We study centralized reconfiguration problems for geometric amoebot structures. A set of amoebots occupy nodes on the triangular grid and can reconfigure via expansion and cont…
Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits
Nada Almalki, Siddharth Gupta, Othon Michail +1
Autonomous reconfiguration of agent-based systems is a key challenge in the study of programmable matter, distributed robotics, and molecular self-assembly. While substantial prior…
Reconfiguration and Locomotion with Joint Movements in the Amoebot Model
Andreas Padalkin, Manish Kumar, Christian Scheideler
We are considering the geometric amoebot model where a set of amoebots is placed on the triangular grid. An amoebot is able to send information to its neighbors, and to move vi…
On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits
Matthias Artmann, Andreas Padalkin, Christian Scheideler
In programmable matter, we consider a large number of tiny, primitive computational entities called particles that run distributed algorithms to control global properties of the pa…