L-system-driven self-assembly for swarm robotics

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, an assembly swarm algorithm, that will generate microscopic rules from a macroscopic description of complex structures, will be presented. The global structure will be described in a formal way using L-systems (Lindenmayer systems). The proposed algorithm is mainly parallel and exhibit parsimony at microscopic level, being robust and adaptable. In addition, a comparation between a swarm with centralized control and our distributed swarm algorithm will be provided, comparing the time need by the swarm to be assembled and the number of messages exchanged between agents. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Aznar, F., Pujol, M., & Rizo, R. (2011). L-system-driven self-assembly for swarm robotics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7023 LNAI, pp. 303–312). https://doi.org/10.1007/978-3-642-25274-7_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free