Search Results

Automated parking is an efficient way to solve parking difficulties and path planning is of great concern for parking maneuvers [1]. Meanwhile, the starting region of path planning greatly affects the parking process and efficiency. The present research of the starting region are mostly determined based on a single algorithm, which limits the flexibility and efficiency of planning feasible paths. This paper, taking parallel parking and vertical parking for example, proposes a method to calculate the starting region and select the most suitable path planning algorithm for parking, which can improve the parking efficiency and reduce the complexity. The collision situations of each path planning algorithm are analyzed under collision-free conditions based on parallel and vertical parking. The starting region for each algorithm can then be calculated under collision-free conditions.