Abstract: A method of determining a parking route for a vehicle travelling on a road network within a geographic area is disclosed. A sub-network is determined comprising a subset of segments of an electronic map that are representative of roads within a predetermined walking time or distance of a destination location. Data indicative of a walking time or distance from the segment to the destination location is associated, at least with the segments of the sub-network representing roads having at least one associated parking space. A search algorithm having an associated cost function is used to explore the segments of the sub-network from an origin location to identify a plurality of candidate parking routes, wherein the cost for a given parking route is based on the probability of the vehicle successfully finding a parking space on the parking route and the expected cumulative travel and walking time or distance to the destination location should a parking space be found along the parking route.

Abstract: Disclosed herein is a technique for operating a navigation server and a plurality of navigation clients. Each of the navigation clients transmits a model data trained on a local training data set to the navigation server. The navigation client also transmits attribute data characterizing the local training data set to the navigation server. The navigation server uses the attribute data to weigh the contributions of the model data for performing a weighted aggregation into an aggregated set of model parameters for distribution to the navigation client for improving its local model data.

Abstract: A method of determining a parking route for a vehicle travelling on a road network within a geographic area is disclosed. A sub-network is determined comprising a subset of segments of an electronic map that are representative of roads within a predetermined walking time or distance of a destination location. Data indicative of a walking time or distance from the segment to the destination location is associated, at least with the segments of the sub-network representing roads having at least one associated parking space. A search algorithm having an associated cost function is used to explore the segments of the sub-network from an origin location to identify a plurality of candidate parking routes, wherein the cost for a given parking route is based on the probability of the vehicle successfully finding a parking space on the parking route and the expected cumulative travel and walking time or distance to the destination location should a parking space be found along the parking route.

Abstract: An approach is provided for determining an escape point for at least one predicted route, and causing a timely notification based on attributes associated with the escape point. The approach involves determining at least one predicted route for at least one vehicle. The approach also involves determining one or more traffic events associated with the at least one predicted route. The approach further involves determining at least one escape point for the one or more traffic events, wherein the at least one escape point represents at least one location at which the one or more traffic events can be avoided via at least one detour route. The approach also involves causing, at least in part, a presentation of one or more notifications related to the at least one escape point, the one or more traffic events, or a combination thereof based, at least in part, on characteristic information, availability information, or a combination thereof associated with the at least one escape point.

Abstract: An approach is provided for determining an escape point for at least one predicted route, and causing a timely notification based on attributes associated with the escape point. The approach involves determining at least one predicted route for at least one vehicle. The approach also involves determining one or more traffic events associated with the at least one predicted route. The approach further involves determining at least one escape point for the one or more traffic events, wherein the at least one escape point represents at least one location at which the one or more traffic events can be avoided via at least one detour route. The approach also involves causing, at least in part, a presentation of one or more notifications related to the at least one escape point, the one or more traffic events, or a combination thereof based, at least in part, on characteristic information, availability information, or a combination thereof associated with the at least one escape point.