C*: A Coverage Path Planning Algorithm for Unknown Environments using Rapidly Covering Graphs

TL;DR

The paper introduces C*, a real-time coverage path planning algorithm for unknown environments that constructs a minimal-sufficient graph during navigation, enabling efficient, complete coverage with improved performance over existing methods.

Contribution

C* is a novel sample-based algorithm utilizing Rapidly Covering Graphs for real-time, complete coverage of unknown environments, with proven optimality and low computational complexity.

Findings

C* achieves near-optimal coverage trajectories in simulations and experiments.

Compared to seven existing methods, C* reduces coverage time and trajectory length.

C* effectively prevents coverage holes and adapts to different robot constraints.

Abstract

The paper presents a novel sample-based algorithm, called C*, for real-time coverage path planning (CPP) of unknown environments. C* is built upon the concept of a Rapidly Covering Graph (RCG), which is incrementally constructed during robot navigation via progressive sampling of the search space. By using efficient sampling and pruning techniques, the RCG is constructed to be a minimum-sufficient graph, where its nodes and edges form the potential waypoints and segments of the coverage trajectory, respectively. The RCG tracks the coverage progress, generates the coverage trajectory and helps the robot to escape from the dead-end situations. To minimize coverage time, C* produces the desired back-and-forth coverage pattern, while adapting to the TSP-based optimal coverage of local isolated regions, called coverage holes, which are surrounded by obstacles and covered regions. It is analytically proven that C* provides complete coverage of unknown environments. The algorithmic simplicity and low computational complexity of C* make it easy to implement and suitable for real-time on-board applications. The performance of C* is validated by 1) extensive high-fidelity simulations and 2) laboratory experiments using an autonomous robot. C* yields near optimal trajectories, and a comparative evaluation with seven existing CPP methods demonstrates significant improvements in performance in terms of coverage time, number of turns, trajectory length, and overlap ratio, while preventing the formation of coverage holes. Finally, C* is comparatively evaluated on two different CPP applications using 1) energy-constrained robots and 2) multi-robot teams.