Coordinated Multi-Robot Exploration and Slime Mould Algorithm for Multi-Robot Space Exploration

In multi-robot space, conducting research is the critical task to perform flexible without presence of humans the multi-robots are used like landers and rovers for exploring the area which is unknown environment. The multi-robots face problems in exploring the area due improper planning and communication between the robots in specified paths. To solve the problem, Coordinated Multi-robot space Exploration Slime Mould Algorithm (CME-SMA) is proposed here. This integration includes a parallel communication protocol to enhance exploration efficiency and reduce computational complexity. The algorithm focuses on generating optimal collision-free paths in barrier-filled environments by first evaluating neighboring cells using deterministic CME for cost and utility values. SMA is then applied to refine the solutions further. The CME-SMA algorithm is validated through numerous simulations under various environmental conditions, demonstrating consistency in achieving expected outcomes such as exploration rate and time efficiency. The CME-SMA method explored the area is 98.79% with 0 failed run and execution time is 37.15 sec in map 1when compared with existing methods.

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1109/iacis61494.2024.10721763
Citations
5
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coordinated Multi-Robot Exploration and Slime Mould Algorithm for Multi-Robot Space Exploration

Muntather Almusawi, Raj Kumar Gudivaka, Rajya Lakshmi Gudivaka, N. Naga Saranya et al.
5 citations
Robotic Path Planning Algorithms
1.25
article

Coordinated Multi-Robot Exploration and Slime Mould Algorithm for Multi-Robot Space Exploration

Muntather Almusawi, Raj Kumar Gudivaka, Rajya Lakshmi Gudivaka, N. Naga Saranya, V. Prashanth
article en
5 citations

Abstract

In multi-robot space, conducting research is the critical task to perform flexible without presence of humans the multi-robots are used like landers and rovers for exploring the area which is unknown environment. The multi-robots face problems in exploring the area due improper planning and communication between the robots in specified paths. To solve the problem, Coordinated Multi-robot space Exploration Slime Mould Algorithm (CME-SMA) is proposed here. This integration includes a parallel communication protocol to enhance exploration efficiency and reduce computational complexity. The algorithm focuses on generating optimal collision-free paths in barrier-filled environments by first evaluating neighboring cells using deterministic CME for cost and utility values. SMA is then applied to refine the solutions further. The CME-SMA algorithm is validated through numerous simulations under various environmental conditions, demonstrating consistency in achieving expected outcomes such as exploration rate and time efficiency. The CME-SMA method explored the area is 98.79% with 0 failed run and execution time is 37.15 sec in map 1when compared with existing methods.

Iraqi University (IQ), Wipro (India) (IN), Platinum Group Coatings (United States) (US), Saveetha University (IN)
Openalex Percentile: Top 19%
Robotic Path Planning Algorithms
1.25
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.

Coordinated Multi-Robot Exploration and Slime Mould Algorithm for Multi-Robot Space Exploration — Muntather Almusawi, Raj Kumar Gudivaka, et al. · (2024) | TGRS Research Map | TGRS