Improvement of \(A^*\) algorithm and its application in shortest path problem in dynamic networks (Q5453225)
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: Improvement of A^* algorithm and its application in shortest path problem in dynamic networks |
scientific article; zbMATH DE number 5260038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improvement of \(A^*\) algorithm and its application in shortest path problem in dynamic networks |
scientific article; zbMATH DE number 5260038 |
Statements
4 April 2008
0 references
intelligent transportation system
0 references
dynamic route guidance
0 references
shortest path
0 references
\(A^*\) algorithm
0 references
consistency assumption
0 references
0.7802139520645142
0 references
0.7794609069824219
0 references
0.7648838758468628
0 references
0.7634608745574951
0 references
