Swarm robot flocking: An empirical study

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

Abstract

Robots can be used in exploration or investigation of unknown terrains especially if the environment is dangerous. It is customary to employ a sophisticated robot for such task. However, this approach is vulnerable since a failure of the robot means, failure of the entire mission. An emerging approach in robotics research is to employ many simple robots that can collectively achieve a demanding task. Even the failure of some robots should not affect the overall mission. Maneuvering such large systems poses new challenges in controlling them. In our earlier work, a control strategy, namely triangular formation algorithm (TFA), was developed and tested using simulation tools. The TFA is a local interaction strategy which basically makes three neighboring robots to form a regular triangular lattice. Simulation results show that swarm behaviors such as aggregation, flocking and obstacle avoidance can be achieved successfully. Here, we are concerned with implementing the algorithm in practice with real robots. We have developed a swarm of five robots and tested the performance of the algorithm in practice. This paper presents our initial findings. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Ercan, M. F., & Li, X. (2011). Swarm robot flocking: An empirical study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7102 LNAI, pp. 495–504). https://doi.org/10.1007/978-3-642-25489-5_48

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