Mazen Bahaidarah
Swarm flocking using optimisation for a self-organised collective motion
Bahaidarah, Mazen; Rekabi-Bana, Fatemeh; Marjanovic, Ognjen; Arvin, Farshad
Authors
Dr Fatemeh Rekabi Bana fatemeh.rekabi-bana@durham.ac.uk
Post Doctoral Research Associate
Ognjen Marjanovic
Professor Farshad Arvin farshad.arvin@durham.ac.uk
Professor
Abstract
Collective motion, often called flocking, is a prevalent behaviour observed in nature wherein large groups of organisms move cohesively, guided by simple local interactions, as exemplified by bird flocks and fish schools. Inspired by those intelligent species, many cyber–physical systems attempted to increase autonomy by resembling the models that describe those collective behaviours. The main motivation that persuades robotic research, particularly to move in that direction, is to benefit from the substantial robustness and reliability that social and collective systems can achieve relative to those systems that use a centralised solution to the problems. Collective motion behaviour can be achieved by applying virtual physical interaction inspired by elastic materials to determine the required attraction and repulsion forces between the agents in a swarm robotic system. However, it is necessary to apply virtual interaction efficiently to prevent undesirable swarm fluctuation, slow alignment, and excessive energy consumption. This paper presents a novel Optimised Collective Motion (OCM) algorithm that exerts viscoelastic interaction between robots. The main purpose of the developed algorithm is to increase robustness against different disturbing effects such as measurement noise, environmental disturbances, and modelling uncertainties, which implies the algorithm’s capability for real-world robotic applications. Moreover, the algorithm’s parameters are tuned automatically by employing Particle Swarm Optimisation to achieve: (i) minimum control effort, (ii) fast alignment, and (iii) robustness against noise. Simulation results established that the proposed algorithm outperforms the former algorithms, achieving 98% alignment in 50 s compared to the same alignment obtained in more than 300 s based on the previous method and being more robust in the presence of measurement noise. Furthermore, real-robot experiments performed on miniature mobile robots validate the OCM algorithm’s effectiveness and demonstrate the proposed algorithm’s practical capabilities.
Citation
Bahaidarah, M., Rekabi-Bana, F., Marjanovic, O., & Arvin, F. (2024). Swarm flocking using optimisation for a self-organised collective motion. Swarm and Evolutionary Computation, 86, Article 101491. https://doi.org/10.1016/j.swevo.2024.101491
Journal Article Type | Article |
---|---|
Acceptance Date | Jan 24, 2024 |
Online Publication Date | Feb 2, 2024 |
Publication Date | 2024-04 |
Deposit Date | Apr 4, 2024 |
Publicly Available Date | Apr 4, 2024 |
Journal | Swarm and Evolutionary Computation |
Print ISSN | 2210-6502 |
Electronic ISSN | 2210-6510 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 86 |
Article Number | 101491 |
DOI | https://doi.org/10.1016/j.swevo.2024.101491 |
Public URL | https://durham-repository.worktribe.com/output/2377722 |
Files
Accepted Journal Article
(12.4 Mb)
PDF
Licence
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
This accepted manuscript is licensed under the Creative Commons Attribution 4.0 licence. https://creativecommons.org/licenses/by/4.0/
You might also like
Decentralized Multi-Agent Coverage Path Planning with Greedy Entropy Maximization
(2024)
Presentation / Conference Contribution
Editorial: Swarm neuro-robots with the bio-inspired environmental perception.
(2024)
Journal Article
Organisms as sensors in biohybrid entities as a novel tool for in-field aquatic monitoring
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search