Abstract: System and methods are maintaining various versions of a graph (e.g., a geometric graph) by a graph management engine. A graph may be partitioned into a number of cells (e.g., utilizing a spatial projection formula). Each cell may be associated with graph data such as nodes and/or edges that are located within the area defined by the boundaries of a cell. The graph management engine may process modifications to the graph. Upon determining that a modification is to be made to a cell, the graph management engine may generate a new cell to contain the previous cell content as modified. The new cell may be assigned a new cell identifier, and a version map corresponding to current cell version identifiers may be maintained. Subsequent data requests for graph data may be processed utilizing the version map to ensure that current graph data is provided in response to the request.

Abstract: System and methods are provided for utilizing abstract navigation graphs for route planning purposes. An abstract navigation graph may be generated from a commercially provided navigation graph. One or more maneuver edges may be provided within the abstract navigation graph. Historical location data associated with one or more route traversals may be utilized to identify traversal times for each edge. The traversal times for each edge may be analyzed to identify traversal times for each maneuver edge of the abstract navigation graph. Accordingly, the abstract navigation graph may be utilized for route planning purposes where the traversal times for the maneuver edges impose a time penalty for performing a maneuver. In this manner, maneuver edges of the abstract navigation graph may provide improvements over conventional navigation planning techniques by more accurately representing traversal times than conventional navigation graphs.

Abstract: Aspects of the disclosure relate to generating a memory efficient, graph-based tree representation of an address database, where each vertex in the tree corresponds to an individual character in an address. Each address in the database is a string of hierarchical components, and the techniques create a separate tree for each component. Tree jumps connect the last vertex of the tree for one component to the root (first) vertex in the tree of the next component. Aspects of the disclosure relate to depth-first search techniques for determining alignment between a user-input address string and the sequences in such an address tree, for example, by searching first for sequences that exactly match the input and iteratively increasing the allowable edit penalty if not enough results are returned.

Abstract: Aspects of the disclosure relate to generating a memory efficient, graph-based tree representation of an address database, where each vertex in the tree corresponds to an individual character in an address. Each address in the database is a string of hierarchical components, and the techniques create a separate tree for each component. Tree jumps connect the last vertex of the tree for one component to the root (first) vertex in the tree of the next component. Aspects of the disclosure relate to depth-first search techniques for determining alignment between a user-input address string and the sequences in such an address tree, for example, by searching first for sequences that exactly match the input and iteratively increasing the allowable edit penalty if not enough results are returned.

Abstract: Disclosed are various embodiments for providing augmented reality assisted deliveries. Some embodiments include determining a current location of a client device and a next node in a delivery workflow based at least in part on the current location of the client device. Then, the client device renders the next node in the delivery workflow on an augmented reality display linked to the client device. Various embodiments can also include identifying a plurality of delivery workflows that include a destination node that corresponds to a delivery and selecting select a delivery workflow from the plurality of delivery workflows based at least in part on a delivery constraint. In these embodiments, a delivery route to a routing node is generated, wherein the routing node comprises an entry to the selected delivery workflow. The delivery route and the delivery workflow are then sent to an augmented reality client.