arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.11663cs.DCcs.CG
收藏

可编程物质的快速重构

Fast Reconfiguration for Programmable Matter

KBR at NASA Ames Research Centre(NASA艾姆斯研究中心KBR);TU Eindhoven(埃因霍温理工大学)

Irina Kostitsyna, Tom Peters, Bettina Speckmann

AI总结:

本文提出了一种无需传统中间配置的可编程物质快速重构算法,利用几何原语在最坏情况下以线性时间完成形状转换。

摘要:

可编程物质的概念设想了由大量微小且简单的机器人粒子组成的智能材料。尽管这些粒子只能进行局部通信、局部移动和简单计算,但它们的行为仍可以导致材料物理性质和几何形状的全局变化。对于可编程物质来说,一个基本的算法任务是通过指定粒子的局部行为来实现全局形状重构。在本文中,我们描述了一种新的形状重构方法,该方法在amoebot模型中实现了形状重构。amoebot模型是一种分布式模型,显著限制了单个粒子的内存、计算和通信能力。因此,挑战在于协调粒子的行为以产生所需的全局系统行为。我们的重构算法是第一个不使用传统中间配置来转换任意形状的算法。我们引入了新的几何原语用于amoebots,并展示了如何使用这些原语在最坏情况下以线性数量的激活轮次内重构粒子系统。实际上,我们的方法利用输入和输出形状对称差的几何特性:当输入和目标形状的对称差较小时,它会最小化粒子系统的不必要的分解和重构。此外,我们的重构算法会将粒子沿尽可能多的并行最短路径移动。

英文摘要:

The concept of programmable matter envisions a very large number of tiny and simple robot particles forming a smart material. Even though the particles are restricted to local communication, local movement, and simple computation, their actions can nevertheless result in the global change of the material's physical properties and geometry. A fundamental algorithmic task for programmable matter is to achieve global shape reconfiguration by specifying local behavior of the particles. In this paper we describe a new approach for shape reconfiguration in the \emph{amoebot} model. The amoebot model is a distributed model which significantly restricts memory, computing, and communication capacity of the individual particles. Thus the challenge lies in coordinating the actions of particles to produce the desired behavior of the global system. Our reconfiguration algorithm is the first algorithm that does not use a canonical intermediate configuration when transforming between arbitrary shapes. We introduce new geometric primitives for amoebots and show how to reconfigure particle systems, using these primitives, in a linear number of activation rounds in the worst case. In practice, our method exploits the geometry of the symmetric difference between input and output shape: it minimizes unnecessary disassembly and reassembly of the particle system when the symmetric difference between the initial and the target shapes is small. Furthermore, our reconfiguration algorithm moves the particles over as many parallel shortest paths as the problem instance allows.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