Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks

We implement and evaluate different methods for the reconfiguration of a connected arrangement of tiles into a desired target shape, using a single active robot that can move along the tile structure. This robot can pick up, carry, or drop off one tile at a time, but it must maintain a single connected configuration at all times.Becker et al. [5] recently proposed an algorithm that uses histograms as canonical intermediate configurations, guaranteeing performance within a constant factor of the optimal solution if the start and target configuration are well-separated. We implement and evaluate this algorithm, both in a simulated and practical setting, using an inchworm type robot to compare it with two existing heuristic algorithms.

Authors

Institutions

Publication Details

Published
2025-08-17
DOI
https://doi.org/10.1109/case58245.2025.11163739
Primary Topic
Modular Robots and Swarm Intelligence
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks

Sándor P. Fekete, Dan Biediger, Javier G. García, Michael Yannuzzi et al.
Modular Robots and Swarm Intelligence
article

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks

Sándor P. Fekete, Dan Biediger, Javier G. García, Michael Yannuzzi, Aaron T. Becker, Christian Rieck, Christian Scheffer, Ramin Kosfeld, Peter Krämer, Arne Schmidt, Jonas Friemel, Harm Kube
article en

Abstract

We implement and evaluate different methods for the reconfiguration of a connected arrangement of tiles into a desired target shape, using a single active robot that can move along the tile structure. This robot can pick up, carry, or drop off one tile at a time, but it must maintain a single connected configuration at all times.Becker et al. [5] recently proposed an algorithm that uses histograms as canonical intermediate configurations, guaranteeing performance within a constant factor of the optimal solution if the start and target configuration are well-separated. We implement and evaluate this algorithm, both in a simulated and practical setting, using an inchworm type robot to compare it with two existing heuristic algorithms.

University of Kassel (DE), Center for Discrete Mathematics and Theoretical Computer Science (US), Bochum University of Applied Sciences (DE), University of Houston (US), Technische Universität Berlin (DE), Technische Universität Braunschweig (DE)
Openalex Percentile: Top 73%
Modular Robots and Swarm Intelligence
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.