Self-Assembly with Geometric Tiles
Bin Fu, Matthew J. Patitz, Robert T. Schweller, Bobby Sheline

TL;DR
This paper introduces a geometric tile assembly model that significantly reduces the number of tile types needed for shape assembly, offers methods for simulating complex systems, and analyzes geometric complexity for compatibility.
Contribution
It generalizes the aTAM with geometric tiles, demonstrating reduced tile complexity and providing simulation and geometric design methods for efficient assembly.
Findings
Asymptotically fewer tile types are needed for n x n squares at temperature 1.
A method for simulating temperature 2 systems with geometric tiles at temperature 1.
Bounds on geometric complexity for compatibility specifications.
Abstract
In this work we propose a generalization of Winfree's abstract Tile Assembly Model (aTAM) in which tile types are assigned rigid shapes, or geometries, along each tile face. We examine the number of distinct tile types needed to assemble shapes within this model, the temperature required for efficient assembly, and the problem of designing compact geometric faces to meet given compatibility specifications. Our results show a dramatic decrease in the number of tile types needed to assemble squares to at temperature 1 for the most simple model which meets a lower bound from Kolmogorov complexity, and in a model in which tile aggregates must move together through obstacle free paths within the plane. This stands in contrast to the tile types at temperature 2 needed in the basic aTAM. We also provide a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced biosensing and bioanalysis techniques · DNA and Biological Computing · Modular Robots and Swarm Intelligence
