Adaptive flocking of robot swarms: Algorithms and properties

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

Abstract

This paper presents a distributed approach for adaptive flocking of swarms of mobile robots that enables to navigate autonomously in complex environments populated with obstacles. Based on the observation of the swimming behavior of a school of fish, we propose an integrated algorithm that allows a swarm of robots to navigate in a coordinated manner, split into multiple swarms, or merge with other swarms according to the environment conditions. We prove the convergence of the proposed algorithm using Lyapunov stability theory. We also verify the effectiveness of the algorithm through extensive simulations, where a swarm of robots repeats the process of splitting and merging while passing around multiple stationary and moving obstacles. The simulation results show that the proposed algorithm is scalable, and robust to variations in the sensing capability of individual robots. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Lee, G., & Chong, N. Y. (2008). Adaptive flocking of robot swarms: Algorithms and properties. IEICE Transactions on Communications, E91-B(9), 2848–2855. https://doi.org/10.1093/ietcom/e91-b.9.2848

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