Event Parking Reassignment for Congested Transport Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current parking systems for vehicles, especially in congested areas, face challenges in efficiently identifying and allocating optimal parking spaces near event locations, particularly when the number of vehicles exceeds available parking spaces, leading to inefficiencies and increased congestion.
Innovation Solution
A system utilizing a blockchain-based decentralized database and smart contracts to monitor vehicle routes, destinations, and parking availability, prioritizing vehicles based on user profiles and event timelines to dynamically assign parking spaces, allowing vehicles to relocate to more optimal locations as events progress.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If vehicles are assigned to destination locations, then vehicle routing efficiency is improved, but parking space availability deteriorates when the number of vehicles exceeds available spaces
Solution Approach 1:
The system dynamically reassigns parking spaces based on real-time vehicle arrivals and space availability. When a destination location runs out of parking spaces, the system automatically identifies and assigns alternative spaces from nearby locations, updating assignments in real-time as spaces become available.
Solution Approach 2:
The system expands the parking search from a single destination location to multiple alternative locations in the surrounding area. By considering parking spaces across different geographic dimensions and locations, the system finds available spaces when the primary destination is full.
2Quantity of substance
If vehicles are parked further from event locations, then more vehicles can be accommodated, but travel time to reach vehicles deteriorates
Solution Approach 1:
The system performs preliminary identification and assignment of alternative parking spaces before vehicles arrive. By pre-calculating and assigning alternative locations, the system reduces wait times and ensures smooth vehicle allocation without requiring last-minute searches.
Solution Approach 2:
The server acts as an intermediary that coordinates between vehicles, destination locations, and alternative parking spaces. It manages the complex matching process, considering multiple factors such as distance, availability, and vehicle priorities to optimize overall system performance.
3Device complexity
If manual parking identification is used, then system complexity is reduced, but parking identification efficiency deteriorates in congested areas
Solution Approach 1:
The system enables autonomous transports to self-report their parking status and location. Vehicles automatically communicate their parking information to the server, eliminating the need for manual identification and reducing the operational burden on the system while improving accuracy and efficiency.
Solution Approach 2:
The system implements continuous feedback loops where vehicles report their status, the server processes this information, and updates are communicated back to vehicles and relevant parties. This real-time feedback mechanism ensures accurate tracking of parking spaces and enables dynamic reassignment when conditions change.
Data Source
AI summary
An example operation may include one or more of parking a transport in an initial space, determining an average time of an event attended by at least one occupant associated with the transport, moving the transport to at least one other space when an elapsed time of the event is less than the average time and when the at least one other space is available and closer to an event location than the initial space, and moving the transport to a final space when the event is completed, and the final space is a location of a device associated with the at least one occupant.