Computing Motion Plans for Assembling Particles with Global Control

TL;DR

This paper explores motion planning algorithms for assembling shapes using unit-square tiles in a grid under global control, evaluating heuristics through experiments on success rate, efficiency, and resource use.

Contribution

It introduces heuristics for shape assembly in the tilt model and provides experimental analysis of their performance and resource requirements.

Findings

Heuristics achieve varying success rates

Solution length and runtime are analyzed

Memory consumption impacts are evaluated

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.