Metraipolis › archive › dc_d6690d9178cc
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function — Europe PMC PMID:36817004
- Source
- Europe PMC (en)
- Original
- https://europepmc.org/article/MED/36817004
- DOI
- 10.3389/frobt.2022.1076897
- License (as archived)
- solo-consultazione
- Archived
- 2026-10-07T23:08:07.011Z
- SHA-256 of the archived text
4cf94ab938aee04e2b0a90071c3eb74d886f7f4bcafcff7e0c8be3e86d435926- Stable URL of this page
https://metraipolis.com/documento/dc_d6690d9178cc
How to cite
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function — Europe PMC PMID:36817004 — Europe PMC (en), https://europepmc.org/article/MED/36817004 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_d6690d9178cc (Metraipolis archive dc_d6690d9178cc, sha256 4cf94ab938aee04e2b0a90071c3eb74d886f7f4bcafcff7e0c8be3e86d435926)
BibTeX
@misc{dcd6690d9178cc,
title = {Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function — Europe PMC PMID:36817004},
howpublished = {Europe PMC (en)},
url = {https://europepmc.org/article/MED/36817004},
note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_d6690d9178cc; sha256 4cf94ab938aee04e2b0a90071c3eb74d886f7f4bcafcff7e0c8be3e86d435926},
year = {2026}
}Archived text
The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/36817004. Agents can read the archived copy with the MCP tool read_document.