Tilt Assembly: Algorithms for Micro-Factories That Build Objects with Uniform External Forces

09/19/2017
by   Aaron T. Becker, et al.
0

We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield micro-factories. The underlying model has particles moving under the influence of uniform external forces until they hit an obstacle; particles can bond when being forced together with another appropriate particle. Due to the physical and geometric constraints, not all shapes can be built in this manner; this gives rise to the Tilt Assembly Problem (TAP) of deciding constructibility. For simply-connected polyominoes P in 2D consisting of N unit-squares ("tiles"), we prove that TAP can be decided in O(N N) time. For the optimization variant MaxTAP (in which the objective is to construct a subshape of maximum possible size), we show polyAPX-hardness: unless P=NP, MaxTAP cannot be approximated within a factor of Ω(N^1/3); for tree-shaped structures, we give an O(N^1/2)-approximation algorithm. For the efficiency of the assembly process itself, we show that any constructible shape allows pipelined assembly, which produces copies of P in O(1) amortized time, i.e., N copies of P in O(N) time steps. These considerations can be extended to three-dimensional objects: For the class of polycubes P we prove that it is NP-hard to decide whether it is possible to construct a path between two points of P; it is also NP-hard to decide constructibility of a polycube P. Moreover, it is expAPX-hard to maximize a path from a given start point.

READ FULL TEXT

page 2

page 3

page 9

page 14

research
07/04/2018

Efficient Parallel Self-Assembly Under Uniform Control Inputs

We prove that by successively combining subassemblies, we can achieve su...
research
05/12/2021

Particle-Based Assembly Using Precise Global Control

In micro- and nano-scale systems, particles can be moved by using an ext...
research
07/15/2019

Full Tilt: Universal Constructors for General Shapes with Uniform External Forces

We investigate the problem of assembling general shapes and patterns in ...
research
09/19/2019

Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm

We consider the problem of approximating a two-dimensional shape contour...
research
07/06/2023

Computing Motion Plans for Assembling Particles with Global Control

We investigate motion planning algorithms for the assembly of shapes in ...
research
02/20/2023

Ultra-conformable Liquid Metal Particle Monolayer on Air/water Interface for Substrate-free E-tattoo

Gallium-based liquid metal is getting increased attention in conformal f...

Please sign up or login with your details

Forgot password? Click here to reset