首页 /研究 /A complete, local and parallel reconfiguration algorithm for cube style modular robots
OTHER

A complete, local and parallel reconfiguration algorithm for cube style modular robots

S. Vassilvitskii, Mark Yim, J.W. Suh

发表年份
2003
引用次数
123

摘要

We present a complete, local, and parallel reconfiguration algorithm for metamorphic robots made up of Telecubes, six degree of freedom cube shaped modules currently being developed at PARC. We show that by using 2 /spl times/ 2 /spl times/ 2 meta-modules we can achieve completeness of reconfiguration space using only local rules. Furthermore, this reconfiguration can be done in place and massively in parallel with many simultaneous module movements. Finally we present a loose quadratic upper bound on the total number of module movements required by the algorithm.

关键词

Control reconfigurationSelf-reconfiguring modular robotComputer scienceModular designCube (algebra)RobotAlgorithmUpper and lower boundsParallel computingMathematics

相关论文

查看 OTHER 分类全部论文