Approaches to complete coverage path planning using neural network and grid division

Abstract

Since the goal of using complete coverage path planning is to generate a continuous and uninterrupted path that covers an area of interest while avoiding obstacles, its use could be extremely vital in today's field of robotics. Not only could it help our daily lives like lawnmowers, window cleaners, and painter robots, but it could also solve some dangerous or complex but vital problems for human beings; For example, mine detection, vacuum cleaning, and photogrammetry. This paper proposes two paths of successful approaches to Complete Coverage Path Planning: Neural Network and Grid division. After detailed data comparisons, both proved to have been efficient and successful, respectively. In addition, both plans' field applications would be placed at the end.