2023-12-06T15:33:15Zhttps://keep.lib.asu.edu/oai/requestoai:keep.lib.asu.edu:node-1556662021-08-27T02:47:01Zoai_pmh:alloai_pmh:repo_items155666
https://hdl.handle.net/2286/R.I.44322
http://rightsstatements.org/vocab/InC/1.0/
All Rights Reserved
2017
136 pages
Doctoral Dissertation
Academic theses
Text
eng
Derakhshandeh, Zahra
Richa, Andrea
Sen, Arunabha
Xue, Guoliang
Scheideler, Christian
Arizona State University
Doctoral Dissertation Computer Science 2017
Imagine that we have a piece of matter that can change its physical properties like its 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. Envisioning systems of nano-sensors devices, programmable matter consists of systems of simple computational elements, called particles, that can establish and release bonds, compute, and can actively move in a self-organized way. In this dissertation the feasibility of solving fundamental problems relevant for programmable matter is investigated. As a model for such self-organizing particle systems (SOPS), the geometric amoebot model is introduced. In this model, particles only have local information and have modest computational power. They achieve locomotion by expanding and contracting, which resembles the behavior of amoeba. Under this model, efficient local-control algorithms for the leader election problem in SOPS are presented. As a central problem for programmable matter, shape formation problems are then studied. The limitations of solving the leader election problem and the shape formation problem on a more general version of the amoebot model are also discussed. The \smart paint" problem is also studied which aims at having the particles self-organize in order to uniformly coat the surface of an object of arbitrary shape and size, forming multiple coating layers if necessary. A Universal Coating algorithm is presented and shown to be asymptotically worst-case optimal both in terms of time with high probability and work. In particular, the algorithm always terminates within a linear number of rounds with high probability. A linear lower bound on the competitive gap between fully local coating algorithms and coating algorithms that rely on global information is presented, which implies that the proposed algorithm is also optimal in a competitive sense. Simulation results show that the competitive ratio of the proposed algorithm may be better than linear in practice. Developed algorithms utilize only local control, require only constant-size memory particles, and are asymptotically optimal in terms of the total number of particle movements needed to reach the desired shape configuration.
Computer Science
Computer Engineering
Information Technology
Algorithmic Foundations
Distributed Computing
Object Coating
Programmable Matter
Self-Organizing Particle Systems
Shape Formation
Algorithmic Foundations of Self-Organizing Programmable Matter