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

Jaël Champagne Gareau, Éric Beaudry, Vladimir Makarenkov. Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function. Front. Robotics and AI, 9, 2022. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.