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.

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.

Abstract: 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 bloom filter set, each bloom filter of the bloom filter set corresponding to a traffic range of the plurality of traffic ranges, wherein each bloom filter encodes road segment identifiers corresponding to the respective traffic range.

Abstract: An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises receiving a node identifier and a first node digest of an update candidate node; obtaining, based on the node identifier, a second node digest of the update candidate node; comparing the first node digest and the second node digest of the update candidate node; and generating, based on the comparison, the update data for the map database, the update data containing one of an indication of unchanged content; node digests of the child nodes of the update candidate node; or updated content corresponding to the update candidate node.

Abstract: An approach is provided for representing an aerial route in a three-dimensional (3D) space. The approach, for example, involves determining a root 3D shape encompassing an aerial route through a 3D space. The 3D space is partitioned into a hierarchy of 3D shapes, and the aerial route comprises a list of 3D shape identifiers (IDs) corresponding to the 3D shapes that form the aerial route. The approach also involves recursively comparing a respective 3D shape ID of the root 3D shape or child shapes of the root 3D shape to the list of 3D shape IDs of the aerial route. The approach further involves generating a traversal command list by selectively adding the respective 3D shape ID that matches a 3D shape ID of the aerial route or includes the 3D shape ID as a child 3D shape ID. The approach further involves providing the traversal command list as an output.

Abstract: An approach is provided for aerial route calculation in a three-dimensional (3D) space. The approach, for example, involves receiving a request to route an aerial vehicle through the 3D space from a start location to a target location. The 3D is represented as 3D shapes (e.g., cubes). The approach also involves matching the start location and the target location respectively to a start shape and a target shape in the 3D space. The approach further involves computing a route through the 3D shapes from the start shape to the target shape based on a collision probability determined based on a first probability of survival due to volume-related factors, a second probability of survival due to aerial-vehicle-related factors, or a combination.

Abstract: A method, an apparatus, and a computer program product for updating a map database are disclosed herein. The method comprises identifying a bounding box specifying a region of a map and obtaining a plurality of map area identifiers and the corresponding map area content based on the bounding box. The method may further include generating a bloom filter, wherein the bloom filter encodes a plurality of digests based on the plurality of map area identifiers and the corresponding map area content and transmitting a map update request comprising the generated bloom filter. The method may further include receiving map update data for at least a portion of the plurality of map area identifiers and the corresponding map area content and updating the map database based on the received map update data.

Abstract: An approach is provided for embedding information into probe data. The approach involves retrieving a probe data set comprising a plurality of probe data points collected from a probe device. The approach also involves determining the information to embed, wherein the information is a bit string of a specified length. The approach further involves iteratively selecting at least one bit of the bit string to embed into at least one probe data point of the plurality of probe data points to generate an embedded probe data set until at least a predetermined portion of the bit string is embedded. The approach further involves providing the embedded probe data set as an output.

Abstract: 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 bloom filter set, the bloom filter set comprising a plurality of bloom filters, said bloom filters 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 bloom filter of the traffic range and provide the traffic range as traffic data for the road segment to a navigation application.

Abstract: 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.

Abstract: 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.

Abstract: A method, a system, and a computer program product for updating a map database are disclosed herein. The method comprises receiving a map update request including a subtree data structure and a bounding box identifying a region of a map. The method may further comprise obtaining a plurality of second map area identifiers and the corresponding area map content. The method may further comprise computing a plurality of second digests corresponding to the plurality of second map area identifiers, based on the plurality of second map area identifiers and the second map area content and generating the map update data for the region, based on the plurality of second digests and the subtree data structure.

Abstract: A method, an apparatus, and a computer program product for updating a map database are disclosed herein. The method comprises identifying a bounding box specifying a region of a map and obtaining a plurality of map area identifiers and the corresponding map area content based on the bounding box. The method may further include generating a subtree data structure, wherein the subtree data structure encodes a plurality of digests based on the plurality of map area identifiers and the corresponding map area content and transmitting a map update request comprising the generated subtree data structure. The method may further include receiving map update data for at least a portion of the plurality of map area identifiers and the corresponding map area content and updating the map database based on the received map update data.

Abstract: Provided herein is a method of estimating a travel time along a route. Methods may include: obtaining a route between an origin and a destination, where the route includes a plurality of road links; identifying a subset of road links of the plurality of road links; providing an identification of each road link of the subset of road links to a service provider; receiving an indication of a pace of travel along each of the subset of road links; computing an estimated travel time along the route based on the pace of travel along each of the subset of road links; and providing an estimated time-of-arrival at the destination based on an identified departure time and the estimated travel time along the route. Methods may include computing an estimated travel time error along the route, and providing the estimated travel time error as a potential error of the estimated time-of-arrival.

Abstract: 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.

Abstract: 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.

Abstract: A POI route response is received that comprises information identifying a starting location and a particular number of POIs, and a bloom filter encoding a route segment set defined by routes from the starting location to each of the particular number of POIs. The information identifying the starting location is used to identify a decoded starting segment of the mobile version of the digital map. Map information is accessed for assigning a cost value to segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A first decoded route is determined based on the cost value assigned to the segments. The first decoded route is a route from the decoded starting segment to a first POI. The first decoded route is provided via a user interface of the mobile apparatus and/or a vehicle is controlled to traverse the first decoded route.

Abstract: A route is determined comprising a list of route segments to be traveled from the network version starting segment to the network version target segment. Map version agnostic information identifying each segment of the list of route segments is accessed from the network version of the digital map. A map version agnostic identifier is generated for each route segment of the list of route segments based on the accessed map version agnostic information. The map version agnostic identifier for each route segment is coded using at least one coding function to generate at least one coded map version agnostic identifier for each route segment. A bloom filter is generated based on the coded map version agnostic identifiers for each route segment. The bloom filter is provided such that a mobile apparatus receives the bloom filter.

Abstract: A method and an apparatus are disclosed for providing navigation instructions.

Abstract: A network apparatus determines a route from an origin 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. The encoding data structure is a probabilistic data structure configured to not provide false negatives.