A Rapid Iterative Trajectory Planning Method for Automated Parking through Differential Flatness
Zhouheng Li, Lei Xie, Cheng Hu, Hongye Su

TL;DR
This paper introduces a rapid iterative trajectory planning method for automated parking that uses differential flatness and terminal smoothing constraints to ensure collision-free, feasible, and efficient paths, validated through simulations and real-world tests.
Contribution
It presents a novel PVD-based iterative planning approach that balances speed and precision, incorporating vehicle kinematics and curvature continuity for improved control feasibility.
Findings
Superior time efficiency in simulation compared to existing methods
Reduced tracking errors in simulation results
Successful real-world implementation on a ROS-based vehicle
Abstract
As autonomous driving continues to advance, automated parking is becoming increasingly essential. However, significant challenges arise when implementing path velocity decomposition (PVD) trajectory planning for automated parking. The primary challenge is ensuring rapid and precise collision-free trajectory planning, which is often in conflict. The secondary challenge involves maintaining sufficient control feasibility of the planned trajectory, particularly at gear shifting points (GSP). This paper proposes a PVD-based rapid iterative trajectory planning (RITP) method to solve the above challenges. The proposed method effectively balances the necessity for time efficiency and precise collision avoidance through a novel collision avoidance framework. Moreover, it enhances the overall control feasibility of the planned trajectory by incorporating the vehicle kinematics model and…
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.
