Paper by Erik D. Demaine

Reference:
MIT–NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, and Irina Kostitsyna, “Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints”, in Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), edited by Hans L. Bodlaender, LIPIcs, volume 294, Helsinki, Finland, June 12–14, 2024, 34:1–34:18.

Abstract:
We introduce and analyze a model for self-reconfigurable robots made up of unit-cube modules. Compared to past models, our model aims to newly capture two important practical aspects of real-world robots. First, modules often do not occupy an exact unit cube, but rather have features like bumps extending outside the allotted space so that modules can interlock. Thus, for example, our model forbids modules from squeezing in between two other modules that are one unit distance apart. Second, our model captures the practical scenario of many passive modules assembled by a single robot, instead of requiring all modules to be able to move on their own.

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.

Comments:
This paper is also available from LIPIcs and as arXiv:2405.15724.

Length:
The paper is 18 pages.

Availability:
The paper is available in PDF (15224k).
See information on file formats.
[Google Scholar search]


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated November 12, 2024 by Erik Demaine.