Abstract: A first category encoding data structure encoding map version agnostic identifiers of traversable map elements (TMEs) within a zone of interest and associated with a first category is received. The first category encoding data structure was provided by a network apparatus. The first category encoding data structure is received by a mobile apparatus comprising a processor, memory storing a mobile version of a digital map, and a communication interface. The first category encoding data structure is a probabilistic data structure configured to not provide false negatives. The mobile apparatus determines a respective category associated with each of one or more TMEs within the zone of interest based at least in part on whether the TME satisfies the first category encoding data structure. The mobile apparatus performs at least one navigation function based at least in part on the respective category associated with each of the one or more TMEs within the zone of interest.

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

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

Abstract: A method and a system for providing a parking recommendation are disclosed herein. The method may include obtaining a route destination location from a user equipment, obtaining parking data for a pre-determined time period, wherein the parking data comprises a plurality of parked locations and a plurality of destination locations, and providing the parking recommendation based on a last mile model, wherein the last mile model is based on the route destination location and the obtained parking data, wherein the last mile model comprises a time-dependent distance threshold.

Abstract: A parking cruise request is received. A network version starting segment is identified and a route determination algorithm is expended starting at the network version starting segment. When the route determination algorithm is expanded to a new segment, a cost value is determined for the new segment based at least on the likelihood of finding parking on the new segment. Responsive to determining that the likelihood of finding parking along the cruise route does satisfy the threshold probability requirement, map version agnostic identifiers for each segment of the cruise route are generated. Each of the map version agnostic identifiers are coded using at least one coding function to generate coded map version agnostic identifiers. A bloom filter having the coded map version agnostic identifiers as members is generated. A parking cruise route response comprising the bloom filter is provided such that a mobile apparatus receives the parking cruise route response.

Abstract: A route response is received by a mobile apparatus storing a mobile version of a digital map. The route response includes information identifying starting and target locations of a route and a bloom filter encoding a route segment set defined by the route. Decoded starting and target segments for the route are identified from the mobile version of the digital map based on the information identifying the starting and target locations. Map information is accessed for determining a cost value for segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A decoded route from the decoded starting segment to the decoded target segment is determined using a cost minimization route determination algorithm based on the cost value assigned to the segments. The decoded route is provided via a user interface and/or a vehicle is controlled to traverse the decoded route.

Abstract: A method and a system for providing a parking recommendation are disclosed herein. The method may include obtaining a route destination location from a user equipment, obtaining parking data for a pre-determined time period, wherein the parking data comprises a plurality of parked locations and a plurality of destination locations, and providing the parking recommendation based on a last mile model, wherein the last mile model is based on the route destination location and the obtained parking data, wherein the last mile model comprises a time-dependent distance threshold.

Abstract: Provided herein is a method of generating and communicating map version agnostic road identifiers. Methods may include: providing an indication of a route request between an origin and a destination; receiving a list of road link identifiers in response to the route request; in response to the first road link identifier not corresponding to a road link identifier of a network of road link identifiers: applying an XOR function to the first road link identifier and a subsequent road link identifier in the list of road link identifiers; in response to a result of the XOR function applied to the first road link identifier and the subsequent identifier corresponding with a road link identifier of the network of road link identifiers, adding the road link identifier of the network of road link identifiers to the route.

Abstract: A route is determined, by a network apparatus storing network version of the digital map, from a starting segment to a target segment. The route comprises a list of route segments from the starting location to the target location. Adjacent segments to the route are identified. An adjacent segment is a segment of the digital map that intersects the route and is not a route segment. An expected traffic delay is determined for each adjacent segment based on traffic data. The adjacent segments are separated into delay groups based on the corresponding expected traffic delays. Delay bloom filters are generated, wherein each delay bloom filter encodes a map version agnostic identifier for the adjacent segments of one of the plurality of delay groups. The delay bloom filters and information identifying the route are provided such that a mobile apparatus receives the delay bloom filters and the information identifying the route.

Abstract: A route response provided by a network apparatus is received. The route response comprises route information and one or more delay bloom filters. The route response is received by a mobile apparatus comprising a processor, memory storing a mobile version of a digital map, and a communication interface. A decoded route is determined based on the route information and the mobile version of the digital map. Based on the one or more delay bloom filters, an expected traffic delay for at least one adjacent segment of the decoded route is determined. An adjacent segment is a segment of the digital map that intersects the decoded route and is not a segment of the decoded route. The decoded route and the expected traffic delay for the at least one adjacent segment of the decoded route is provided via a user interface.

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: An approach is provided for dynamic obstacle data in a collision probability map. The approach, for example, involves monitoring a flight of an aerial vehicle through a three-dimensional (3D) space that is partitioned into 3D shapes of varying resolutions. The approach also involves detecting an entry of the aerial vehicle into one 3D shape of the plurality of 3D shapes. The approach further involves, on detecting an exit of the aerial vehicle form the one 3D shape, recording a 3D shape identifier (ID) of the one 3D shape and at least one of a first timestamp indicating the entry, a second timestamp indicating the exit, a duration of stay in the one 3D shape, dimensions of the aerial vehicle, or a combination thereof as a dynamic obstacle observation record. The approach further involves transmitting the dynamic obstacle observation record to another device (e.g., a server for creating the collision probability map).

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: 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 bloom filter 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 bloom filter.

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

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

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 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, said map area having at least one map area identifier and sending, to a data service, a request for at least one categorized link. The method may further include receiving, from the data service, at least one bloom filter, said 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 at least one map area and associating, at least one 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.

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.