| 摘要 |
The route from a prescribed starting node (28) to a prescribed destination node (30) is ascertained on the basis of digital map data stored in a memory unit such that, for possible expansion of a respective current node (22a), total costs (f) are ascertained for the current node (22a) on the basis of a sum of edge costs (g) for an optimum route from the starting node (28) to the current node (22a) and a destination-node-related heuristic value (h) for the current node (22a) and a prescribed destination-node-related correction value (k). The destination-node-related correction value (k) is in this case representative of a mean value for cost ratios (Cost) for respective nodes (22) in a prescribed set, wherein the respective cost ratios (Cost) are dependent on the edge costs (g) of the connections (24) that are situated between the current node (22a) and the respective node (22) in the set and that represent an optimum route between the current node (22a) and this node (22) in the set and on a heuristic value for the current node (22a) in relation to this node (22) in the set. |
