License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2017.48
URN: urn:nbn:de:0030-drops-80019
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8001/
Di Luna, Giuseppe A. ;
Flocchini, Paola ;
Santoro, Nicola ;
Viglietta, Giovanni ;
Yamauchi, Yukiko
Brief Announcement: Shape Formation by Programmable Particles
Abstract
Shape formation is a basic distributed problem for systems of computational mobile entities. Intensively studied for systems of autonomous mobile robots, it has recently been investigated in the realm of programmable matter. Namely, it has been studied in the geometric Amoebot model, where the anonymous entities, called particles, operate on a hexagonal tessellation of the plane, have constant memory, can only communicate with neighboring particles, and can only move from a grid node to an empty neighboring node; their activation is controlled by an adversarial scheduler. Recent investigations have shown how, starting from a well-structured configuration in which the particles form a (not necessarily complete) triangle, the particles can form a large class of shapes. This result has been established under several assumptions: agreement on the clockwise direction (i.e., chirality), a sequential activation schedule, and randomization.
In this paper we provide a characterization of which shapes can be formed deterministically starting from any simply connected initial configuration of n particles. As a byproduct, if randomization is allowed, then any input shape can be formed from any initial (simply connected) shape by our algorithm, provided that n is large enough. Our algorithm works without chirality, proving that chirality is computationally irrelevant for shape formation. Furthermore, it works under a strong adversarial scheduler, not necessarily sequential. We also consider the complexity of shape formation both in terms of the number of rounds and the total number of moves performed by the particles executing a universal shape formation algorithm. We prove that our solution has a complexity of O(n^2) rounds and moves: this number of moves is also asymptotically optimal.
BibTeX - Entry
@InProceedings{diluna_et_al:LIPIcs:2017:8001,
author = {Giuseppe A. Di Luna and Paola Flocchini and Nicola Santoro and Giovanni Viglietta and Yukiko Yamauchi},
title = {{Brief Announcement: Shape Formation by Programmable Particles}},
booktitle = {31st International Symposium on Distributed Computing (DISC 2017)},
pages = {48:1--48:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-053-8},
ISSN = {1868-8969},
year = {2017},
volume = {91},
editor = {Andr{\'e}a W. Richa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8001},
URN = {urn:nbn:de:0030-drops-80019},
doi = {10.4230/LIPIcs.DISC.2017.48},
annote = {Keywords: Shape formation, pattern formation, programmable matter, Amoebots, leader election, distributed algorithms, self-assembly}
}
|
Keywords: |
|
Shape formation, pattern formation, programmable matter, Amoebots, leader election, distributed algorithms, self-assembly |
|
Collection: |
|
31st International Symposium on Distributed Computing (DISC 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
12.10.2017 |
