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 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 POI request comprising query criteria and information identifying a starting location is received. A network version starting segment is identified based on the information identifying the starting location. A route determination algorithm is expanded, starting at the starting segment. When the route determination algorithm is expanded to a new segment, it is determined whether any POIs associated with the new segment match the query criteria. Responsive to determining that a POI associated with the new segment satisfies the query criteria, a POI route from the starting segment to the POI is extracted. Map version agnostic identifiers are generated for each segment of the POI routes. Each of the map version agnostic identifiers are coded using at least one coding function. A bloom filter having the coded map version agnostic identifiers as members is generated. The bloom filter is provided such that a mobile apparatus receives the bloom filter.

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 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: Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: receiving an indication of a route request between an origin and a destination; identifying a starting road segment corresponding to the origin; identifying a target road segment corresponding to the destination; establishing a route between the starting road segment and the target road segment, the route including a plurality of road segments; dividing the route up between the starting road segment and the target road segment into a plurality of route fragments, each route fragment including one or more road segments; generating a fingerprint for each route fragment; and providing the fingerprints in response to the route request.

Abstract: A method is disclosed comprising: obtaining, at a terminal, a final route that comprises one or more indications, wherein each indication of the indications respectively indicates, whether or not a link or considered-to-be-suited link corresponding to a link that is contained in a current version of a map region and is identified by a respective link identifier comprised in an intermediate route determined at least based on respective current versions of one or more map regions and used as a basis for determining the final route, is considered to be contained in a non-current version of the map region available to the terminal; and conducting a route guiding process at the terminal at least based on the final route and at least respective non-current versions of one or more map regions available to the terminal that respectively contain, according to the one or more indications, a link or considered-to-be-suited link corresponding to a link that is contained in a respective current version of the respective m

Abstract: A method is disclosed comprising: 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 one or more map regions; determining a final route by replacing, in the intermediate route, one or more 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.

Abstract: Provided herein is a method of generating and communicating map data agnostic routes between systems, and particularly, to identifying routes between an origin and one or more points-of-interest. Methods may include: receiving an indication of a route request between an origin and one or more points-of-interest; identifying a starting road segment corresponding to the origin; identifying a point-of-interest road segment corresponding to each of the one or more points-of-interest; generating at least one route between the starting road segment and a corresponding one of the one or more point-of-interest road segments; generating a fingerprint for the at least one route; and providing the fingerprints in response to the route request.

Abstract: An approach is provided for detecting traffic anomalies in real-time using sparse probe-data. The approach involves processing probe data collected from a partition of a digital map to determine a probe origin point, a probe destination point, or a combination thereof. The approach also involves generating an origin/destination matrix for the partition based on the origin point, destination point, or combination thereof. The approach further involves calculating an estimated traffic flow for road segments of the partition based on the matrix. The approach also involves determining a road segment from among the plurality for which the estimated traffic flow differs by more than a threshold value from an observed traffic flow indicated by the probe data for the least one road segment. The approach further involves providing data to indicate a detection of the traffic anomaly on the at least one road segment based on the difference.

Abstract: A method, apparatus, and computer program product are provided for predicting parking availability for one or more road segments based on the map-matched probe data points. A method may include: receiving probe data points from a vehicle, where each probe data point includes a location; determining, from the probe data points, a parking location of the vehicle on a road segment, where the relative location along the road segment on which the vehicle parked can be determined; and estimating availability of other parking spaces along the road segment based on the relative location.

Abstract: A method, apparatus and computer program product are provided to more accurately construct a traffic model. In regards to a method, links of a second traffic model are categorized as being either observed or unobserved. A link is observed if a most likely route through a first traffic model transits over the link and includes at least a predetermined number of probe data points. Separately for an unobserved graph comprised of unobserved links and an observed graph comprised of observed links, the method determines a fastest path between common nodes that appear in each of the unobserved and observed graphs. In an instance in which the fastest path in the unobserved graph is at least as fast as the fastest path in the observed graph, a travel time penalty is added to a travel time of the unobserved link in a second traffic model, subsequent to the first traffic model.

