TY - JOUR
T1 - Complete coverage path planning for omnidirectional self-reconfigurable cleaning robot using aGBNN
AU - Yi, Lim
AU - Hayat, A. A.
AU - Wan, Ash Yaw Sang
AU - Le, Anh Vu
AU - Tang, Q. R.
AU - Elara, Mohan Rajesh
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - Complete coverage path planning (CCPP) is essential for autonomous cleaning robots, particularly in complex and variable environments where traditional, fixed-footprint designs may fall short. This paper presents adaptive Glasius bio-inspired neural network (aGBNN) approach to CCPP, specifically tailored for an omnidirectional self-reconfigurable cleaning robot (OSCR). The aGBNN method dynamically generates a complete coverage path by leveraging the ability to change sweeping footprint of the robot (SFR) assisted by reconfiguring brushes design. The sweeping is carried out both longitudinally and laterally, thereby complementing the omnidirectional locomotion with cleaning. Unlike conventional CCPP algorithms that assume a fixed robot footprint, the proposed aGBNN adapts in real-time to spatial and moving obstacles, significantly enhancing coverage efficiency. Experimental and simulation results demonstrate the advantage of the aGBNN approach, in terms of path length, and total time to complete area coverage compared to state-of-the-art methods.
AB - Complete coverage path planning (CCPP) is essential for autonomous cleaning robots, particularly in complex and variable environments where traditional, fixed-footprint designs may fall short. This paper presents adaptive Glasius bio-inspired neural network (aGBNN) approach to CCPP, specifically tailored for an omnidirectional self-reconfigurable cleaning robot (OSCR). The aGBNN method dynamically generates a complete coverage path by leveraging the ability to change sweeping footprint of the robot (SFR) assisted by reconfiguring brushes design. The sweeping is carried out both longitudinally and laterally, thereby complementing the omnidirectional locomotion with cleaning. Unlike conventional CCPP algorithms that assume a fixed robot footprint, the proposed aGBNN adapts in real-time to spatial and moving obstacles, significantly enhancing coverage efficiency. Experimental and simulation results demonstrate the advantage of the aGBNN approach, in terms of path length, and total time to complete area coverage compared to state-of-the-art methods.
KW - Complete Coverage Path Planning
KW - Glasius bio-inspired neural network
KW - Mobile robot
KW - Neural Network
KW - Self-reconfigurable robot
UR - http://www.scopus.com/inward/record.url?scp=105001532492&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=105001532492&partnerID=8YFLogxK
U2 - 10.1109/TASE.2025.3555042
DO - 10.1109/TASE.2025.3555042
M3 - Article
AN - SCOPUS:105001532492
SN - 1545-5955
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
ER -