Parking Assist Candidate Position Ranking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing parking assist systems lack the ability to efficiently determine a target position for parking that minimizes inconvenience and effort, as they do not effectively rank candidate positions based on the vehicle's position and orientation relative to obstacles and parking boundaries.
Innovation Solution
A parking assist system that includes an electronic control unit to set candidate positions based on detected obstacles and parking boundaries, rank these positions according to the vehicle's position and orientation, and determine the most suitable target position for smooth parking.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If the parking assist system selects a parking space based on simple rules (e.g., opposite to turning direction), then the system complexity is reduced, but the convenience and smoothness of parking is worsened
Solution Approach 1:
The system performs preliminary ranking of candidate parking positions before final selection. By pre-calculating and ranking multiple candidate positions based on vehicle position, orientation, and environmental factors, the system prepares optimal choices in advance, improving parking convenience without requiring complex real-time decision-making during the parking maneuver.
Solution Approach 2:
The system dynamically adjusts the selection of target parking position based on the vehicle's current position and orientation. Instead of using fixed selection rules, the system continuously evaluates candidate positions relative to the vehicle's dynamic state, allowing the optimal parking position to change as the vehicle moves, thereby improving parking smoothness and convenience.
2Ease of operation
If the parking assist system evaluates multiple candidate positions with ranking, then the parking convenience is improved, but the computational complexity and processing time are worsened
Solution Approach 1:
The system segments the parking space into multiple discrete candidate positions and evaluates them independently. By dividing the continuous parking space into distinct candidate points and ranking them separately, the system can efficiently process each candidate without requiring complex continuous optimization, reducing overall processing time while maintaining convenience.
Solution Approach 2:
The system evaluates a limited number of candidate positions (e.g., 3-5 candidates) rather than analyzing every possible parking location. By performing partial evaluation on a selective subset of promising candidate positions identified through initial filtering, the system achieves good parking convenience without the computational burden of exhaustive search.
3Speed
If the system determines target position without ranking candidates, then the processing speed is maintained, but the parking smoothness and efficiency are worsened
Solution Approach 1:
The system performs preliminary ranking of candidate parking positions before final target selection. By pre-calculating and ranking multiple candidate positions based on vehicle position, orientation, and environmental factors, the system prepares optimal choices in advance, enabling fast final selection without compromising parking efficiency.
Solution Approach 2:
The system automatically ranks and selects the optimal target position without requiring manual driver input or complex iterative adjustments. The ranking mechanism enables the system to self-determine the best parking position based on pre-established criteria, improving parking efficiency while maintaining fast processing through automated decision-making.
Data Source
AI summary
A parking assist system includes an electronic control unit. The electronic control unit is configured to set at least one candidate position that is a candidate for a target position of a moving path of a vehicle on the basis of at least one of a detected obstacle or a detected parking boundary, rank each of the at least one candidate position on the basis of the candidate position and a position and orientation of the host vehicle, and determine one of the ranked at least one candidate position as the target position.