Emergent flocking with low-end swarm robots

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

Abstract

This article analyses a flocking algorithm that was developed specifically for small and simple swarm robots. It is similar to traditional flocking algorithms for swarm robots, however it does not need communication nor global information. Its only requirements are at least 4 circumferential distance sensors which can have very limited range. This is possible because our algorithm generates emergent alignment of flock members. We show an analysis of our simulations and a short overview of a real robot experiment. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Moeslinger, C., Schmickl, T., & Crailsheim, K. (2010). Emergent flocking with low-end swarm robots. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6234 LNCS, pp. 424–431). https://doi.org/10.1007/978-3-642-15461-4_40

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