D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing (Q2011896)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing |
scientific article; zbMATH DE number 6754238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing |
scientific article; zbMATH DE number 6754238 |
Statements
D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing (English)
0 references
27 July 2017
0 references
shortest-path planning
0 references
incremental heuristic search
0 references
mobile robot navigation
0 references
video games
0 references
0.79303646
0 references
0.78076077
0 references
0.78071576
0 references
0.78021395
0 references
0.76919365
0 references
0.76523817
0 references
0.76407826
0 references
0.7619081
0 references
