Method, apparatus, and computer program product for generating correspondence between map versions

Patent metadata

Field	Value
Publication number	US-11536573-B2
Application number	US-201916558624-A
Country	US
Kind code	B2
Filing date	Sep 3, 2019
Priority date	Sep 3, 2019
Publication date	Dec 27, 2022
Grant date	Dec 27, 2022

Abstract

Provided herein is a method of generating and communicating map version agnostic road link identifiers. Methods may include: receiving an indication of a new road link being joined to an existing road link along a length of the existing road link, where the existing road link extends between a first node and a second node, where the existing road link has a first road link identifier, and where a new node is formed where the new road link joins the existing road link; generating a first new identifier for a segment of the existing road link between the first node and the new node; generating a second new identifier for a segment of the existing road link between the new node and the second node, where the second new identifier is set equal to an XOR function of the first road link identifier and the first new identifier.

First claim

That which is claimed:

1. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and computer program code configured to, with the processor, cause the apparatus to at least:
receive an indication of a change to a map of a map database, wherein the change comprises joining of a new road link to an existing road link along a length of the existing road link, wherein the existing road link extends between a first node and a second node, wherein the existing road link has a first road link identifier, and wherein a new node is formed where the new road link joins the existing road link;
generate a first new identifier for a segment of the existing road link between the first node and the new node;
generate a second new identifier for a segment of the existing road link between the new node and the second node, the second new identifier set equal to an XOR function of the first road link identifier and the first new identifier;
assign the first new identifier to the segment of the existing road link between the first node and the new node;
assign the second new identifier to the segment of the existing road link between the new node and the second node;
update the map database with the new node, the segment of the existing road link between the first node and the new node identified by the first new identifier, and the segment of the existing road link between the new node and the second node identified by the second new identifier; and
generate a route between an origin and a destination, wherein the route comprises the road link between the first node and the new node identified by the first new identifier and the road link between the new node and the second node identified by the second new identifier, wherein the first road link identifier is identifiable through application of the XOR function to the first new identifier and the second new identifier, wherein the XOR function is applied to correlate link identifiers between different map versions enabling the translation of a map identifier of one version of a map to a different identifier or plurality of identifiers in another version of the map.

2. The apparatus of claim 1 , wherein the first new identifier is a randomly generated number.

3. The apparatus of claim 1 , wherein the first new identifier is generated to be a new identifier not found in a lookup table of existing road link identifiers.

4. The apparatus of claim 1 , wherein the apparatus is further caused to:
receive an indication of a second change to the map, wherein the second change comprises removal of a node between a second road link and a third road link, wherein the second road link has a second road link identifier, and wherein the third road link has a third road link identifier;
generate a third new identifier for a road segment including both the second road link and the third road link, wherein the third new identifier is set equal to an XOR function of the second road link identifier and the third road link identifier; and
assign the third new identifier to the road segment including both the second road link and the third road link.

5. The apparatus of claim 1 , wherein the apparatus is further caused to:
provide the generated route to a client including a listing of road link identifiers including the first new identifier and the second new identifier.

6. The apparatus of claim 5 , wherein the second new identifier is established by a client in response to applying the XOR function to the first road link identifier and the first new identifier.

7. The apparatus of claim 1 , wherein the apparatus is further caused to provide for delivery of the first new identifier of the segment of the existing road link between the first node and the new node and the second new identifier of the segment of the existing road link between the new node and the second node for storage as identifiers of respective segments of the existing road link.

8. A computer program product comprising at least one non-transitory computer-readable storage medium having computer-executable program code portions stored therein, the computer-executable program code portions comprising program code instructions configured to:
receive an indication of a change to a map of a map database, wherein the change comprises joining of a new road link to an existing road link along a length of the existing road link, wherein the existing road link extends between a first node and a second node, wherein the existing road link has a first road link identifier, and wherein a new node is formed where the new road link joins the existing road link;
generate a first new identifier for a segment of the existing road link between the first node and the new node;
generate a second new identifier for a segment of the existing road link between the new node and the second node, the second new identifier set equal to an XOR function of the first road link identifier and the first new identifier;
assign the first new identifier to the segment of the existing road link between the first node and the new node;
assign the second new identifier to the segment of the existing road link between the new node and the second node;
update the map database with the new node, the segment of the existing road link between the first node and the new node identified by the first new identifier, and the segment of the existing road link between the new node and the second node identified by the second new identifier; and
generate a route between an origin and a destination, wherein the route comprises the road link between the first node and the new node identified by the first new identifier and the road link between the new node and the second node identified by the second new identifier, wherein the first road link identifier is identifiable through application of the XOR function to the first new identifier and the second new identifier, wherein the XOR function is applied to correlate link identifiers between different map versions enabling the translation of a map identifier of one version of a map to a different identifier or plurality of identifiers in another version of the map.

9. The computer program product of claim 8 , wherein the first new identifier is a randomly generated number.

10. The computer program product of claim 8 , further comprising program code instructions to:
receive an indication of a second change to the map, wherein the second change comprises removal of a node between a second road link and a third road link, wherein the second road link has a second road link identifier, and wherein the third road link has a third road link identifier;
generate a third new identifier for a road segment including both the second road link and the third road link, wherein the third new identifier is set equal to an XOR function of the second road link identifier and the third road link identifier; and
assign the third new identifier to the road segment including both the second road link and the third road link.

11. The computer program product of claim 8 , further comprising program code instructions to:
provide the generated route to a client including a listing of road link identifiers including the first new identifier and the second new identifier.

12. The computer program product of claim 8 , wherein the second new identifier is established by a client in response to applying the XOR function to the first road link identifier and the first new identifier.

13. The computer program product of claim 8 , further comprising program code instructions to provide for delivery of the first new ident

Assignees

• Here Global Bv

Inventors

• Rolf Daniel
• Cajias Raul

Classifications

• G01C21/3644

  Landmark guidance, e.g. using POIs or conspicuous other objects · CPC title

• G01C21/3815

  Road data · CPC title

• G08G1/096844

  where the complete route is dynamically recomputed based on new data · CPC title

• G01C21/32 Primary

  Structuring or formatting of map data · CPC title

• G01C21/34

  Route searching; Route guidance · CPC title