This paper introduces a set of tools built to help researchers design algorithms for modular robots. These tools can brute force solutions to specific reconfigurations, visualize movements of modular robots, and can be used to design specific configurations of robots. Multiple models of modular robots are supported, and can be added by users.
@InProceedings{umlmodularroboticsgroup_et_al:LIPIcs.SoCG.2025.85, author = {UML Modular Robotics Group and A. Akitaya, Hugo and Clements, Andrew and Downey, Sam and Eisenbies, Jonathan and Samanta, Soham and Shahrouzi, Gabriel and Stock, Frederick}, title = {{Finding Shortest Reconfiguration Sequences for Modular Robots}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {85:1--85:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.85}, URN = {urn:nbn:de:0030-drops-232371}, doi = {10.4230/LIPIcs.SoCG.2025.85}, annote = {Keywords: modular reconfigurable robots, sliding cube model, reconfiguration} }
Feedback for Dagstuhl Publishing