US 11,853,280 B2
Encoding a route using a probabilistic encoding data structure
Daniel Rolf, Berlin (DE); and Raul Cajias, Berlin (DE)
Assigned to HERE GLOBAL B.V., Eindhoven (NL)
Filed by HERE Global B.V., Eindhoven (NL)
Filed on Dec. 2, 2020, as Appl. No. 17/109,466.
Claims priority of provisional application 63/027,549, filed on May 20, 2020.
Prior Publication US 2021/0364303 A1, Nov. 25, 2021
Int. Cl. G06F 15/16 (2006.01); G06F 16/22 (2019.01); G01C 21/36 (2006.01); G01C 21/34 (2006.01); G01C 21/00 (2006.01); G06F 16/29 (2019.01); G06F 16/31 (2019.01); H04L 45/7459 (2022.01); G06F 16/2457 (2019.01); G06F 16/2453 (2019.01)
CPC G06F 16/2246 (2019.01) [G01C 21/3415 (2013.01); G01C 21/3446 (2013.01); G01C 21/3453 (2013.01); G01C 21/3667 (2013.01); G01C 21/3685 (2013.01); G01C 21/387 (2020.08); G01C 21/3815 (2020.08); G01C 21/3885 (2020.08); G01C 21/3896 (2020.08); G06F 16/2291 (2019.01); G06F 16/24575 (2019.01); G06F 16/29 (2019.01); G06F 16/316 (2019.01); H04L 45/7459 (2022.05); G06F 16/2453 (2019.01)] 16 Claims
OG exemplary drawing
 
1. A method comprising:
determining, by a network apparatus, a route from a network version origin traversable map element (TME) to a network version target TME based on map data of a network version of a digital map, the route comprising a list of route TMEs to be traveled from the network version origin TME to the network version target TME, the route determined by a network apparatus comprising at least one processor, a memory storing the network version of the digital map, and a communication interface;
accessing, by the network apparatus, map version agnostic information identifying each TME of the list of route TMEs from the network version of the digital map;
generating, by the network apparatus, a map version agnostic identifier for each route TME of the list of route TMEs based on the accessed map version agnostic information;
evaluating, by the network apparatus, one or more coding functions based at least in part on the map version agnostic identifier for each route TME to generate at least one coded map version agnostic identifier for each route TME;
generating, by the network apparatus, an encoding data structure based on the coded map version agnostic identifiers for each route TME, wherein the encoding data structure is a probabilistic data structure configured to not provide false negatives, wherein the encoding data structure is a bloom filter or a subtree data structure; and wherein generating the encoding data structure comprises:
generating at least one coded map version agnostic identifier for at least one adjacent TME using at least one coding function of the one or more coding functions;
determining whether the at least one coded map version agnostic identifier for the at least one adjacent TME satisfies the encoding data structure, wherein an adjacent TME intersects the route and is not a route TME; and
responsive to determining that an adjacent TME satisfies the encoding data structure, increasing the size of the encoding data structure or adding a level to the encoding data structure until there are no adjacent TMEs that satisfy the encoding data structure; and
providing, by the network apparatus, the encoding data structure such that a mobile apparatus receives the encoding data structure.