Fast optimal and bounded suboptimal Euclidean pathfinding (Q2060748)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7443181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast optimal and bounded suboptimal Euclidean pathfinding |
scientific article; zbMATH DE number 7443181 |
Statements
Fast optimal and bounded suboptimal Euclidean pathfinding (English)
0 references
13 December 2021
0 references
Euclidean shortest path planning
0 references
compressed path databases
0 references
heuristic search
0 references
0.7573830485343933
0 references
0.7494047284126282
0 references
0.7459825873374939
0 references
0.7427274584770203
0 references
