Decoding a route encoded by a probabilistic encoding data structure

Patent metadata

Field	Value
Publication number	US-11526480-B2
Application number	US-202017109447-A
Country	US
Kind code	B2
Filing date	Dec 2, 2020
Priority date	May 20, 2020
Publication date	Dec 13, 2022
Grant date	Dec 13, 2022

Abstract

A mobile apparatus receives a route response including information identifying a starting location and a target location of a route and an encoding data structure encoding the route. The encoding data structure is a probabilistic data structure configured to not provide false negatives. The mobile apparatus uses the information identifying the starting and target locations to identify a decoded origin traversable map element (TME) and a decoded target TME of the mobile version of the digital map for the route; accesses map information for determining a cost value for TMEs of the digital map, wherein a TME that satisfies the encoding data structure is assigned a minimal cost value; determines a decoded route from the decoded starting TME to the decoded target TME based on the cost value assigned to the TMEs using a cost minimization route determination algorithm; and performs at least one navigation function using the decoded route.

First claim

That which is claimed:

1. A method comprising:
receiving a route response provided by a network apparatus, the route response comprising information identifying a starting location and a target location of a route and an encoding data structure encoding the route, the route response received by a mobile apparatus comprising a processor, a communication interface, and a memory storing a mobile version of a digital map, wherein the encoding data structure is a probabilistic data structure configured to not provide false negatives;
using, by the mobile apparatus, the information identifying the starting location and the target location to identify a decoded origin traversable map element (TME) of the mobile version of the digital map for the route and a decoded target TME of the mobile version of the digital map for the route;
accessing, by the mobile apparatus, map information for determining a cost value for TMEs of the digital map, wherein a TME that satisfies the encoding data structure is assigned a minimal cost value;
determining, by the mobile apparatus, a decoded route from the decoded starting TME to the decoded target TME based on the cost value assigned to the TMEs using a cost minimization route determination algorithm; and
performing, by the mobile apparatus, at least one navigation function using the decoded route,
wherein the route response comprises a plurality of encoding data structures and a waypoint list, each of the plurality of encoding data structures corresponding to a leg of the route and the waypoint list providing information identifying a beginning TME and an ending TME for each leg of the route, and determining the decoded route comprises determining a decoded route for each leg, each leg corresponding to one of the plurality of encoding data structures in the order indicated by the waypoint list.

2. The method of claim 1 , wherein the encoding data structure is one of a bloom filter or a subtree data structure.

3. The method of claim 2 , wherein the subtree data structure is a prefix hash subtree or a prefix-compressed hash subtree.

4. The method of claim 1 , wherein the cost value assigned to a TME that does not satisfy the encoding data structure is determined based on at least one of a length of the TME or an expected time to traverse the TME.

5. The method of claim 1 , wherein the cost minimization route determination algorithm is a Dijkstra's algorithm.

6. The method of claim 1 , wherein the information identifying the starting location and the target location of a route comprises a geolocation of a point along a network version origin TME corresponding to an origin of the route and the information identifying the target location is a geolocation of a point along a network version target TME corresponding to a destination of the route.

7. The method of claim 1 , further comprising determining whether the decoded route satisfies at least one quality measure, wherein when the decoded route satisfies the at least one quality measure, the decoded route is used to perform the at least one navigation function and when the decoded route does not satisfy the at least one quality measure, a modified route is requested.

8. The method of claim 7 , wherein determining whether the decoded route satisfies at least one quality measure comprises:
determining a length of the decoded route;
determining whether the length of the decoded route and a route length provided in the route response satisfy a similarity measure, wherein when the length of the decoded route and the route length satisfy the similarity measure, the decoded route is determined to satisfy the least one quality measure and when the length of the decoded route and the route length do not satisfy the similarity measure, the decoded route is determined to not satisfy the least one quality measure.

9. The method of claim 1 , prior to receiving the route response, generating and providing a route request, wherein the route request comprises map version agnostic information identifying a starting location for the route and map version agnostic information identifying a target location for the route.

10. The method of claim 9 , wherein the starting location is determined based on location information received from a location sensor in communication with the processor.

11. The method of claim 1 , wherein a TME satisfies the encoding data structure when (a) when the encoding data structure is a bloom filter, when each of a plurality of array positions corresponding to a coded map version agnostic identifier corresponding to the TME have a same value and (b) when the encoding data structure is a subtree data structure, when a path through the subtree data structure that corresponds to a coded map version agnostic identifier corresponding to the TME exists.

12. An apparatus comprising at least one processor, a communications interface configured for communicating via at least one network, and at least one memory storing computer program code and a mobile version of a digital map, the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least:
receive a route response provided by a network apparatus, the route response comprising information identifying a starting location and a target location of a route and an encoding data structure encoding the route, wherein the encoding data structure is a probabilistic data structure configured to not provide false negatives;
use the information identifying the starting location and the target location to identify a decoded origin traversable map element (TME) of the mobile version of the digital map for the route and a decoded target TME of the mobile version of the digital map for the route;
access map information for determining a cost value for TMEs of the digital map, wherein a TME that satisfies the encoding data structure is assigned a minimal cost value;
determine a decoded route from the decoded origin TME to the decoded target TME based on the cost value assigned to the TMEs using a cost minimization route determination algorithm; and
performing at least one navigation function using the decoded route,
wherein the route response comprises a plurality of encoding data structures and a waypoint list, each of the plurality of encoding data structures corresponding to a leg of the route and the waypoint list provides information identifying a beginning TME and an ending TME for each leg of the route, and determining the decoded route comprises determining a decoded route for each leg, each leg corresponding to one of the plurality of encoding data structures in the order indicated by the waypoint list.

13. The apparatus of claim 12 , wherein the encoding data structure is one of a bloom filter or a subtree data structure.

14. The apparatus of claim 13 , wherein the subtree data structure is a prefix hash subtree or a prefix-compressed hash subtree.

15. The apparatus of claim 12 , wherein the cost value assigned to a TME that does not satisfy the encoding data structure is determined based on at least one of a length of the TME or an expected time to traverse the TME.

16. The apparatus of claim 12 , wherein the cost minimization route determination algorithm is a Dijkstra's algorithm.

17. The apparatus of claim 12 , wherein a TME satisfies the encoding data structure when (a) when the encoding data structure is a bloom filter, when each of a plurality of array positions corresponding to a coded map version agnostic identifier corresponding to the TME have a same value and (b) when the encoding data stru

Assignees

• Here Global Bv

Inventors

• Rolf Daniel
• Cajias Raul

Classifications

• G06F16/2453

  Query optimisation · CPC title

• G01C21/3685

  the POI's being parking facilities · CPC title

• G06F16/2291

  User-Defined Types; Storage management thereof · CPC title

• G06F16/24575

  using context · CPC title

• H04L45/7459

  using Bloom filters · CPC title