@InProceedings{SpaceRobots_SWAT2024,
key = {MIT},
AUTHOR = {{MIT--NASA Space Robots Team} and Josh Brunner and Kenneth C. Cheung and Erik D. Demaine and Jenny Diomidova and Christine Gregg and Della H. Hendrickson and Irina Kostitsyna},
TITLE = {Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints},
BOOKTITLE = {Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)},
bookurl = {https://swat2024.github.io/website/},
EDITOR = {Hans L. Bodlaender},
SERIES = {LIPIcs},
VOLUME = 294,
ADDRESS = {Helsinki, Finland},
MONTH = {June 12--14},
YEAR = 2024,
PAGES = {34:1--34:18},
withstudent = 1,
length = {18 pages},
doi = {https://dx.doi.org/10.4230/LIPIcs.SWAT.2024.34},
dblp = {https://dblp.org/rec/conf/swat/TeamBCDDGHK24},
comments = {This paper is also available from <A HREF="https://doi.org/10.4230/LIPIcs.SWAT.2024.34">LIPIcs</A> and as <A HREF="https://arXiv.org/abs/2405.15724">arXiv:2405.15724</A>.},
}
We prove two universality results. First, with a supply of auxiliary modules, we show that any connected polycube structure can be constructed by a carefully aligned plane sweep. Second, without additional modules, we show how to construct any structure for which a natural notion of external feature size is at least a constant; this property largely consolidates forbidden-pattern properties used in previous works on reconfigurable modular robots.