通过可重构电路加速Amoebots
Accelerating Amoebots via Reconfigurable Circuits
摘要：
我们考虑一个扩展的几何变形虫模型，允许变形虫形成所谓的\emph{circuits}。给定一个连接的变形虫结构，电路是由变形虫形成的子图，允许信号的即时传输。我们表明，这样的扩展允许显着更快的解决方案，以各种问题相关的可编程物质。更具体地说，我们提供了算法的领导选举，共识，罗盘对齐，手征协议和形状识别。领导者选举可以在$Θ(\log n)$轮中解决，w.h.p.，在$O(1)$轮中的一致性以及罗盘对准和手性一致性两者都可以在$O(\log n)$轮中解决，w.h. p。对于形状识别，变形虫必须决定变形虫结构是否形成特定形状。我们展示了如何变形虫可以检测线性和多项式边比内$Θ(\log{n})$轮，最后，我们表明，变形虫可以检测三角形组成的形状内$O(1)$轮，WH。
英文摘要：
We consider an extension to the geometric amoebot model that allows amoebots to form so-called \emph{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 how the amoebots can detect a parallelogram with linear and polynomial side ratio within $Θ(\log{n})$ rounds, w.h.p. Finally, we show that the amoebots can detect a shape composed of triangles within $O(1)$ rounds, w.h.p.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
