Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks (Q6127839)
From MaRDI portal
scientific article; zbMATH DE number 7832068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks |
scientific article; zbMATH DE number 7832068 |
Statements
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks (English)
0 references
14 April 2024
0 references
route planning
0 references
shortest paths
0 references
realistic road networks
0 references
