Colonial bacterial memetic algorithm and its application on a darts playing robot

In this paper, we present the Colonial Bacterial Memetic Algorithm (CBMA), an advanced evolutionary optimization approach for robotic applications. CBMA extends the Bacterial Memetic Algorithm by integrating Cultural Algorithms and co-evolutionary dynamics inspired by bacterial group behavior. This combination of natural and artificial evolutionary elements results in a robust algorithm capable of handling complex challenges in robotics, such as constraints, multiple objectives, large search spaces, and complex models, while delivering fast and accurate solutions. CBMA incorporates features like multi-level clustering, dynamic gene selection, hierarchical population clustering, and adaptive co-evolutionary mechanisms, enabling efficient management of task-specific parameters and optimizing solution quality while minimizing resource consumption. The algorithm's effectiveness is demonstrated through a real-world robotic application, achieving a 100% success rate in a robot arm's ball-throwing task usually with significantly fewer iterations and evaluations compared to other methods. CBMA was also evaluated using the CEC-2017 benchmark suite, where it consistently outperformed state-of-the-art optimization algorithms, achieving superior outcomes in 71% of high-dimensional cases and demonstrating up to an 80% reduction in required evaluations. These results highlight CBMA's efficiency, adaptability, and suitability for specialized tasks. Overall, CBMA exhibits exceptional performance in both real-world and benchmark evaluations, effectively balancing exploration and exploitation, and representing a significant advancement in adaptive evolutionary optimization for robotics.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-03-28
DOI
https://doi.org/10.1038/s41598-025-94245-1
Citations
2
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Colonial bacterial memetic algorithm and its application on a darts playing robot

Csaba Budai, Szilárd Kovács, János Botzheim
2 citations
Scientific Reports
Metaheuristic Optimization Algorithms Research
4.96
article

Colonial bacterial memetic algorithm and its application on a darts playing robot

Csaba Budai, Szilárd Kovács, János Botzheim
article en
2 citations

Abstract

In this paper, we present the Colonial Bacterial Memetic Algorithm (CBMA), an advanced evolutionary optimization approach for robotic applications. CBMA extends the Bacterial Memetic Algorithm by integrating Cultural Algorithms and co-evolutionary dynamics inspired by bacterial group behavior. This combination of natural and artificial evolutionary elements results in a robust algorithm capable of handling complex challenges in robotics, such as constraints, multiple objectives, large search spaces, and complex models, while delivering fast and accurate solutions. CBMA incorporates features like multi-level clustering, dynamic gene selection, hierarchical population clustering, and adaptive co-evolutionary mechanisms, enabling efficient management of task-specific parameters and optimizing solution quality while minimizing resource consumption. The algorithm's effectiveness is demonstrated through a real-world robotic application, achieving a 100% success rate in a robot arm's ball-throwing task usually with significantly fewer iterations and evaluations compared to other methods. CBMA was also evaluated using the CEC-2017 benchmark suite, where it consistently outperformed state-of-the-art optimization algorithms, achieving superior outcomes in 71% of high-dimensional cases and demonstrating up to an 80% reduction in required evaluations. These results highlight CBMA's efficiency, adaptability, and suitability for specialized tasks. Overall, CBMA exhibits exceptional performance in both real-world and benchmark evaluations, effectively balancing exploration and exploitation, and representing a significant advancement in adaptive evolutionary optimization for robotics.

Scientific ReportsVol. 15(1)
Eötvös Loránd University (HU), Budapest University of Technology and Economics (HU)
Eötvös Loránd Tudományegyetem
Openalex Percentile: Top 6%
Metaheuristic Optimization Algorithms Research
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.