Improved GBNN Guided Multirobot Coverage Search Based on Neuronal Connectivity

The multirobot coverage search problem in unknown environments has attracted significant attention. However, the existing methods are inefficient in the search process. The aim of the present study is to improve the search efficiency through an enhanced bioinspired neural network method. In this work, a connected Glasius bioinspired neural network (CGBNN) model is introduced to address the lack of consideration for neuronal connectivity and transmission properties in existing studies. The dynamic search environment is represented by the changes in neurons' activity values, which guide the robots in performing the search task. Each robot automatically plans its search path according to the principle of the decreasing gradient of CGBNN activity values until the task is completed. Experimental results demonstrate that the robots can avoid different types of obstacles to complete the coverage search, confirming the effectiveness of the proposed method. Meanwhile, it indicates that the proposed method outperforms others, the coverage rate is improved by 6.90%, 6.22%, and 4.02% compared to the GBNN, A-RPSO, and DMPC algorithms, respectively. In adition, the decision time is less affected by the complexity of the environment, which fulfills the practical demands of real-time decision-making in a large-scale complex environment.

Authors

Institutions

Publication Details

Journal
IEEE Systems Journal
Published
2025-05-28
DOI
https://doi.org/10.1109/jsyst.2025.3567283
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Improved GBNN Guided Multirobot Coverage Search Based on Neuronal Connectivity

Yaonan Wang, Jianbin Xin, Jinzhu Peng, Fangfang Zhang et al.
IEEE Systems Journal
Robotic Path Planning Algorithms
article

Improved GBNN Guided Multirobot Coverage Search Based on Neuronal Connectivity

Yaonan Wang, Jianbin Xin, Jinzhu Peng, Fangfang Zhang, Haijing Wang, Yongqi Wang
article en

Abstract

The multirobot coverage search problem in unknown environments has attracted significant attention. However, the existing methods are inefficient in the search process. The aim of the present study is to improve the search efficiency through an enhanced bioinspired neural network method. In this work, a connected Glasius bioinspired neural network (CGBNN) model is introduced to address the lack of consideration for neuronal connectivity and transmission properties in existing studies. The dynamic search environment is represented by the changes in neurons' activity values, which guide the robots in performing the search task. Each robot automatically plans its search path according to the principle of the decreasing gradient of CGBNN activity values until the task is completed. Experimental results demonstrate that the robots can avoid different types of obstacles to complete the coverage search, confirming the effectiveness of the proposed method. Meanwhile, it indicates that the proposed method outperforms others, the coverage rate is improved by 6.90%, 6.22%, and 4.02% compared to the GBNN, A-RPSO, and DMPC algorithms, respectively. In adition, the decision time is less affected by the complexity of the environment, which fulfills the practical demands of real-time decision-making in a large-scale complex environment.

IEEE Systems JournalVol. 19(2)
Hunan University (CN), Zhengzhou University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Hainan Province
Affordable and clean energy
Openalex Percentile: Top 90%
Robotic Path Planning Algorithms
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.