Self-assembling graphs

Authors:
Vincent Danos;Fabien Tarissan
Affiliations:
Équipe PPS, CNRS & Universitéé, Paris VII, France;Équipe PPS, CNRS & Universitéé, Paris VII, France
Venue:
Natural Computing: an international journal
Year:
2007

Citing 5
Cited 2

Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Programmable self-assembly using biologically-inspired multiagent control

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Formal molecular biology

Theoretical Computer Science - Special issue: Computational systems biology
Core formal molecular biology

ESOP'03 Proceedings of the 12th European conference on Programming
Self assembling graphs

IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I

An artificial ants model for fast construction and approximation of proximity graphs

Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
2013 Special Issue: Growing self-organizing trees for autonomous hierarchical clustering

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process algebra, extends Klavins' original proposal (Klavin, 2002: Automatic synthesis of controllers for assembly and formation forming. In: Proceedings of the International Conference on Robotics and Automation), in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins' method dealt only with trees.