Apparatus, method, and computer program product for updating link information on a client device

Patent metadata

Field	Value
Publication number	US-11796322-B2
Application number	US-201916664358-A
Country	US
Kind code	B2
Filing date	Oct 25, 2019
Priority date	Oct 25, 2019
Publication date	Oct 24, 2023
Grant date	Oct 24, 2023

Abstract

An apparatus, a method and a computer program product are provided for updating link information on a client device. The method may include determining at least one map area comprising one or more links, the map area having at least one map area identifier, Sending to a data service, a request for at least one categorized link. Receiving, from the data service, at least one bloom filter, the at least one bloom filter encoding the at least one categorized link, determining one or more link identifiers for the one or more links in the map area and associating candidate link of the one or more links to the at least one categorized link, based on the link identifier of the at least one candidate link satisfying the at least one received bloom filter, to update the link information on the client device.

First claim

We claim:

1. A method for updating link information on a client device, comprising:
determining, by at least one processor of the client device, at least one map area comprising one or more links, said map area having at least one map area identifier, and the client device being carried by a vehicle;
sending, from the client device to a data service, a request for at least one link category defined by one or more traversal restrictions, said request identifying the at least one map area, the request being associated with one or more restrictions related to the client device, the one or more links of the map area, or a combination thereof;
receiving, by the client device from the data service, at least one bloom filter, said at least one bloom filter encoding a link identifier set corresponding to each link of the at least one link category into a bit array using a coding function;
determining, by the at least one processor, one or more candidate link identifiers for the one or more links in the at least one map area; and
associating, by at least one processor, at least one candidate link of the one or more candidate link identifiers to the at least one link category, based on a link identifier of the at least one candidate link satisfying the at least one bloom filter based on the coding function, to update the link information on the client device.

2. The method of claim 1 , further comprising providing the at least one candidate link to a navigation application, wherein the coding function is a hash function.

3. The method of claim 1 , further comprising:
determining a geographical region encompassing at least a portion of a route;
determining for the geographical region, the at least one map area covering the at least one portion of the route; and
including the at least one map area identifier of the at least one map area in the request for at least one link category.

4. The method of claim 3 , further comprising recalculating the route, based on the route encompassing the at least one candidate link.

5. The method of claim 1 , wherein at least one of the one or more traversal restrictions is vehicle-feature-based including at least one of dimensions of a vehicle, emissions rating of the vehicle, cargo type of the vehicle, cargo capacity of the vehicle, speed of the vehicle, time of travel, engine type of the vehicle, year of manufacture of the vehicle, or a combination thereof.

6. The method of claim 1 , further comprising:
determining expected validity timeframe for the at least one link category; and
including the expected validity timeframe in the request.

7. The method of claim 1 , wherein the determining of one or more candidate link identifiers further comprises:
accessing map version agnostic information regarding each of the one or more links;
generating a map version agnostic identifier for each of the one or more links;
coding the map version agnostic identifier for each of the one or more links using at least one coding function; and
providing, the coded map version agnostic identifier for each link of the one or more links, as the one or more candidate link identifiers.

8. The method of claim 1 , wherein the at least one of the one or more traversal restrictions is time-based.

9. The method of claim 1 , wherein the link identifier set encoded in one of the at least one bloom filter are separate from one another without a connecting node.

10. An apparatus for updating link information on a client device, comprising:
at least one non-transitory memory configured to store computer program code instructions; and
at least one processor configured to execute the computer program code instructions to:
determine at least one map area comprising one or more links, said map area having at least one map area identifier, and the client device being carried by a vehicle;
send, to a data service, a request for at least one link category defined by one or more traversal restrictions, said request identifying the at least one map area, the request being associated with one or more restrictions related to the client device, the one or more links of the map area, or a combination thereof;
receive, from the data service, at least one bloom filter, said at least one bloom filter encoding a link identifier set corresponding to each link of the at least one link category into a bit array using a coding function;
determine one or more candidate link identifiers for the one or more links in the at least one map area; and
associate, at least one candidate link of the one or more candidate link identifiers to the at least one link category, based on a link identifier of the at least one candidate link satisfying the at least one bloom filter based on the coding function, to update the link information on the client device.

11. The apparatus of claim 10 , wherein the at least one processor is further configured to provide the at least one candidate link to a navigation application.

12. The apparatus of claim 10 , wherein the at least one map area encompasses at least one portion of a route, and the at least one processor is further configured to:
determine a geographical region encompassing the at least one portion of the route;
determine for the geographical region, the at least one map area covering the at least one portion of the route; and
include the at least one map area identifier of the at least one map area in the request for at least one link category.

13. The apparatus of claim 12 , wherein the at least one processor is further configured to recalculate the route, based on the route encompassing the at least one candidate link.

14. The apparatus of claim 10 , wherein at least one of the one or more traversal restrictions is vehicle-feature-based including at least one of dimensions of a vehicle, emissions rating of the vehicle, cargo type of the vehicle, cargo capacity of the vehicle, speed of the vehicle, time of travel, engine type of the vehicle, year of manufacture of the vehicle, or a combination thereof.

15. The apparatus of claim 10 , wherein the at least one processor is further configured to:
determine expected validity timeframe for the at least one link category; and
include the expected validity timeframe in the request.

16. The apparatus of claim 10 , wherein to determine the one or more candidate link identifiers, the at least one processor is further configured to:
access map version agnostic information regarding each of the one or more links;
generate a map version agnostic identifier for each of the one or more links;
code the map version agnostic identifier for each of the one or more links using at least one coding function; and
provide, the coded map version agnostic identifier for each link of the one or more links, as the one or more candidate link identifiers.

17. The apparatus of claim 10 , wherein the at least one of the one or more traversal restrictions is time-based.

18. The apparatus of claim 10 , wherein the link identifier set encoded in one of the at least one bloom filter are separate from one another without a connecting node.

19. A computer program product comprising a non-transitory computer readable medium having stored thereon computer executable instructions, which when executed by one or more processors, cause the one or more processors to carry out operations for updating link information on a client device, the operations comprising:
determining at least one map area comprising one or more links, said map area having at least one map area identifier, and

Assignees

• Here Global Bv

Inventors

• Rolf Daniel
• Cajias Raul

Classifications

• G01C21/30 Primary

  Map- or contour-matching · CPC title

• G01C21/34

  Route searching; Route guidance · CPC title

• G01C21/3446

  Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags or using precalculated routes · CPC title

• G01C21/3453

  Special cost functions, i.e. other than distance or default speed limit of road segments · CPC title

• G01C21/38

  Electronic maps specially adapted for navigation; Updating thereof · CPC title