Self-organizing formation algorithm for active elements
Self-organizing formation algorithm for active elements
复制标题
DOI：
10.1109/reldis.2002.1180220
复制
发表时间：
2002-10
期刊：
影响因子：
--
通讯作者：
Kenichi Fujibayashi;S. Murata;K. Sugawara;M. Yamamura
中科院分区：
文献类型：
--
作者：
Kenichi Fujibayashi;S. Murata;K. Sugawara;M. Yamamura
我们提出了一种新的自组织形成方法。假设元素之间没有相互连接，它们可以在连续空间中移动。目标是将元素像水晶一样排列成一定的空间模式，并使群体的轮廓具有所需的形状。为此，我们提出了在元件之间使用虚拟弹簧的方法。在该算法中，一个元素根据在一定半径的邻域内存在多少其他元素的信息，在相邻元素之间生成虚拟弹簧。虽然这些元素仅通过虚拟弹簧在局部相互作用，而且它们根本没有全局信息，但它们形成的形状比感觉半径大得多。通过仿真研究，我们证实了从随机状态收敛到目标形状的概率非常高。该算法给出了一种新的自组织形成原理，它的简洁性将有助于未来自组装纳米机器的设计。
We propose a novel method of self-organizing formation. It is assumed that elements are not connected to each other and they can move in continuous space. The objective is to arrange elements in a certain spatial pattern like a crystal, and to make the outline of the group in the desired shape. For this purpose, we propose a method by using virtual springs among the elements. In this algorithm, an element generates virtual springs between the neighbor element based on information of how many other elements exist in the neighborhood with a certain radius. Although the elements interact locally, only by virtual springs, and they do not have global information at all, they form a shape much larger than the sensory radius. By a simulation study, we confirmed convergence to a target shape from a random state in very high probability. This kind of algorithm gives a new principle of self-organizing formation, and its simplicity will be useful for the design of self-assembling nano machines in future.