Parallel Parking: Optimal Entry and Minimum Slot Dimensions
Jiri Vlasak (1, 2), Michal Sojka (2), and Zden\v{e}k Hanz\'alek (2), ((1) Faculty of Electrical Engineering, Czech Technical University in Prague,, (2) Czech Institute of Informatics, Robotics, Cybernetics, Czech Technical, University in Prague)
TL;DR
This paper analyzes the problem of determining optimal entry positions for parallel parking, focusing on how slot dimensions and entry points influence the number of direction changes needed, aiding in overall parking optimization.
Contribution
It introduces a decomposition approach to optimize entry positions in parallel parking, relating slot dimensions and entry points to maneuver complexity.
Findings
Optimal entry positions depend on slot dimensions and desired maneuver complexity.
A relationship between entry points, slot size, and direction changes is established.
This approach can improve the efficiency of automated parking systems.
Abstract
The problem of path planning for automated parking is usually presented as finding a collision-free path from initial to goal positions, where three out of four parking slot edges represent obstacles. We rethink the path planning problem for parallel parking by decomposing it into two independent parts. The topic of this paper is finding optimal parking slot entry positions. Path planning from initial to entry position is out of scope here. We show the relation between entry positions, parking slot dimensions, and the number of backward-forward direction changes. This information can be used as an input to optimize other parts of the automated parking process.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.