Skip to main content
Have a personal or library account? Click to login
Efficient Coverage Path Planning via Gradient-Based Rectangular Segmentation Cover

Efficient Coverage Path Planning via Gradient-Based Rectangular Segmentation

Open Access
|Sep 2026
Read online

Abstract

Coverage Path Planning (CPP) is the task of finding a route that covers every point in a region or volume (i.e., all reachable cells) while avoiding obstacles. A typical CPP solution proceeds in two main stages: partitioning the environment into subregions, and planning a path within and between these regions. Effective segmentation is critical for smooth and efficient operation. For example, dividing the area into rectangular cells allows a simple back-and-forth (boustrophedon) sweep in each cell, exhaustively covering it without overlap. In this paper, we propose an adaptive, gradient-based rectangular decomposition for CPP. The algorithm analyzes the occupancy map to split free space into oriented rectangles that conform to obstacle boundaries. Within each rectangle, a straight-line sweep path is generated. Compared to conventional methods, our approach produces coverage paths that are smoother and more concise. We demonstrate on real-world maps that the proposed method achieves good coverage with fewer turns, yielding improvements in overall CPP efficiency.

DOI: https://doi.org/10.14313/jamris-2026-041 | Journal eISSN: 2080-2145 | Journal ISSN: 1897-8649
Language: English
Page range: 94 - 104
Submitted on: Aug 5, 2025
Accepted on: Mar 2, 2026
Published on: Sep 30, 2026
Published by: Łukasiewicz Research Network – Industrial Research Institute for Automation and Measurements PIAP
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2026 Hubert Baraniak, Konrad Cop, Morteza Haghbeigi, published by Łukasiewicz Research Network – Industrial Research Institute for Automation and Measurements PIAP
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.