Leader Election and Shape Formation with Self-Organizing Programmable Matter

Preprint English OPEN
Daymude, Joshua J.; Derakhshandeh, Zahra; Gmyr, Robert; Strothmann, Thim; Bazzi, Rida; Richa, Andréa W.; Scheideler, Christian;
  • Subject: Computer Science - Emerging Technologies

We consider programmable matter consisting of simple computational elements, called particles, that can establish and release bonds and can actively move in a self-organized way, and we investigate the feasibility of solving fundamental problems relevant for programmabl... View more
  • References (42)
    42 references, page 1 of 5

    1. L. M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266(11):1021-1024, 1994.

    2. Chrysovalandis Agathangelou, Chryssis Georgiou, and Marios Mavronicolas. A distributed algorithm for gathering many fat mobile robots in the plane. In Proceedings of the 2013 ACM symposium on Principles of distributed computing, pages 250-259. ACM, 2013.

    3. R. Ananthakrishnan and A. Ehrlicher. The forces behind cell movement. International Journal of Biological Sciences, 3(5):303-317, 2007.

    4. D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235- 253, 2006.

    5. D. Arbuckle and A. Requicha. Self-assembly and self-repair of arbitrary shapes by a swarm of reactive robots: algorithms and simulations. Autonomous Robots, 28(2):197-211, 2010.

    6. Baruch Awerbuch and Rafail Ostrovsky. Memory-efficient and self-stabilizing network {RESET} (extended abstract). In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994, pages 254-263, 1994.

    7. L. Barriere, P. Flocchini, E. Mesa-Barrameda, and N. Santoro. Uniform scattering of autonomous mobile robots in a grid. Int. Journal of Foundations of Computer Science, 22(3):679-697, 2011.

    8. A. Bhattacharyya, M. Braverman, B. Chazelle, and H.L. Nguyen. On the convergence of the hegselmann-krause system. CoRR, abs/1211.1909, 2012.

    9. D. Boneh, C. Dunworth, R. J. Lipton, and J. Sgall. On the computational power of DNA. Discrete Applied Mathematics, 71:79-94, 1996.

    10. V. Bonifaci, K. Mehlhorn, and G. Varma. Physarum can compute shortest paths. In Proceedings of SODA '12, pages 233-240, 2012.

  • Similar Research Results (4)
  • Related Organizations (3)
  • Metrics
Share - Bookmark