Self-organizing formation algorithm for active elements

Kenichi Fujibayashi, Satoshi Murata, Ken Sugawara, Masayuki Yamamura

研究成果: Conference article査読

38 被引用数 (Scopus)


In this paper, 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 certain spatial pattern like a crystal, and to make the outline of the group in desired shape. For this purpose, we proposed a method by using virtual springs among the elements. In this algorithm, an element generates virtual springs between neighbor element based on information how many other elements exist in neighborhood with a certain radius. Although the elements interact locally only by virtual springs, and they don't have global information at all, they form a shape much larger than the sensory radius. By 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 design of self-assembling nano machines in future.

ジャーナルProceedings of the IEEE Symposium on Reliable Distributed Systems
出版ステータスPublished - 2002
イベントThe 21st IEEE Symposium on Reliable Distributed Systems (SRDS-2002) - Suita, Japan
継続期間: 2002 10 132002 10 16

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信


「Self-organizing formation algorithm for active elements」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。