Computing Motion Plans for Assembling Particles with Global Control
arXiv:2307.02873
Abstract
We investigate motion planning algorithms for the assembly of shapes in the \emph{tilt model} in which unit-square tiles move in a grid world under the influence of uniform external forces and self-assemble according to certain rules. We provide several heuristics and experimental evaluation of their success rate, solution length, runtime, and memory consumption.
20 pages, 12 figures