TY - GEN
T1 - Coordinating Amoebots via Reconfigurable Circuits
AU - Feldmann, Michael
AU - Padalkin, Andreas
AU - Scheideler, Christian
AU - Dolev, Shlomi
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021/1/1
Y1 - 2021/1/1
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 Θ(log n) rounds, w.h.p., consensus in O(1) rounds, and both, compass alignment and chirality agreement, can be solved in O(log n) 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 Θ(log n) 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 Θ(log n) rounds, w.h.p., consensus in O(1) rounds, and both, compass alignment and chirality agreement, can be solved in O(log n) 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 Θ(log n) rounds, w.h.p.
KW - Amoebot model
KW - Progammable matter
KW - Reconfigurable circuits
UR - https://www.scopus.com/pages/publications/85119861587
U2 - 10.1007/978-3-030-91081-5_34
DO - 10.1007/978-3-030-91081-5_34
M3 - Conference contribution
AN - SCOPUS:85119861587
SN - 9783030910808
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 484
EP - 488
BT - Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, SSS 2021, Proceedings
A2 - Johnen, Colette
A2 - Schiller, Elad Michael
A2 - Schmid, Stefan
PB - Springer Science and Business Media Deutschland GmbH
T2 - 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021
Y2 - 17 November 2021 through 20 November 2021
ER -