INTRODUCTION: In integrating Spiral Coverage into Cellular Decomposition, which combines structured grid-based techniques with flexible, quick spiral traversal, time efficiency is increased.OBJECTIVES: In the field of robotics and computational geometry, the study proposes a comparative exploration of two prominent path planning methodologies—Boustrophedon Cellular Decomposition and the innovative Spiral Coverage. Boustrophedon coverage has limitations in time efficiency due to its back-and-forth motion pattern, which can lead to lengthier coverage periods, especially in congested areas. Nevertheless, it is useful in some situations. It is critical to address these time-related issues to make Boustrophedon algorithms more useful in practical settings. METHODS: The research centres on achieving comprehensive cell coverage, addressing the complexities arising from confined spaces and intricate geometries. While conventional methods emphasise route optimization between points, the coverage path planning approach seeks optimal paths that maximize coverage and minimize associated costs. This study delves into the theory, practical implementation, and application of Spiral Coverage integrated with established cellular decomposition techniques.RESULTS: Through comparative analysis, it illustrates the advantages of spiral coverage over boustrophedon coverage in diverse robotics and computational applications. The research highlights Spiral Coverage's superiority in terms of path optimization, computational efficiency, and adaptability, proposing a novel perspective into cell decomposition. The methodology integrates the Spiral Coverage concept, transcending traditional techniques reliant on grids or Voronoi diagrams. Rigorous evaluation validates its potential to enhance path planning, exemplifying a substantial advancement in robotics and computational geometry.CONCLUSION: Our findings show that spiral coverage is on an average 45% more efficient than conventional Boustrophedon coverage. This paper set the basis for the future work on how different algorithms can traverse different shapes more efficiently.
Read full abstract