Here Global B.v.

Navteq B.v.

Daniel Rolf

Raul Cajias

Mirko Maischberger

Alex Gonopolskiy

David Falla Cepeda

Prokop Jehlicka

Björn Karge

Hilko Hofmann

Torsten Sievers

Federico Rubagotti

Ullrich Praetz

Torsten Sieyers

Tomasz Jakubowski

A network apparatus determines a route from an origin traversable map element (TME) to a target TME. The route comprises a list of route TMEs to be traveled from the starting location to the target location. The network apparatus identifies adjacent TMEs to the route, wherein an adjacent TME is a TME of the digital map that intersects the route and is not a route TME; determines an expected traffic delay for each adjacent TME based on traffic data; separates the adjacent TMEs into a plurality of delay groups based on the corresponding expected traffic delays; generates delay encoding data structures; and provides the delay encoding data structures and information identifying the route. Each delay encoding data structure encodes a map version agnostic identifier for the adjacent TMEs of one of the delay groups and is a probabilistic data structure configured to not provide false negatives.

Traffic-aware route encoding using a probabilistic encoding data

A method, an apparatus, and a computer program product may be provided for requesting traffic data. The apparatus may determine at least one map area comprising road segments, said map area having at least one map area identifier, determine road segment identifiers for the road segments of the at least one map area, send to a data service, a request for traffic data, said request identifying the map area, and receive from the data service, a subtree data structure set, the subtree data structure set comprising a plurality of subtree data structures, said subtree data structures in the set corresponding to traffic ranges. The apparatus may associate a road segment in a corresponding traffic range based on the road segment identifier satisfying one subtree data structure of the traffic range and provide the traffic range as traffic data for the road segment to a navigation application.

Method, apparatus, and computer program product for requesting traffic data using subtree data structure

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.

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

An apparatus and method are disclosed for obtaining a simulated preview that depicts a representation of one or more user interface changes associated with an application plug-in. The approach involves, for example, rendering the simulated preview overlaid on a user interface of an application executing on a device. The rendering aligns the representation of the one or more user interface changes over the user interface to depict a preview of the one or more user interface changes that will occur after an installation of the application plug-in. The approach also involves rendering the simulated preview along with one or more simulated previews of installed plug-ins overlaid in a staked view on the user interface of the application. Addition and/or deletion of plug-ins can be managed in the stacked view.

Method and apparatus for application plug-in management

A network apparatus determines a route from an origin traversable map element (TME) to a target TME based on map data of a network version of a digital map. The route includes a list of route TMEs to be traveled from the origin TME to the target TME. The network apparatus accesses map version agnostic information identifying each TME of the list of route TMEs from the network version of the digital map; generates a map version agnostic identifier for each route TME of the list of route TMEs based on the accessed information; evaluates coding functions based at least on the map version agnostic identifier for each route TME to generate a coded identifier for each route TME; generates an encoding data structure based on the coded identifiers for the route TMEs; and provides the encoding data structure.

Encoding a route using a probabilistic encoding data structure

Provided herein is a method of generating low bandwidth map format agnostic routes between origins and destinations for route communication between different map formats or versions using reduced bandwidth. Methods may include: receiving an indication of a route request between an origin and a destination; generating a route between the origin starting road segment and the destination target road segment, the route including a plurality of road segments; identifying one or more intermediate segments from the plurality of road segments, each intermediate segment having an anchor point; generating a plurality of route fragments from the route; encoding each route fragment by applying an XOR algorithm to identifiers of route fragment road segments of a respective route fragment; and providing the encoded route fragments and one or more anchor points of the one or more intermediate segments in response to the route request.

Method, apparatus, and computer program product for generating and communicating low bandwidth map version agnostic routes

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.

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

An approach is provided for speculative navigation routing in incomplete maps. The approach involves, for example, generating an offline navigation route to a destination using offline map data cached at a device. The approach also involves transmitting a routing request to a routing server for an online navigation route to the destination. The approach further involves providing the online navigation route or a portion of the online navigation route based on determining that the online navigation route or the portion of the online navigation is received within a timeout period. The approach further involves providing the offline navigation route or a portion of the offline navigation route generated during the timeout period based on determining that the online navigation route or the portion of the online navigation route is not received before the timeout period ends.

Method and apparatus for providing speculative navigation routing in incomplete offline maps

