"Fast and optimal branch-and-bound planner for the grid-based coverage path ..."

Jaël Champagne Gareau, Éric Beaudry, Vladimir Makarenkov (2022)

> Home

Details and statistics

DOI: 10.3389/FROBT.2022.1076897

access: open

type: Journal Article

metadata version: 2023-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/firai/GareauBM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/firai/GareauBM22
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. Frontiers Robotics AI 9 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.