National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Heuristics for paths in maps
Kudláčková, Lada ; Mareš, Martin (advisor) ; Kratochvíl, Miroslav (referee)
The content of the thesis is a description of heuristic procedures, which are used to find the shortest paths in the graphs and verify their effec- tiveness on the actual data. It deals with heuristics for Dijkstra's algorithm, especially the A* algorithm, which uses a lower distance-to-target estimate. Heuristics are implemented and tested on the road network of the Czech Re- public. 1

See also: similar author names
3 Kudláčková, Lucie
Interested in being notified about new results for this query?
Subscribe to the RSS feed.