Optimizing and predicting swarming collective motion performance for coverage problems solving: A simulation-optimization approach

Algorithms using swarming collective motion can solve coverage problems in unknown environments by reacting to unknown obstacles in real-time when they are encountered. However, these algorithms face two key challenges when deployed on real robots. First, hand-tuning efficient collective motion parameters is both time-consuming and difficult. Second, predicting the time required for a swarm to solve a particular problem is not straightforward. This paper introduces a novel evolutionary framework to address both problems by proposing a methodology that autonomously tunes collective motion parameters for coverage problems while predicting the time required for real robots to complete the task. Our approach utilizes a simulation–optimization framework that employs a genetic algorithm to optimize the parameters of a frontier-led swarming algorithm. Results indicate that the optimized parameters are transferable to real robots, achieving 100% coverage while maintaining 84% connectivity between them. Compared to state-of-the-art swarm methods, our system reduced turnaround time by 50% and 57% in different environments while maintaining collective motion. It also achieved a 55% reduction in turnaround time on average across five scenarios compared to budget-constrained path planning, with a 10% increase in coverage. Furthermore, our framework outperformed both hand-tuned and learned collective motion approaches, reducing turnaround time by 73% in non-collective motion scenarios and by 63% while maintaining 85% connectivity in collective motion scenarios. This approach effectively combines the adaptability of swarm behavior with the predictive reliability of planning methods. • Proposed a framework for optimizing frontier-led swarming parameters. • Utilized a genetic algorithm to enhance swarm robot performance in coverage tasks. • Developed a dynamic swarm simulator for a seamless transition to physical robots. • Evaluated swarm performance metrics balancing connectivity and coverage time. • Results highlight the effectiveness of optimized parameters in real-world scenarios.

Authors

Institutions

Publication Details

Journal
Engineering Applications of Artificial Intelligence
Published
2024-11-04
DOI
https://doi.org/10.1016/j.engappai.2024.109522
Citations
6
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing and predicting swarming collective motion performance for coverage problems solving: A simulation-optimization approach

Shadi Abpeikar, Reda Ghanem, Kathryn Kasmarik, Matthew Garratt et al.
6 citations
Engineering Applications of Artificial Intelligence
Robotic Path Planning Algorithms
1.50
article

Optimizing and predicting swarming collective motion performance for coverage problems solving: A simulation-optimization approach

Shadi Abpeikar, Reda Ghanem, Kathryn Kasmarik, Matthew Garratt, Ismail Ali
article en
6 citations

Abstract

Algorithms using swarming collective motion can solve coverage problems in unknown environments by reacting to unknown obstacles in real-time when they are encountered. However, these algorithms face two key challenges when deployed on real robots. First, hand-tuning efficient collective motion parameters is both time-consuming and difficult. Second, predicting the time required for a swarm to solve a particular problem is not straightforward. This paper introduces a novel evolutionary framework to address both problems by proposing a methodology that autonomously tunes collective motion parameters for coverage problems while predicting the time required for real robots to complete the task. Our approach utilizes a simulation–optimization framework that employs a genetic algorithm to optimize the parameters of a frontier-led swarming algorithm. Results indicate that the optimized parameters are transferable to real robots, achieving 100% coverage while maintaining 84% connectivity between them. Compared to state-of-the-art swarm methods, our system reduced turnaround time by 50% and 57% in different environments while maintaining collective motion. It also achieved a 55% reduction in turnaround time on average across five scenarios compared to budget-constrained path planning, with a 10% increase in coverage. Furthermore, our framework outperformed both hand-tuned and learned collective motion approaches, reducing turnaround time by 73% in non-collective motion scenarios and by 63% while maintaining 85% connectivity in collective motion scenarios. This approach effectively combines the adaptability of swarm behavior with the predictive reliability of planning methods. • Proposed a framework for optimizing frontier-led swarming parameters. • Utilized a genetic algorithm to enhance swarm robot performance in coverage tasks. • Developed a dynamic swarm simulator for a seamless transition to physical robots. • Evaluated swarm performance metrics balancing connectivity and coverage time. • Results highlight the effectiveness of optimized parameters in real-world scenarios.

Engineering Applications of Artificial IntelligenceVol. 139
University of Canberra (AU), Benha University (EG), UNSW Sydney (AU)
Openalex Percentile: Top 16%
Robotic Path Planning Algorithms
1.50
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.