Amoebot – A New Model for Programmable Matter

Zahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann.
[ACM] — Brief announcement in Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’14), pp. 220-222, 2014.

Overview

This brief announcement introduces the amoebot model for programmable matter. Particles are defined as finite automaton that exist on the triangular lattice, and their actions are described using transition functions. These particles act asynchronously, each running the same distributed algorithm to achieve a desired goal.

Resources

• [Talk Slides] Programmable Matter: Models and Algorithms. Andréa W. Richa. Biological Distributed Algorithms (BDA ’14), Austin, TX, USA. October 12, 2014.

Press

None.

BibTeX

@InProceedings{Derakhshandeh2014,
Title = {Brief Announcement: Amoebot — A New Model for Programmable Matter},
Author = {Derakhshandeh, Zahra and Dolev, Shlomi and Gmyr, Robert and Richa, Andr\’ea W. and Scheideler, Christian and Strothmann, Thim}, Booktitle = {Proceedings of the 26th {ACM} Symposium on Parallelism in Algorithms and Architectures},
Series = {SPAA ’14},
Pages = {220–222},
Publisher = {ACM},
Address = {New York, NY, USA},
Year = {2014} }

Related Publications

This brief announcement supplants the earlier BDA 2013 workshop paper that discussed a work-in-progress version of the amoebot model. Then, after years of revision and polishing, this version of the model was eventually replaced by the one discussed in the 2019 book chapter Computing by Programmable Particles.