ArticleFrontiers in robotics and AI2022

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 et al.PubMed ↗Full text ↗Publisher ↗

No numbers read from the abstract.