Yes, it is right, and applies for BRouter routing as well.
The longer the route is, and the more complex the network is, the less is
probability of missing the optimal route with HR > 1.
1.2-1.3 is the typical geometry factor
route-distance / bee-line-distance
The critical HR factor is the above ratio, multiplied by the average
costfactor, based on the effective length(BRouter) or time/distance of the
roads along the route.
If HR crosses this critical HR, the routing has tendency to prefer the
partial route variant, that is already closer to destination.
Dne 13. března 2020 2:36:08 A Thompson <thompson...@gmail.com> napsal:
Apologies - it was stupid of me to question the setup of the mailing list
when we were discussing something else. I diluted my own question!
If
heuristic = bee-line_distance * hc
and the cost function is only distance, then hc can be larger than 1.0 to
the extent that it reflects the extra distance of an optimal route to the
goal compared to the bee-line, and the optimal route will be found.
But what makes OsmAnd's routing so good is that its cost function reflects
map features that slow you down, like traffic signals and turns. So hc can
be even higher before much risk of not finding the optimal route. On long
car journeys on the motorway/autobahn/whatever, this effect diminishes.
Is this right?
--
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 osmand+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/osmand/170d1a2b7f8.2799.a291d67f9894f806060d35c996ca15e9%40gmail.com.
