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

Gareau, J. C., Beaudry, É., Makarenkov, V.

Publié dans
Frontiers in Robotics and AI
Éditeur
Frontiers Media
Pages
1076897-1076897
DOI
10.3389/frobt.2022.1076897