Efficient Coverage Path Planning via Gradient-Based Rectangular Segmentation

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 the... View More