Parking space routing

A computing device comprising:

• a processor;
• and
• memory comprising processor-executable instructions that when executed by the processor cause performance of operations, the operations comprising:
• retrieving parking data of a parking region from a plurality of data sources, wherein the parking data is filtered to remove outlier parking occupancy data that deviates greater than a threshold from parking occupancy data provided by data sources that provided similar parking occupancy data;
• in response to determining that no parking data is available for one or more parking spaces, estimating parking occupancy data for the one or more parking spaces based upon nearby parking space occupancy, parking meter expiration estimations, and traffic flow of a parking lot comprising the one or more parking spaces;
• identifying a set of available parking spaces within the parking region based upon the parking data and the estimated parking occupancy data;
• computing routes from a current location of a first vehicle to the set of available parking spaces;
• determining a parking space fill order of parking spaces to sequentially fill based upon a congestion metric to reduce congestion within the parking region, wherein the congestion is identified from an evaluation of data acquired over a network from slow moving or stopped vehicles along routes within the parking region;
• ranking the routes based upon a ranking metric to create a set of ranked routes, wherein the ranking metric is used to rank the routes to parking spaces based upon correlations of the routes being proximate to a next parking space to fill of the parking space fill order to reduce the congestion within the parking region;
• computing second routes from a second location of a second vehicle to one or more available parking spaces within the parking region;
• determining a second parking space fill order of parking spaces to sequentially fill based upon the congestion metric to reduce congestion within the parking region;
• ranking the second routes based upon a second ranking metric to create a second set of ranked routes, wherein the second ranking metric is used to rank the second routes to parking spaces based upon correlations of the second routes being proximate to a second next parking space to fill of the second parking space fill order to reduce the congestion within the parking region;
• and
• providing, to one or more display devices, one or more routes associated with allowing a plurality of vehicles, comprising the first vehicle and the second vehicle, to concurrently park in the parking region without a vehicle blocking or waiting on another vehicle, wherein the providing one or more routes comprises:
• providing, to a first display device associated with the first vehicle, a route, of the set of ranked routes, to a parking space based upon the route having a ranking above a threshold;
• and
• providing, to a second display device associated with the second vehicle, a second route, of the second set of ranked routes, to a second parking space based upon the second route having a second ranking above a second threshold.

A non-transitory machine readable medium having stored thereon processor-executable instructions that when executed cause performance of operations, the operations comprising:

• retrieving parking data of a parking region from a plurality of data sources, wherein the parking data is filtered to remove outlier parking occupancy data that deviates greater than a threshold from parking occupancy data provided by data sources that provided similar parking occupancy data;
• in response to determining that no parking data is available for one or more parking spaces, estimating parking occupancy data for the one or more parking spaces based upon nearby parking space occupancy, parking meter expiration estimations, and traffic flow of a parking lot comprising the one or more parking spaces;
• identifying a set of available parking spaces within the parking region based upon the parking data and the estimated parking occupancy data;
• computing routes from a current location of a first vehicle to the set of available parking spaces;
• determining a parking space fill order of parking spaces to sequentially fill based upon a congestion metric to reduce congestion within the parking region, wherein the congestion is identified from an evaluation of data acquired over a network from slow moving or stopped vehicles along routes within the parking region;
• ranking the routes based upon a ranking metric to create a set of ranked routes, wherein the ranking metric is used to rank the routes to parking spaces based upon correlations of the routes being proximate to a next parking space to fill of the parking space fill order to reduce the congestion within the parking region;
• computing second routes from a second location of a second vehicle to one or more available parking spaces within the parking region;
• determining a second parking space fill order of parking spaces to sequentially fill based upon the congestion metric to reduce congestion within the parking region;
• ranking the second routes based upon a second ranking metric to create a second set of ranked routes, wherein the second ranking metric is used to rank the second routes to parking spaces based upon correlations of the second routes being proximate to a second next parking space to fill of the second parking space fill order to reduce the congestion within the parking region;
• and
• providing, to one or more display devices, one or more routes associated with allowing a plurality of vehicles, comprising the first vehicle and the second vehicle, to concurrently park in the parking region without a vehicle blocking or waiting on another vehicle, wherein the providing one or more routes comprises:
• providing, to a first display device associated with the first vehicle, a route, of the set of ranked routes, to a parking space based upon the route having a ranking above a threshold;
• and
• providing, to a second display device associated with the second vehicle, a second route, of the second set of ranked routes, to a second parking space based upon the second route having a second ranking above a second threshold.