For any weighting between empty and loaded robot moves, single-robot tile reconfiguration is NP-hard, and disjoint start/target boxes admit a constant-factor approximation with optimal carry distance for 2-scaled shapes.
Akitaya, Esther M
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
For any weighting between empty and loaded robot moves, single-robot tile reconfiguration is NP-hard, and disjoint start/target boxes admit a constant-factor approximation with optimal carry distance for 2-scaled shapes.