EUVIMEDOpdag EUVIMED
Open access · CC BY 4.0

Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem

Ash Wan Yaw Sang, Zhenyuan Yang, Lim Yi, Chee Gen Moo, Rajesh Elara Mohan, Anh Vu Le

Mathematics · 2024-03-19 · 12 (6) · 902

DOI: 10.3390/math12060902 ↗

At a glance

Journal article in Mathematics, published online on 2024-03-19. Written by Ash Wan Yaw Sang and 5 co-authors. Cited 3 times so far (Crossref); 33 references. The full text is freely available (open access, CC BY 4.0). Funded by: National Robotics Programme, A*STAR.

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

Recent advancements in autonomous mobile robots have led to significant progress in area coverage tasks. However, challenges persist in optimizing the efficiency and computational complexity of complete coverage path planner (CCPP) algorithms for multi-robot systems, particularly in scenarios requiring revisiting or a double pass in specific locations, such as cleaning robots addressing spilled consumables. This paper presents an innovative approach to tackling the double-pass complete coverage problem using an autonomous inter-reconfigurable robot path planner. Our solution leverages a modified Glasius bio-inspired neural network (GBNN) to facilitate double-pass coverage through inter-reconfiguration between two robots. We compare our proposed algorithm with traditional multi-robot path planning in a centralized system, demonstrating a reduction in algorithm iterations and computation time. Our experimental results underscore the efficacy of the proposed solution in enhancing the efficiency of area coverage tasks. Furthermore, we discuss the implementation details and limitations of our study, providing insights for future research directions in autonomous robotics.

Funding

  • National Robotics Programme
  • A*STAR

Cite

APA

Sang, A. W. Y., Yang, Z., Yi, L., Moo, C. G., Mohan, R. E., & Le, A. V. (2024). Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem. Mathematics, 12(6), 902. https://doi.org/10.3390/math12060902

Vancouver

Sang AWY, Yang Z, Yi L, Moo CG, Mohan RE, Le AV. Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem. Mathematics. 2024;12(6):902. doi:10.3390/math12060902

BibTeX
@article{Sang2024,
  author = {Sang, Ash Wan Yaw and Yang, Zhenyuan and Yi, Lim and Moo, Chee Gen and Mohan, Rajesh Elara and Le, Anh Vu},
  title = {Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem},
  journal = {Mathematics},
  year = {2024},
  volume = {12},
  number = {6},
  pages = {902},
  doi = {10.3390/math12060902}
}
Start for free →