Parking Search Route Generation via Vehicle Path Deprioritization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Finding available on-street parking in areas with limited spaces can be time-consuming and challenging due to the dynamic nature of parking availability, with traditional navigation systems often providing outdated or unreliable data, leading to resource wastage and prolonged search times.
Innovation Solution
A system that generates an optimized parking search route by inferring the paths of other vehicles seeking parking and deprioritizing those paths, based on repeated encounters, to increase the likelihood of finding available spaces.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional navigation systems are used to find parking, then basic route guidance is provided, but the data is outdated and unreliable leading to prolonged search times
Solution Approach 1:
The system implements feedback by detecting other vehicles repeatedly encountered during parking searches, inferring their routes, and using this information to dynamically update and improve parking availability data for future search recommendations
Solution Approach 2:
The system performs preliminary actions by proactively inferring and storing routes of other vehicles before the user needs this information, so that when generating parking search routes, the system already has pre-processed data about occupied areas to avoid recommending them
2Quantity of substance
If parking search covers all possible routes, then comprehensive coverage is achieved, but resource wastage increases and search efficiency decreases
Solution Approach 1:
The system extracts and identifies routes that should be excluded from parking search recommendations by detecting vehicles repeatedly encountered in the same areas, then removes these unproductive routes from the search space to improve overall search efficiency
Solution Approach 2:
Instead of exhaustively searching all possible routes, the system takes partial action by focusing search efforts only on routes not recently traversed by other vehicles, accepting that some areas may be missed in favor of improving overall search efficiency
Data Source
AI summary
An approach is provided for generating an optimized parking search route based on one or more other vehicle driving paths. The approach involves determining that a first vehicle has initiated a search for a parking space. The approach also involves determining a first detection and a second detection of a second vehicle by the first vehicle during the search. The approach further involves calculating a predicted route taken by the second vehicle based on a time difference between the first detection and the second detection. The approach further involves generating the parking search route for the first vehicle based on deprioritizing the predicted route taken by the second vehicle.


