DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/9774

Arxiu Descripció MidaFormat
realisticreconfiguration.pdf435,85 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Aloupis, G. [et al.]. Realistic reconfiguration of crystalline (and telecube) robots. A: International Workshop on the Algorithmic Foundations of Robotics. "8th International Workshop on the Algorithmic Foundations of Robotics". Guanajuato: CIMAT, 2008, p. 433-447.
Títol: Realistic reconfiguration of crystalline (and telecube) robots
Autor: Wuhrer, Stefanie; Sacristán Adinolfi, Vera Veure Producció científica UPC; Ramaswami, Suneeta; Pinciu, Val; Aloupis, Greg; Collette, Sébastien; Damian, Mirela; Demaine, Erik D.; El-Khechen, Dania; Flatland, Robin; Langerman, Stefan; O'Rourke, Joseph
Editorial: CIMAT
Data: 2008
Tipus de document: Conference report
Resum: In this paper we propose novel algorithms for reconfiguring modular robots that are composed of n atoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or detach from faces of neighboring atoms. For universal reconfiguration, atoms must be arranged in 2 x 2 x 2 modules. We respect certain physical constraints: each atom reaches at most unit velocity and (via expansion) can displace at most one other atom. We require that one of the atoms can store a map of the target con guration. Our algorithms involve a total of O(n²) such atom operations, which are performed in O(n) parallel steps. This improves on previous reconfiguration algorithms, which either use O(n²) parallel steps [7, 9, 4] or do not respect the constraints mentioned above [1]. In fact, in the setting considered, our algorithms are optimal, in the sense that certain reconfigurations require Ω(n) parallel steps. A further advantage of our algorithms is that reconfiguration can take place within the union of the source and target configurations.
ISBN: 978-3-642-00311-0
URI: http://hdl.handle.net/2117/9774
Versió de l'editor: http://parasol.cs.tamu.edu/wafr08/papers/wafr08-aloupis.pdf
Apareix a les col·leccions:DCCG - Grup de recerca en geometria computacional, combinatoria i discreta. Ponències/Comunicacions de congressos
Departaments de Matemàtica Aplicada. Ponències/Comunicacions de congressos
Altres. Enviament des de DRAC
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius