Mobility Matters
Home›Programmable matter›Self-organising particle systems›Shape formation by hybrid programmable matter

Shape formation by hybrid programmable matter

One finite-automaton agent rearranges passive tiles into a target shape.

Problem statement and measuresexpand

\(n\) passive hexagonal tiles (rhombic dodecahedra in 3D) occupy nodes of a lattice and form a connected structure. A single active agent, a deterministic finite automaton, starts on a tile, must always stand on or next to a tile, sees its node and the adjacent nodes, and in each round lifts a tile, places the tile it carries, or moves to an adjacent node; it carries at most one tile, and the tiles (with the carried tile counted at the agent's node) must stay connected. It must rearrange the tiles into a target shape (a line, a triangle, or an intermediate structure such as a block or a tree). Time counts the agent's rounds.

Measures: Time, rounds; in each round the agent performs one Look-Compute-Move step.

tight near-optimal polynomial gap unknown impossible· rows follow the assumption tree; each cell: best upper bound vs lower bound, and what forces the lower bound
Setting
Time
Three-dimensional
0 open · 1 results
unknown \(O(n^3)\) vs —
Planar + 2D
0 open · 1 results
tight \(O(n^2)\) vs \(\Omega(n^2)\) one active agent

Know a better result, or found a mistake? Suggest a result · Report an error. Accepted contributions are acknowledged.