par Aloupis, Greg 
;Benbernou, Nadia;Damian, Mirela;Demaine, Erik D. ;Flatland, Robin R.;Iacono, John ;Wuhrer, Stefanie S.
Référence Computational geometry, 46, 8, page (917-928)
Publication Publié, 2013
;Benbernou, Nadia;Damian, Mirela;Demaine, Erik D. ;Flatland, Robin R.;Iacono, John ;Wuhrer, Stefanie S.Référence Computational geometry, 46, 8, page (917-928)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | Modular robots consist of many identical units (or atoms) that can attach together and perform local motions. By combining such motions, one can achieve a reconfiguration of the global shape of a robot. The term modular comes from the idea of grouping together a fixed number of atoms into a metamodule, which behaves as a larger individual component. Recently, a fair amount of research has focused on algorithms for universal reconfiguration using Crystalline and Telecube metamodules, which use expanding/contracting cubical atoms. From an algorithmic perspective, this work has achieved some of the best asymptotic reconfiguration times under a variety of different physical models. In this paper we show that these results extend to other types of modular robots, thus establishing improved upper bounds on their reconfiguration times. We describe a generic class of modular robots, and we prove that any robot meeting the generic class requirements can simulate the operation of a Crystalline atom by forming a six-arm structure. Previous reconfiguration bounds thus transfer automatically by substituting the six-arm structures for the Crystalline atoms. We also discuss four prototyped robots that satisfy the generic class requirements: M-TRAN, SuperBot, Molecube, and RoomBot. © 2013 Elsevier B.V. All rights reserved. |
