Navigation software needs to move on. Instead of mapping a destination
POI to a single point in every case, it needs to handle a list of
points. Each point may have filters or qualifiers, such as opening hours
or mode of transport; this can lead to some of the points being
disqualified. The routing needs to calculate a route to each remaining
point and choose the best one using the routing criteria (shortest,
fastest etc). The multiple route calculations don't always need to
restart from the departure point - I'm sure a heuristic to limit the
recalculation to the last X km would be fine in most cases.
Then in the OSM data we need a way of indicating that multiple points
are initially equivalent, serving the same POI. For example, multiple
car parks serving the same public park. This can be purely geometric, by
virtue of the car parks being enclosed by the parks outer perimeter, or
by some kind of association relation. Reducing a car park polygon to a
candidate point for the above multiple-routing case can be based on a
node with entrance=* or the intersection with an accessible highway.
Where a car park has multiple entrances, add them all into the candidate
point list as above.
Regarding the use of footways for vehicle navigation, there are plenty
of multimodal public transport planners out there, which know about
trains, buses, walking etc. They work much more from point to point, not
limited to just the vehicle segment of the journey. A car
router/navigator can do the same, can't it? It will of course rely on
the data it is given....
C.
_______________________________________________
Tagging mailing list
Tagging@openstreetmap.org
https://lists.openstreetmap.org/listinfo/tagging
