Mostra el registre d'ítem simple
Reconfiguration of cube-style modular robots using O(logn) parallel moves
dc.contributor.author | Aloupis, Greg |
dc.contributor.author | Collette, Sébastien |
dc.contributor.author | Demaine, Erik D. |
dc.contributor.author | Langerman, Stefan |
dc.contributor.author | Sacristán Adinolfi, Vera |
dc.contributor.author | Wuhrer, Stefanie |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2010-10-18T15:43:18Z |
dc.date.available | 2010-10-18T15:43:18Z |
dc.date.created | 2008 |
dc.date.issued | 2008 |
dc.identifier.citation | Aloupis, G. [et al.]. Reconfiguration of cube-style modular robots using O(logn) parallel moves. A: International Symposium on Algorithms and Computation. "19th International Symposium on Algorithms and Computation". Gold Cost: Lecture Notes in Computer Science LNCS 5369, Springer-Verlag, 2008, p. 342-353. |
dc.identifier.uri | http://hdl.handle.net/2117/9778 |
dc.description.abstract | We consider a model of reconfigurable robot, introduced and prototyped by the robotics community. The robot consists of independently manipulable unit-square atoms that can extend/contract arms on each side and attach/detach from neighbors. The optimal worst-case number of sequential moves required to transform one connected configuration to another was shown to be Θ(n) at ISAAC 2007. However, in principle, atoms can all move simultaneously. We develop a parallel algorithm for reconfiguration that runs in only O(log n) parallel steps, although the total number of operations increases slightly to Θ(n log n). The result is the first (theoretically) almost-instantaneous universally reconfigurable robot built from simple units. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.publisher | Lecture Notes in Computer Science LNCS 5369, Springer-Verlag |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject.lcsh | Robotics |
dc.subject.lcsh | Parallel algorithms |
dc.subject.lcsh | Atoms |
dc.subject.lcsh | Computational geometry |
dc.title | Reconfiguration of cube-style modular robots using O(logn) parallel moves |
dc.type | Conference report |
dc.subject.lemac | Robòtica |
dc.subject.lemac | Algorismes paral·lels |
dc.subject.lemac | Àtoms |
dc.subject.lemac | Geometria computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1007/978-3-540-92182-0_32 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 2377579 |
dc.description.version | Postprint (published version) |
local.citation.author | Aloupis, G.; Collette, S.; Demaine, E.D.; Langerman, S.; Sacristán, V.; Wuhrer, S. |
local.citation.contributor | International Symposium on Algorithms and Computation |
local.citation.pubplace | Gold Cost |
local.citation.publicationName | 19th International Symposium on Algorithms and Computation |
local.citation.startingPage | 342 |
local.citation.endingPage | 353 |