This paper is focused on planning fast, accurate, and optimal trajectories for autonomous parking. Nominally, this task should be described as an optimal control problem (OCP), wherein the collision-avoidance constraints guarantee travel safety and the kinematic constraints guarantee tracking accuracy. The dimension of the nominal OCP is high because it requires the vehicle to avoid collision with each obstacle at every moment throughout the entire parking process. With a coarse trajectory guiding a homotopic route, the intractably scaled collision-avoidance constraints are replaced by within-corridor constraints, whose scale is small and independent from the environment complexity. Constructing such a corridor sacrifices partial free spaces, which may cause loss of optimality or even feasibility. To address this issue, our proposed method reconstructs the corridor in an iterative framework, where a lightweight OCP with only box constraints is quickly solved in each iteration. The proposed planner, together with several prevalent optimization-based planners are tested under 115 simulation cases w.r.t. the success rate and computational time. Real-world indoor experiments are conducted as well.
Optimization-Based Trajectory Planning for Autonomous Parking With Irregularly Placed Obstacles: A Lightweight Iterative Framework
IEEE Transactions on Intelligent Transportation Systems ; 23 , 8 ; 11970-11981
2022-08-01
2416122 byte
Article (Journal)
Electronic Resource
English
Trajectory Planning of Autonomous Vehicles in Environments with Moving Obstacles
British Library Conference Proceedings | 1993
|TRAJECTORY OPTIMIZATION FOR AUTONOMOUS VEHICLES ON CROSSROADS WITH MOBILE OBSTACLES
British Library Conference Proceedings | 2018
|Real-Time Trajectory Planning for Autonomous Aerospace Vehicles amidst Static Obstacles
British Library Conference Proceedings | 2002
|