Brief announcement

On the feasibility of leader election and shape formation with self-organizing programmable matter

Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida Bazzi, Andrea Richa, Christian Scheideler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Imagine that we had a piece of matter that can change its physical properties like shape, density, conductivity, or color in a programmable fashion based on either user input or autonomous sensing. This is the vision behind what is commonly known as programmable matter. Many proposals have already been made for realizing programmable matter, ranging from DNA tiles, shapechanging molecules, and cells created via synthetic biology to reconfigurable modular robotics. We are particularly interested in programmable matter consisting of simple elements called particles that can compute, bond, and move, and the feasibility of solving fundamental problems relevant for programmable matter with these particles. As a model for that programmable matter, we will use a general form of the amoebot model first proposed in SPAA 2014, and as examples of fundamental problems we will focus on leader election and shape formation. For shape formation, we investigate the line formation problem, i.e. we are searching for a local-control protocol so that for any connected structure of particles, the particles will eventually form a line. Prior results on leader election imply that in the general amoebot model there are instances in which leader election cannot be solved by local-control protocols. Additionally, we can show that if there is a local-control protocol that solves the line formation problem, then there is also a protocol that solves the leader election problem, which implies that in the general amoebot model also the line formation problem cannot be solved by a local-control protocol. We also consider a geometric variant of the amoebot model by restricting the particle structures to form a connected subset on a triangular grid. For these structures we can show that there are local-control protocols for the leader election problem and the line formation problem. The protocols can also be adapted to other regular geometric structures demonstrating that it is advisable to restrict particle structures to such structures.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages67-69
Number of pages3
Volume2015-July
ISBN (Print)9781450336178
DOIs
StatePublished - Jul 21 2015
EventACM Symposium on Principles of Distributed Computing, PODC 2015 - Donostia-San Sebastian, Spain
Duration: Jul 21 2015Jul 23 2015

Other

OtherACM Symposium on Principles of Distributed Computing, PODC 2015
CountrySpain
CityDonostia-San Sebastian
Period7/21/157/23/15

Fingerprint

Tile
Robotics
DNA
Physical properties
Color
Molecules
Synthetic Biology

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Derakhshandeh, Z., Gmyr, R., Strothmann, T., Bazzi, R., Richa, A., & Scheideler, C. (2015). Brief announcement: On the feasibility of leader election and shape formation with self-organizing programmable matter. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (Vol. 2015-July, pp. 67-69). Association for Computing Machinery. https://doi.org/10.1145/2767386.2767451

