Name
Abstract | ||
|---|---|---|
In this paper we consider programmable matter that consists of computationally limited devices (which we call particles) that are able to self-organize in order to achieve a desired collective goal without the need for central control or external intervention. Particles can establish and release bonds and can actively move in a self-organized way. We investigate the feasibility of solving fundamental problems relevant for programmable matter. As a model for such self-organizing particle systems, we use the geometric amoebot model that has received some attention in the last years. We present an efficient local-control algorithm for leader election, that elects a leader particle in O(n) rounds with high probability, where n is the number of particles in the system. Our algorithm relies only on local information (e.g., particles do not have ids, nor do they know n, or have any sort of global coordinate system), and requires only a constant-size memory per particle. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Emerging Technologies | Leader election,Telecommunications,Programmable matter,Engineering |
DocType | Volume | Citations |
Journal | abs/1701.03616 | 1 |
PageRank | References | Authors |
0.36 | 19 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joshua J. Daymude | 1 | 21 | 4.52 |
| Robert Gmyr | 2 | 79 | 9.70 |
| Andréa W. Richa | 3 | 968 | 164.82 |
| Christian Scheideler | 4 | 1729 | 152.71 |
| Thim Strothmann | 5 | 80 | 9.78 |