NobleBlocks

Research indexJournal article

Path Planning Algorithm for a Robot

You

Applied and Computational Engineering22 Oct 2025Open access

NobleIDark:/48914/w1/20260525/1D81D015DOI10.54254/2755-2721/2025.ld28098

Free to read at the publisher

You can read the abstract here, or the full text at the publisher.

Read at the publisher

Abstract

This paper provides a comprehensive paper of the Complete Coverage Path Planning (CCPP) algorithm for autonomous mobile robots, with a particular focus on applications in robotic vacuum cleaners, also known as robovacs. The CCPP aims to create a path for a robot to fully cover an objective region while minimising overlap and neglect, thereby ensuring efficient use of time and energy. As the use of autonomous robots in household and industrial environments grows, the demand for practical coverage algorithms becomes increasingly critical. The paper research existing CCPP methods, including the 'Combined algorithm, the Boustrophedon Cellular Decomposition algorithm, and the genetic algorithm. The advantages, limitations, and applicability of each method are analysed, and the challenges, including real-time adaptability, computational efficiency, and robustness in unknown environments, are highlighted. Finally, the paper discusses the future directions of CCPP research, including multi-robot coordination, adaptive coverage strategies, and the integration of machine learning techniques to enhance performance. This paper aims to provide insights for both researchers and practitioners looking to develop more efficient and adaptive CCPP solutions for real-world applications.

Discussion

Topics

More

Suggest a correction or report