Motivated by the problem of manipulating nanoscale materials, we investigate the problem of reconfiguring a set of tiles into certain shapes by robots with limited computational capabilities. As a first step towards developing a general framework for these problems, we consider the problem of rearranging a connected set of hexagonal tiles by a single deterministic finite automaton. After investigating some limitations of a single-robot system, we show that a feasible approach to build a particular shape is to first rearrange the tiles into an intermediate structure by performing very simple tile movements. We introduce three types of such intermediate structures, each having certain advantages and disadvantages. Each of these structures can be built in asymptotically optimal $O(n^2)$ rounds, where $n$ is the number of tiles. As a proof of concept, we give an algorithm for reconfiguring a set of tiles into a triangle through one of the intermediate structures.
|Status||Gepubliceerd - 2018|
|Evenement||6th Workshop on Biological Distributed Algorithms (BDA 2018) - London, Verenigd Koninkrijk|
Duur: 23 jul 2018 → 23 jul 2018
|Workshop||6th Workshop on Biological Distributed Algorithms (BDA 2018)|
|Verkorte titel||BDA 2018|
|Periode||23/07/18 → 23/07/18|