Modular self-reconfigurable robots can be used to build objects either by filling the space entirely with robots (densely packed) or by constructing a hollow internal structure (scaffolding) and coating the outside. Scaffolding offers many advantages for building an object versus a densely packed representation. However, the different approaches have never been compared. In this article, we define and evaluate metrics for comparing scaffolding algorithms and we test them on three existing scaffolding algorithms.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Quantitative Comparison of Self-reconfiguration Algorithms for 3D Catoms

  • Gilles Abdel Ahad,
  • Nancy Awad,
  • Benoit Piranda,
  • Jad Bassil,
  • Justin Werfel,
  • Julien Bourgeois

摘要

Modular self-reconfigurable robots can be used to build objects either by filling the space entirely with robots (densely packed) or by constructing a hollow internal structure (scaffolding) and coating the outside. Scaffolding offers many advantages for building an object versus a densely packed representation. However, the different approaches have never been compared. In this article, we define and evaluate metrics for comparing scaffolding algorithms and we test them on three existing scaffolding algorithms.