Abstract: Methods, apparatus, computer program products, and systems related to partial map updates are provided. An example embodiment provides a method comprising receiving a map update for at least a first tile comprising map update data. The map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile. A map region of interest is determined, wherein the map region of interest comprises at least a portion of the first tile. The previous map data for the one or more changed or new links intersected by the tile boundary is used or displayed when a map update for the second tile has not been received and is not used or displayed when a map update for the second tile has been received.

Abstract: A method comprising: collecting a plurality of probe data from a plurality of probe points by a probing device, said probe data comprising at least positional information, a speed vector and a direction of travel of the probing device and a timestamp of recording the probe data at a probe point; and estimating a trajectory of the probing device between two consecutive probe points as a cubic Hermite spline having the positions of said two consecutive probe points as control points and the speed vectors of said two consecutive probe points as control vectors.

Abstract: Systems, apparatuses, and methods are provided for determining a navigation route. A route is requested by a navigation device between a starting location and a destination location. The route request is received by an external processor for analysis. A navigation route is determined by the external processor and its associated map version. The determined navigation route is then encoded with a sequence of path decisions along the route. The encoded navigation route is transmitted to the navigation device.

Abstract: A method, apparatus, and computer program product are therefore provided for providing a navigation user interface to a plurality of points of interest. Methods may include receiving an indication of a location; receiving an indication of a category of points of interest; identifying a plurality of points of interest associated with the category; generating point of interest specific routes from the location to each of the plurality of points of interest; identifying portions of the point of interest specific routes that are common to more than one point of interest; generating a plurality of consolidated routes, where multiple points of interest are located along at least one of the plurality of consolidated routes; and providing for presentation of the plurality of consolidated routes, where each of the plurality of consolidated routes is distinguished, based at least in part, on the number of points of interest that are located along the respective consolidated route.

Abstract: An approach is provided for providing routing calculations and route guidance based on geographic positioning and/or other sensor data from one or more mobile devices independent of map data. A routing platform processes and/or facilitates a processing of one or more probe data samples associated with at least one mobile device to determine one or more device tracks. The routing platform processes and/or facilitates a processing of the one or more device tracks to determine at least one tessellation, wherein the at least one tessellation is a subdivision of a plane or sphere into one or more tiles and a plurality of segments. The routing platform further determines one or more relationships between one or more of the plurality of segments based, at least in part, on a mapping of the one or more device tracks against the at least one tessellation.

Abstract: Systems, apparatuses, and methods are provided for determining a navigation route. A route is requested by a navigation device between a starting location and a destination location. The route request is received by an external processor for analysis. A navigation route is determined by the external processor and its associated map version. The determined navigation route is then encoded with geographic data for each path segment along the route. The encoded navigation route is transmitted to the navigation device.

Abstract: A method, apparatus and computer program product are provided to more accurately construct a traffic model. In regards to a method, links of a second traffic model are categorized as being either observed or unobserved. A link is observed if a most likely route through a first traffic model transits over the link and includes at least a predetermined number of probe data points. Separately for an unobserved graph comprised of unobserved links and an observed graph comprised of observed links, the method determines a fastest path between common nodes that appear in each of the unobserved and observed graphs. In an instance in which the fastest path in the unobserved graph is at least as fast as the fastest path in the observed graph, a travel time penalty is added to a travel time of the unobserved link in a second traffic model, subsequent to the first traffic model.

Abstract: Methods, apparatus, systems, and computer program products for predicting short term travel behavior of a user without knowing the user's destination. In one embodiment, a method is provided. The method comprises receiving historical location information for a vehicle and querying a set of indexed partial routes. A partial route of the set of indexed partial routes has a compiled quantity assigned thereto. The method further comprises reducing the set of indexed partial routes to a set of candidate partial routes based at least in part on the historical location information and identifying a most likely partial route from the set of candidate partial routes based at least in part on the compiled quantity associated with each of the candidate partial routes.