Abstract / Description of output
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.
Original language | English |
---|---|
Pages (from-to) | 339-358 |
Number of pages | 20 |
Journal | Natural Computing |
Volume | 6 |
Issue number | 3 |
DOIs | |
Publication status | Published - Sept 2007 |
Keywords / Materials (for Non-textual outputs)
- Concurrency theory
- distributed algorithm theory
- process algebra