Shared Vehicle Parking Search Route Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Generating parking search routes for shared vehicles is challenging due to operating area constraints and dynamic distributions, as shared vehicle service providers often limit usage to designated areas for logistical and capacity reasons, making it difficult to account for all available parking spaces.
Innovation Solution
A computer-implemented method and system that determines when a shared vehicle is nearing a destination and generates a parking search route within the designated service area, considering the vehicle's operating constraints and current distribution of shared vehicles, to optimize parking availability and adherence to service provider objectives.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If the system generates parking search routes that maximize parking availability, then the user convenience is improved, but the vehicle may leave the designated service area which violates service provider constraints
Solution Approach 1:
The system segments the parking search process into two phases: primary search within service area boundaries, and secondary evaluation of boundary-proximity options. This segmentation allows the system to prioritize service constraint adherence while still considering expanded parking opportunities when appropriate
Solution Approach 2:
The system dynamically adjusts route generation based on real-time factors including vehicle type, service area boundaries, destination location, and parking availability. The routing algorithm adapts its behavior to balance service constraints with parking needs, making the system flexible rather than rigid
2Reliability
If the system restricts parking search to within service area boundaries, then service provider requirements are met, but the number of available parking spaces decreases
Solution Approach 1:
The system performs preliminary routing to the nearest boundary point of the service area before allowing any boundary-crossing consideration. This preliminary action ensures that the system exhausts all in-boundary options first, and only considers boundary-proximity parking when necessary, thus maintaining service constraint adherence while expanding search scope
Solution Approach 2:
The system applies different search qualities to different regions: strict boundary adherence for most of the service area, and relaxed boundary consideration near destinations that lie close to or outside boundaries. This local quality differentiation allows flexible handling of edge cases while maintaining overall service constraints
3Device complexity
If the system provides straightforward navigation to destination, then route simplicity is improved, but parking availability near destination may be missed due to service area constraints
Solution Approach 1:
The routing system dynamically adjusts its complexity based on the user's proximity to the destination and the availability of parking options. When the vehicle is far from the destination, the route remains straightforward. As the vehicle approaches, the system dynamically introduces parking search deviations, balancing route simplicity with parking availability
Data Source
AI summary
An approach is provided for providing a shared vehicle parking search route. The approach involves determining that a vehicle is nearing a destination. The approach also involves determining a boundary of a service area in which the vehicle is to remain. The approach further involves generating a parking search route for the vehicle to locate a parking space in proximity to the destination based, at least in part, on the boundary.