Node-Based Valet Parking Route Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In automated valet parking systems, the large amount of data required for transmitting route information from a parking place management server to autonomous driving vehicles can lead to significant memory and transmission capacity issues, as the entire route data needs to be transmitted for parking and pick-up operations.
Innovation Solution
The system employs a node-based approach where only a predetermined number of target nodes, including the next-passing node, are specified and transmitted to the vehicle, with node status being dynamically updated based on vehicle speed and state, reducing data transmission and memory requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If the entire route information from drop-off space to target parking space is collectively transmitted to the autonomous driving vehicle, then the vehicle can navigate to the destination, but the amount of transmission data and memory capacity required become enormous
Solution Approach 1:
The patent divides the complete route information into discrete node information segments. Instead of transmitting the entire route as one large data set, the system transmits node information in smaller units corresponding to individual nodes along the route, significantly reducing the amount of data transmitted at any given time while maintaining complete route guidance capability.
Solution Approach 2:
The system pre-calculates and stores the complete route information on the server side before the vehicle begins its journey. This allows the vehicle to receive only the necessary node information sequentially during travel, rather than requiring all route data to be transmitted upfront, thereby reducing initial transmission data requirements.
2Loss of information
If the entire route information is collectively transmitted to the autonomous driving vehicle, then the vehicle can navigate to the destination, but the memory capacity required in the vehicle becomes enormous
Solution Approach 1:
The patent segments the complete route information into individual node information units. The vehicle's memory only needs to store current and nearby node information rather than the entire route data set, dramatically reducing the required memory capacity while maintaining the ability to navigate the complete route through sequential node reception.
Solution Approach 2:
The system extracts only the necessary node information from the complete route data and transmits it to the vehicle as needed. This extraction approach ensures the vehicle receives and stores only the minimal required information for current navigation needs, eliminating the need for large memory capacity to hold entire route data.
3Productivity
If node status is dynamically updated based on vehicle speed and position, then the system can provide real-time navigation guidance, but the complexity of the control system increases
Solution Approach 1:
The system automatically updates node status information based on the vehicle's current position and speed without requiring manual intervention. The server monitors vehicle progress and dynamically adjusts the transmitted node information, providing real-time navigation guidance through automated processes that minimize system complexity while maintaining high efficiency.
Solution Approach 2:
The system implements feedback mechanisms where the vehicle's position and speed information are continuously monitored and used to adjust the node information transmission. This feedback loop enables dynamic adaptation of navigation guidance to the vehicle's actual state, improving efficiency while managing complexity through automated feedback-based control.
Data Source
AI summary
Provided is an automated valet parking system giving an instruction to a target vehicle by specifying a node section at which the target vehicle is located, setting a node status including information on whether passing of a node is allowed, specifying a target node that is the node including a next-passing node among unpassed nodes of the target vehicle and having a predetermined number smaller than a total number of the unpassed nodes, the next-passing node being the node through which the target vehicle passes next on the target route, and transmitting node information associated with the target node to the target vehicle. When the node status at the next-passing node is re-set from a node impassable status to a node passable status, the automated valet parking system transmits the node information of the target node ahead of the next-passing node among the unpassed nodes to the target vehicle.