Article-Journal

Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function

This paper introduces an optimal algorithm for solving the discrete grid-based coverage path planning (CPP) problem. This problem …

Jaël Champagne Gareau, Éric Beaudry, Vladimir Makarenkov