A mobile apparatus receives a route response comprising an encoded route and one or more delay encoding data structures. The delay encoding data structures are probabilistic data structures configured to not provide false negatives. The mobile apparatus determines a decoded route based on the encoded route and a mobile version of a digital map; determines an expected traffic delay for at least one adjacent traversable map element (TME) of the decoded route based on the one or more delay encoding data structures; and performs one or more navigation functions based at least on the expected traffic delay for the at least one adjacent segment of the decoded route. An adjacent TME is a TME of the digital map that intersects the decoded route and is not a TME of the decoded route.

Traffic-aware route decoding using a probabilistic encoding data structure

Provided herein is a method of generating low bandwidth map format agnostic routes between origins and destinations for route communication between different map formats or versions using reduced bandwidth. Methods may include: receiving one or more intermediate segment anchor points and encoded server-provided route fragments for a requested route between an origin and a destination; identifying one or more intermediate segments corresponding to the one or more intermediate segment anchor points; generating a route between the origin and the destination, the route including the one or more intermediate segments and a plurality of client-generated route fragments; encoding each client-generated route fragment by application of an XOR algorithm to the client-generated route fragment road segments; comparing the encoded client-generated route fragments to the encoded server-provided route fragments; and providing navigational assistance for traveling along the route in response to the encoded client-generated route fragments corresponding with the encoded server-provided route fragments.

Information corresponding to one or more traversable map elements (TMEs) within a zone of interest is accessed from the geographic database. A respective category of a plurality of categories is determined for each of the one or more TMEs based at least in part on the information corresponding to the TME. A first category encoding data structure is generated based at least in part on map version agnostic identifiers corresponding to TMEs determined to be in a first category of the plurality of categories, wherein the first category encoding data structure is a probabilistic data structure configured to not provide false negatives for TMEs within the zone of interest. The first category encoding data structure is provided such that a mobile apparatus receives the first category encoding data structure.

Providing incremental updates of categorical information using a probabilistic encoding data structure

A method and an apparatus are disclosed for providing navigation instructions. The method may include receiving, from a user apparatus, a first location and a destination location; calculating a first route from the first location to the destination location; generating, for a predetermined time period, a first set of maneuvering data corresponding to the first route, the first set of maneuvering data comprising playback cues based on a predicted user apparatus location; transmitting the first set of maneuvering data to the user apparatus; receiving, from the user apparatus, a second location; generating, for a subsequent predetermined time period, a second set of maneuvering data, the second set of maneuvering data comprising playback cues based on a further predicted user apparatus location; calculating an update set of maneuvering data based on the first and second set of maneuvering data; and transmitting the update set of maneuvering data to the user apparatus.

Methods and apparatuses for providing navigation instructions

A method for: obtaining route request information characterizing a route to be provided to a terminal; determining, at least partially based on the route request information, an intermediate route comprising a plurality of link identifiers respectively identifying links in respective current versions of map regions; determining a final route by replacing, in the intermediate route, link identifiers by respective indications, wherein each indication of the indications respectively indicates whether or not a link or considered-to-be-suited link corresponding to a link, which is identified by the link identifier replaced by the indication and which is contained in a current version of a map region, is considered to be contained in a non-current-version of the map region available to the terminal, wherein the considered-to-be-suited-link is a link that is considered to be suited to be used for a route guiding process at the terminal; and outputting the final route.

Route determination and navigation based on multi-version map regions

A method, a system, and a computer program product may be provided for providing traffic data to a client device. The system may receive from the client device, a request for traffic data corresponding to road segments of at least one map area, said request identifying the at least one map area and determine road segment identifiers corresponding to each of the road segments of the at least one map area and determine traffic data for at least a portion of the road segment identifiers, said traffic data obtained from a traffic data source. The system may further determine a plurality of traffic ranges based on the obtained traffic data and generate a subtree data structure set, each subtree data structure of the subtree data structure set corresponding to a traffic range of the plurality of traffic ranges, wherein each subtree data structure encodes road segment identifiers corresponding to the respective traffic range.

Method, system, and computer program product for providing traffic data using subtree data structure

An apparatus, method and computer program product are provided for generating map data of categorized links. The method may include receiving a request for at least one categorized link in a map area and obtaining at least one categorized link in the map area, based on the request. The method may further include determining link identifiers corresponding to each link of the at least one categorized link, and generating at least one bloom filter, wherein the at least one bloom filter encodes link identifiers corresponding to each link of the at least one categorized link.

Growing community of inventors

Berlin, Germany

Daniel Rolf