Literature DB >> 29409799

Self-organization in aggregating robot swarms: A DW-KNN topological approach.

Belkacem Khaldi1, Fouzi Harrou2, Foudil Cherif1, Ying Sun3.   

Abstract

In certain swarm applications, where the inter-agent distance is not the only factor in the collective behaviours of the swarm, additional properties such as density could have a crucial effect. In this paper, we propose applying a Distance-Weighted K-Nearest Neighbouring (DW-KNN) topology to the behaviour of robot swarms performing self-organized aggregation, in combination with a virtual physics approach to keep the robots together. A distance-weighted function based on a Smoothed Particle Hydrodynamic (SPH) interpolation approach, which is used to evaluate the robot density in the swarm, is applied as the key factor for identifying the K-nearest neighbours taken into account when aggregating the robots. The intra virtual physical connectivity among these neighbours 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. Also, we compared the aggregation quality of DW-KNN aggregation approach to that of the conventional KNN approach and found better performance.
Copyright © 2018 Elsevier B.V. All rights reserved.

Keywords:  Distance-Weighted KNN; Self-organized aggregation; Smoothed Particles Hydrodynamics (SPH); Swarm robotics; Virtual viscoelastic model

Mesh:

Year:  2018        PMID: 29409799     DOI: 10.1016/j.biosystems.2018.01.005

Source DB:  PubMed          Journal:  Biosystems        ISSN: 0303-2647            Impact factor:   1.973


  1 in total

1.  Self-Tuning Method for Increased Obstacle Detection Reliability Based on Internet of Things LiDAR Sensor Models.

Authors:  Fernando Castaño; Gerardo Beruvides; Alberto Villalonga; Rodolfo E Haber
Journal:  Sensors (Basel)       Date:  2018-05-10       Impact factor: 3.576

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.