Parking Route Optimization via Utility Scoring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current navigation systems do not optimize routes to parking spots based on the availability status of other spots along the route, which limits the collection of accurate availability data for future navigation or parking requests.
Innovation Solution
A method and system that determine a utility score for candidate routes to parking spots based on the availability status of non-candidate spots along the route, selecting the route with the highest utility score to optimize data collection and navigation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If navigation systems select routes based on shortest driving distance or time, then driving efficiency is improved, but availability data collection of other parking spots is insufficient
Solution Approach 1:
The system changes the routing parameter from purely time-based optimization to a composite utility score that incorporates both driving time and data collection value. Routes are evaluated based on multiple parameters including estimated travel time, number of unknown availability spots along the route, and current database completeness, transforming the single-objective navigation problem into a multi-objective optimization problem.
Solution Approach 2:
The navigation system performs multiple functions simultaneously: it provides turn-by-turn directions to the destination parking spot while also identifying and directing vehicles through areas with unknown parking spot availability. The route selection process serves both navigation purposes and data collection purposes, making the system multi-functional rather than single-purpose.
2Loss of information
If vehicles are directed to collect availability data of all parking spots, then data completeness is improved, but navigation efficiency deteriorates
Solution Approach 1:
The system transforms the routing decision from a simple shortest-path problem to a utility-based selection process. Each candidate route is assigned a utility score that balances navigation efficiency (driving time) against data collection value (number of unknown spots). This parameter transformation allows the system to optimize for a combination of both goals rather than treating them as conflicting objectives.
Solution Approach 2:
The system does not require vehicles to visit every parking spot with unknown availability, but rather selects routes that pass through a subset of these spots based on the utility score. This partial action approach collects sufficient data to improve database completeness without requiring exhaustive coverage that would significantly increase navigation time.
3Measurement precision
If the parking spot database is frequently updated with real-time availability data, then data accuracy is improved, but system complexity increases
Solution Approach 1:
The system implements a feedback mechanism where vehicles report observed parking spot availability status back to the central database. The database is continuously updated with this new information, improving data accuracy over time. The feedback loop allows the system to learn from actual observations and refine its routing decisions based on current database state.
Solution Approach 2:
The system uses existing vehicle navigation infrastructure and vehicle-mounted sensors to collect availability data, rather than requiring dedicated data collection hardware or manual input. Vehicles essentially service the database update function as part of their normal navigation operation, reducing overall system complexity while maintaining high data accuracy.
Data Source
AI summary
A method for optimizing a parking spot database is provided including determining a utility score of a candidate route to a candidate parking spot of a plurality of parking spots of a parking spot database based on an availability status of a non-candidate parking spot along the candidate route, and selecting the candidate route from a plurality of candidate routes based on the utility score.