Principles of artificial intelligence
Principles of artificial intelligence
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
On map-matching vehicle tracking data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Dynamic Travel Time Maps - Enabling Efficient Navigation
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Dynamic travel time provision for road networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Efficient data management in support of shortest-path computation
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
| Hi-index | 0.00 |
The essential elements of any navigation system are a shortest-path algorithm and accurate map data. The contribution of this work is two-fold. First, the HBA* algorithm, an efficient shortest-path algorithm is presented that mimics human driving behavior by exploiting road network hierarchies. Second, in a thorough performance study dynamic travel times are introduced to replace the unreliable static speed types currently used in connection with road network datasets.