A Kinematics-Constrained Grid-Based Path Planning Algorithm for Autonomous Parking

This paper presents a kinematics-constrained grid-based path planning algorithm that generates real-time, safe, and executable trajectories, thereby enhancing the performance and reliability of autonomous vehicle parking systems. The grid resolution adapts to the minimum turning radius and steering limits, ensuring feasible motion primitives. The cost function integrates path efficiency, direction-switching penalties, and collision risk to ensure smooth and feasible maneuvers. A cubic spline refinement produces curvature-continuous trajectories suitable for vehicle execution. Simulation and experimental results demonstrate that the proposed method achieves collision-free and curvature-bounded paths with significantly reduced computation time and improved maneuver smoothness compared with conventional A* and Hybrid A*. In both structured and dynamic parking environments, the planner consistently maintained safe clearance and stable tracking performance under variations in vehicle geometry and velocity. These results confirm the robustness and real-time feasibility of the proposed approach, effectively unifying kinematic feasibility, safety, and computational efficiency for practical autonomous parking systems.