Home ›
Entities
› academia
› Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function
Research article (Frontiers in Robotics and AI, 2023) · cited 10× · AI/ML
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function
Summary
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function is a scholarly article[1].
Key Facts
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function. Retrieved May 24, 2026, from https://4ort.xyz/entity/fast-and-optimal-branch-and-bound-planner-for-the-grid-based-coverage-path-planning-problem-based-on-an-admissible-heuri
MLA“Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/fast-and-optimal-branch-and-bound-planner-for-the-grid-based-coverage-path-planning-problem-based-on-an-admissible-heuri.
BibTeX@misc{4ortxyz_fast-and-optimal-branch-and-bound-planner-for-the-grid-based-coverage-path-planning-problem-based-on-an-admissible-heuri_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function}}, year = {2026}, url = {https://4ort.xyz/entity/fast-and-optimal-branch-and-bound-planner-for-the-grid-based-coverage-path-planning-problem-based-on-an-admissible-heuri}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function — https://4ort.xyz/entity/fast-and-optimal-branch-and-bound-planner-for-the-grid-based-coverage-path-planning-problem-based-on-an-admissible-heuri (retrieved 2026-05-24)
