Home /Research /A distance weighted-based approach for self-organized aggregation in robot swarms
SWARM

A distance weighted-based approach for self-organized aggregation in robot swarms

Belkacem Khaldi, Fouzi Harrou, Foudil Cherif, Ying Sun

Year
2017
Citations
7

Abstract

In this paper, a Distance-Weighted K Nearest Neighboring (DW-KNN) topology is proposed to study self-organized aggregation as an emergent swarming behavior within robot swarms. A virtual physics approach is applied among the proposed neighborhood topology to keep the robots together. A distance-weighted function based on a Smoothed Particle Hydrodynamic (SPH) interpolation approach is used as a key factor to identify the K-Nearest neighbors taken into account when aggregating the robots. The intra virtual physical connectivity among these neighbors is achieved using a virtual viscoelastic-based proximity model. With the ARGoS based-simulator, we model and evaluate the proposed approach showing various self-organized aggregations performed by a swarm of N foot-bot robots.

Keywords

RobotComputer scienceTopology (electrical circuits)Swarming (honey bee)Swarm roboticsInterpolation (computer graphics)Key (lock)Swarm behaviourFunction (biology)Artificial intelligence

Related papers

Browse all SWARM papers