The Structural Power of Reconfigurable Circuits in the Amoebot Model
Andreas Padalkin, Christian Scheideler, Daniel Warner

TL;DR
This paper explores the reconfigurable circuit extension of the amoebot model, demonstrating its ability to efficiently solve fundamental problems like shape analysis and symmetry detection in programmable matter.
Contribution
It introduces the structural power of reconfigurable circuits in the amoebot model, enabling polylogarithmic-time solutions to key problems in shape transformation and structural analysis.
Findings
Polylogarithmic-time solutions for fundamental problems
Ability to identify axes and maximum points in amoebot structures
Construction of canonical paths and spanning trees
Abstract
The amoebot model [Derakhshandeh et al., 2014] has been proposed as a model for programmable matter consisting of tiny, robotic elements called amoebots. We consider the reconfigurable circuit extension [Feldmann et al., JCB 2022] of the geometric (variant of the) amoebot model that allows the amoebot structure to interconnect amoebots by so-called circuits. A circuit permits the instantaneous transmission of signals between the connected amoebots. In this paper, we examine the structural power of the reconfigurable circuits. We start with some fundamental problems like the stripe computation problem where, given any connected amoebot structure , an amoebot in , and some axis , all amoebots belonging to axis through have to be identified. Second, we consider the global maximum problem, which identifies an amoebot at the highest possible position with respect to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModular Robots and Swarm Intelligence · Computability, Logic, AI Algorithms · Micro and Nano Robotics
