Routing with Data Version Stitching

摘要

Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.

主权项

1. A computer-implemented method of determining routes in geographic areas, comprising
obtaining, by one or more computing devices, data indicative of a request for a route from an origin to a destination, wherein the one or more computing devices comprise one or more processors; accessing, by the one or more computing devices, first graph data modeling a travel segment network for a first geographic region; accessing, by the one or more computing devices, second graph data modeling a travel segment network for a second geographic region; identifying, by the one or more computing devices, a shortest path from the first graph data and the second graph data by visiting one or more nodes associated with boundary segments in the first graph data and the second graph data, the nodes associated with boundary segments being preserved in the graph data based at least in part on a reach value associated with each boundary segment; determining, by the one or more computing devices, a route from the origin to the destination based at least in part on the shortest path.