Flexible and Efficient Topological Approaches for a Reliable Robots Swarm Aggregation
Aggregation is a vital behavior when performing complex tasks in most of the swarm systems, such as swarm robotics systems. In this paper, three new aggregation methods, namely the distance-angular, the distance-cosine, and the distance-Minkowski <inline-formula> <tex-math notation="La...
Saved in:
Published in | IEEE access Vol. 7; pp. 96372 - 96383 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Piscataway
IEEE
2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Aggregation is a vital behavior when performing complex tasks in most of the swarm systems, such as swarm robotics systems. In this paper, three new aggregation methods, namely the distance-angular, the distance-cosine, and the distance-Minkowski <inline-formula> <tex-math notation="LaTeX">\mathit {k} </tex-math></inline-formula>-nearest neighbor (<inline-formula> <tex-math notation="LaTeX">\mathit {k} </tex-math></inline-formula>-NN) have been introduced. These aggregation methods are mainly built on well-known metrics: the cosine, angular, and Minkowski distance functions, which are used here to compute distances among robots' neighbors. Relying on these methods, each robot identifies its <inline-formula> <tex-math notation="LaTeX">\mathit {k} </tex-math></inline-formula>-nearest neighborhood set that will interact with. Then, in order to achieve the aggregation, the interactions sensing capabilities among the set members are modeled using a virtual viscoelastic mesh. Analysis of the results obtained from the ARGoS simulator shows a significant improvement in the swarm aggregation performance compared to the conventional distance-weighted <inline-formula> <tex-math notation="LaTeX">\mathit {k} </tex-math></inline-formula>-NN aggregation method. Also, the aggregation performance of the methods is reported to be robust to partially faulty robots and accurate under noisy sensors. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2019.2930677 |