Cargando…
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 consists in finding a path that covers a given region completely. First, we propose a CPP-solving baseline algorithm based on the iterative deepening depth-first search (...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Frontiers Media S.A.
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9935081/ https://www.ncbi.nlm.nih.gov/pubmed/36817004 http://dx.doi.org/10.3389/frobt.2022.1076897 |