2025/06/29 by Javier G. García, Jonas Friemel, Garcia, Javier +21
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Computational Geometry (cs.CG) #DNA and Biological Computing #Data Structures and Algorithms (cs.DS) #Distributed Control Multi-Agent Systems #FOS: Computer and information sciences #Modular Robots and Swarm Intelligence #Robotics (cs.RO)
paper · pdf · doi:10.48550/arxiv.2506.23333
openalex publication_date 2025/06/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. (CCCG 2025) 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.