Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function
{{output}}
This paper introduces an optimal algorithm for solving the discrete grid-based coverage path planning (CPP) problem. This problem consists in finding a path that covers a given region completely. First, we propose a CPP-solving baseline algorithm based on the ... ...
