,
Willem Sonke
,
Bettina Speckmann
,
Jules Wulms
Creative Commons Attribution 3.0 Unported license
Face-connected configurations of cubes are a common model for modular robots in three dimensions. In this abstract and the accompanying video we study reconfigurations of such modular robots using so-called sliding moves. Using sliding moves, it is always possible to reconfigure one face-connected configuration of n cubes into any other, while keeping the robot connected at all stages of the reconfiguration. For certain configurations Ω(n²) sliding moves are necessary. In contrast, the best current upper bound is O(n³). It has been conjectured that there is always a cube on the outside of any face-connected configuration of cubes which can be moved without breaking connectivity. The existence of such a cube would immediately imply a straight-forward O(n²) reconfiguration algorithm. However, we present a configuration of cubes such that no cube on the outside can move without breaking connectivity. In other words, we show that this particular avenue towards an O(n²) reconfiguration algorithm for face-connected cubes is blocked.
@InProceedings{miltzow_et_al:LIPIcs.SoCG.2020.78,
author = {Miltzow, Tillmann and Parada, Irene and Sonke, Willem and Speckmann, Bettina and Wulms, Jules},
title = {{Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {78:1--78:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.78},
URN = {urn:nbn:de:0030-drops-122363},
doi = {10.4230/LIPIcs.SoCG.2020.78},
annote = {Keywords: Sliding cubes, Reconfiguration, Modular robots}
}