Brief announcement : On the feasibility of leader election and shape formation with self-organizing programmable matter. / Derakhshandeh, Zahra; Gmyr, Robert; Strothmann, Thim; Bazzi, Rida; Richa, Andrea; Scheideler, Christian.

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Vol. 2015-July Association for Computing Machinery, 2015. p. 67-69.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Derakhshandeh, Z, Gmyr, R, Strothmann, T, Bazzi, R, Richa, A & Scheideler, C 2015, Brief announcement: On the feasibility of leader election and shape formation with self-organizing programmable matter. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. vol. 2015-July, Association for Computing Machinery, pp. 67-69, ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastian, Spain, 7/21/15. https://doi.org/10.1145/2767386.2767451
Derakhshandeh Z, Gmyr R, Strothmann T, Bazzi R, Richa A, Scheideler C. Brief announcement: On the feasibility of leader election and shape formation with self-organizing programmable matter. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Vol. 2015-July. Association for Computing Machinery. 2015. p. 67-69 https://doi.org/10.1145/2767386.2767451
Derakhshandeh, Zahra ; Gmyr, Robert ; Strothmann, Thim ; Bazzi, Rida ; Richa, Andrea ; Scheideler, Christian. / Brief announcement : On the feasibility of leader election and shape formation with self-organizing programmable matter. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Vol. 2015-July Association for Computing Machinery, 2015. pp. 67-69
@inproceedings{71ebfaa0214f41479686c85572216bb4,
title = "Brief announcement: On the feasibility of leader election and shape formation with self-organizing programmable matter",
abstract = "Imagine that we had a piece of matter that can change its physical properties like shape, density, conductivity, or color in a programmable fashion based on either user input or autonomous sensing. This is the vision behind what is commonly known as programmable matter. Many proposals have already been made for realizing programmable matter, ranging from DNA tiles, shapechanging molecules, and cells created via synthetic biology to reconfigurable modular robotics. We are particularly interested in programmable matter consisting of simple elements called particles that can compute, bond, and move, and the feasibility of solving fundamental problems relevant for programmable matter with these particles. As a model for that programmable matter, we will use a general form of the amoebot model first proposed in SPAA 2014, and as examples of fundamental problems we will focus on leader election and shape formation. For shape formation, we investigate the line formation problem, i.e. we are searching for a local-control protocol so that for any connected structure of particles, the particles will eventually form a line. Prior results on leader election imply that in the general amoebot model there are instances in which leader election cannot be solved by local-control protocols. Additionally, we can show that if there is a local-control protocol that solves the line formation problem, then there is also a protocol that solves the leader election problem, which implies that in the general amoebot model also the line formation problem cannot be solved by a local-control protocol. We also consider a geometric variant of the amoebot model by restricting the particle structures to form a connected subset on a triangular grid. For these structures we can show that there are local-control protocols for the leader election problem and the line formation problem. The protocols can also be adapted to other regular geometric structures demonstrating that it is advisable to restrict particle structures to such structures.",
author = "Zahra Derakhshandeh and Robert Gmyr and Thim Strothmann and Rida Bazzi and Andrea Richa and Christian Scheideler",
year = "2015",
month = "7",
day = "21",
doi = "10.1145/2767386.2767451",
language = "English (US)",
isbn = "9781450336178",
volume = "2015-July",
pages = "67--69",
booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Brief announcement

T2 - On the feasibility of leader election and shape formation with self-organizing programmable matter

AU - Derakhshandeh, Zahra

AU - Gmyr, Robert

AU - Strothmann, Thim

AU - Bazzi, Rida

AU - Richa, Andrea

AU - Scheideler, Christian

PY - 2015/7/21

Y1 - 2015/7/21

N2 - Imagine that we had a piece of matter that can change its physical properties like shape, density, conductivity, or color in a programmable fashion based on either user input or autonomous sensing. This is the vision behind what is commonly known as programmable matter. Many proposals have already been made for realizing programmable matter, ranging from DNA tiles, shapechanging molecules, and cells created via synthetic biology to reconfigurable modular robotics. We are particularly interested in programmable matter consisting of simple elements called particles that can compute, bond, and move, and the feasibility of solving fundamental problems relevant for programmable matter with these particles. As a model for that programmable matter, we will use a general form of the amoebot model first proposed in SPAA 2014, and as examples of fundamental problems we will focus on leader election and shape formation. For shape formation, we investigate the line formation problem, i.e. we are searching for a local-control protocol so that for any connected structure of particles, the particles will eventually form a line. Prior results on leader election imply that in the general amoebot model there are instances in which leader election cannot be solved by local-control protocols. Additionally, we can show that if there is a local-control protocol that solves the line formation problem, then there is also a protocol that solves the leader election problem, which implies that in the general amoebot model also the line formation problem cannot be solved by a local-control protocol. We also consider a geometric variant of the amoebot model by restricting the particle structures to form a connected subset on a triangular grid. For these structures we can show that there are local-control protocols for the leader election problem and the line formation problem. The protocols can also be adapted to other regular geometric structures demonstrating that it is advisable to restrict particle structures to such structures.

AB - Imagine that we had a piece of matter that can change its physical properties like shape, density, conductivity, or color in a programmable fashion based on either user input or autonomous sensing. This is the vision behind what is commonly known as programmable matter. Many proposals have already been made for realizing programmable matter, ranging from DNA tiles, shapechanging molecules, and cells created via synthetic biology to reconfigurable modular robotics. We are particularly interested in programmable matter consisting of simple elements called particles that can compute, bond, and move, and the feasibility of solving fundamental problems relevant for programmable matter with these particles. As a model for that programmable matter, we will use a general form of the amoebot model first proposed in SPAA 2014, and as examples of fundamental problems we will focus on leader election and shape formation. For shape formation, we investigate the line formation problem, i.e. we are searching for a local-control protocol so that for any connected structure of particles, the particles will eventually form a line. Prior results on leader election imply that in the general amoebot model there are instances in which leader election cannot be solved by local-control protocols. Additionally, we can show that if there is a local-control protocol that solves the line formation problem, then there is also a protocol that solves the leader election problem, which implies that in the general amoebot model also the line formation problem cannot be solved by a local-control protocol. We also consider a geometric variant of the amoebot model by restricting the particle structures to form a connected subset on a triangular grid. For these structures we can show that there are local-control protocols for the leader election problem and the line formation problem. The protocols can also be adapted to other regular geometric structures demonstrating that it is advisable to restrict particle structures to such structures.

UR - http://www.scopus.com/inward/record.url?scp=84957669252&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957669252&partnerID=8YFLogxK

U2 - 10.1145/2767386.2767451

DO - 10.1145/2767386.2767451

M3 - Conference contribution

SN - 9781450336178

VL - 2015-July

SP - 67

EP - 69

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

ER -