As I understand it, the A* algorithm uses a heuristic that estimates the cost of the as-yet unexplored route from a point to the goal. If this function never underestimates the cost, then the optimal route is guaranteed to be found.
If we only consider distance as the cost, then the bee-line distance never underestimates. But OsmAnd's cost functions take a lot more into account (speed restrictions, turns, road-type preferences, elevation data, etc, etc). Does OsmAnd just take the bee line distance and multiply it by hc to get the heuristic? In which case values of hc larger than 1.0 will still give optimal routes because of all the extra penalties that OsmAnd considers on it's actual routes. -- You received this message because you are subscribed to the Google Groups "OsmAnd" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/osmand/c7a21322-0ed5-4a65-8268-e350069dc70c%40googlegroups.com.
