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.
翻译:自动泊车的路径规划问题通常被说成是寻找从最初位置到目标位置的无碰撞路径,四个停车位边缘中有三个是障碍。我们重新思考平行泊车的路径规划问题,将其分为两个独立部分。本文的主题是找到最佳的泊车位进入位置。从最初位置到进入位置的路径规划在此范围外。我们显示了入口位置、停车位维度和后向方向变化数量之间的关系。这些信息可以用作优化自动泊车过程其他部分的投入。