A unified optimal planner for autonomous parking vehicle

Key words:  Optimal trajectory, autonomous parking vehicle, regular parking lots, generality, convex optimization

摘要:

Abstract:

In order to reduce the controlling difficulty caused by trajectory meandering and improve the adaptability to parking into regular lots, a versatile optimal planner (OP) is proposed. Taking advantage of the low speed specificity of parking vehicle, the OP algorithm was modeled the planning problem as a convex optimization problem. Collision-free constraints were formalized into the shortest distance between convex sets by describing obstacles and autonomous vehicle as affine set. Since employing Lagrange dual function and combining KKT conditions, the collision-free constraints translated into convex functions. Taking the national standard into account, 5 kinds of regular parking scenario, which contain $0^\circ$, $30^\circ$, $45^\circ$, $60^\circ$ and $90^\circ$ parking lots, were designed to verify the OP algorithm. The results illustrate that it is benefit from the continuous and smooth trajectory generated by the OP method to track, keep vehicle's stability and improve ride comfort, compared with A* and hybrid A* algorithms. Moreover, the OP method has strong generality since it can ensure the success rate no less than 82% when parking planning is carried out at the start node of 369 different locations. Both of evaluation criteria, as the pear error and RMSE in x direction, y axis and Euclidean distance d, and heading deviation $\theta$, are stable and feasible in real tests, which illustrates that the OP planner can satisfy the requirements of regular parking scenarios.