TY - GEN
T1 - Coordinating Amoebots via Reconfigurable Circuits.
AU - Feldmann, Michael
AU - Padalkin, Andreas
AU - Scheideler, Christian
AU - Dolev, Shlomi
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2021/11/9
Y1 - 2021/11/9
N2 - We consider an extension to the geometric amoebot model that allows amoebots to form so-called circuits. Given a connected amoebot structure, a circuit is a subgraph formed by the amoebots that permits the instant transmission of signals. We show that such an extension allows for significantly faster solutions to a variety of problems related to programmable matter. More specifically, we provide algorithms for leader election, consensus, compass alignment, chirality agreement, and shape recognition. Leader election can be solved in Θ(logn) rounds, w.h.p., consensus in O(1) rounds, and both, compass alignment and chirality agreement, can be solved in O(logn) rounds, w.h.p. For shape recognition, the amoebots have to decide whether the amoebot structure forms a particular shape. We show that the amoebots can detect a shape composed of triangles within O(1) rounds. Finally, we show how the amoebots can detect a parallelogram with linear and polynomial side ratio within Θ(logn) rounds, w.h.p.
AB - We consider an extension to the geometric amoebot model that allows amoebots to form so-called circuits. Given a connected amoebot structure, a circuit is a subgraph formed by the amoebots that permits the instant transmission of signals. We show that such an extension allows for significantly faster solutions to a variety of problems related to programmable matter. More specifically, we provide algorithms for leader election, consensus, compass alignment, chirality agreement, and shape recognition. Leader election can be solved in Θ(logn) rounds, w.h.p., consensus in O(1) rounds, and both, compass alignment and chirality agreement, can be solved in O(logn) rounds, w.h.p. For shape recognition, the amoebots have to decide whether the amoebot structure forms a particular shape. We show that the amoebots can detect a shape composed of triangles within O(1) rounds. Finally, we show how the amoebots can detect a parallelogram with linear and polynomial side ratio within Θ(logn) rounds, w.h.p.
KW - Progammable matter
KW - Amoebot model
KW - Reconfigurable circuits
UR - http://www.scopus.com/inward/record.url?scp=85119861587&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-91081-5_34
DO - 10.1007/978-3-030-91081-5_34
M3 - Conference contribution
SN - 978-3-030-91080-8
T3 - Lecture Notes in Computer Science
SP - 484
EP - 488
BT - Stabilization, Safety, and Security of Distributed Systems. SSS 2021
A2 - Johnen, Colette
A2 - Schiller, Elad Michael
A2 - Schmid, Stefan
PB - Springer Cham
T2 - 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021
Y2 - 17 November 2021 through 20 November 2021
ER -