Linear Reconfiguration of Cube-Style Modular Robots
In this paper we propose a novel algorithm that, given a source robot S and a target robot T, reconfigures S into T. Both S and T are robots composed of n atoms arranged in 2 ×2 ×2 meta-modules. The reconfiguration involves a total of O(n) atom operations (expand, contract, attach, detach) and is performed in O(n) parallel steps. This improves on previous reconfiguration algorithms [1,2,3], which require O(n2) parallel steps. Our algorithm is in place; that is, the reconfiguration takes place within the union of the bounding boxes of the source and target robots. We show that the algorithm can also be implemented in a synchronous, distributed fashion.
- 2.Vassilvitskii, S., Suh, Y.M.: A complete, local and parallel reconfiguration algorithm for cube style modular robots. In: Proc. of the IEEE Intl. Conf. on Robotics and Automation, pp. 117–122 (2002)Google Scholar
- 5.Suh, J.W., Homans, S.B., Yim, M.: Telecubes: Mechanical design of a module for self-reconfigurable robotics. In: Proc. of the IEEE Intl. Conf. on Robotics and Automation, pp. 4095–4101 (2002)Google Scholar
- 6.Hackl, T.: Personal communication (2007)Google Scholar
- 7.Aloupis, G., Collette, S., Damian, M., Demaine, E.D., Flatland, R., Langerman, S., O’Rourke, J., Ramaswami, S., Sacristán, V., Wuhrer, S.: Linear reconfiguration of cube-style modular robots (2007), www.cs.siena.edu/papers/cbots_long.pdf
- 8.Arkin, E., Bender, M., Mitchell, J., Polishchuk, V.: The snowblower problem. In: Proc. 7th Intl. Workshop on the Algorithmic Foundations of Robotics (2006)Google Scholar