Anytime search in dynamic graphs (Q2389673)
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 5580295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Anytime search in dynamic graphs |
scientific article; zbMATH DE number 5580295 |
Statements
Anytime search in dynamic graphs (English)
0 references
17 July 2009
0 references
planning
0 references
replanning
0 references
anytime planning
0 references
\(A^{*}\)
0 references
search
0 references
anytime search
0 references
heuristic search
0 references
incremental search
0 references
0 references
0.8115726113319397
0 references
0.8011599779129028
0 references
0.7487753629684448
0 references
0.7443855404853821
0 references
0.727768063545227
0 references
