N3P: Accelerated Automated Parking via a Learning-Based Naturalistic Three-Stage Scheme
About
Autonomous parking requires efficient path planning that ensures kinematic feasibility and collision avoidance in constrained environments. Hybrid A* is widely used but computationally expensive, while reinforcement learning (RL) methods lack reliability and often struggle with long-horizon geometric constraints, leading to suboptimal trajectories. We present N3P, a fast learning-based three-stage framework for automated parking. By introducing an intermediate preparatory pose and using a learning module to predict it, N3P decomposes the maneuver into simpler subproblems, thereby reducing computational complexity and accelerating path generation. We validate the framework by integrating it with Hybrid A* algorithms. Experiments in perpendicular and parallel parking scenarios show that N3P-enhanced Hybrid A* speeds up planning by more than 80%. It also outperforms RL baselines in success rate and trajectory quality, producing shorter trajectories with fewer gear changes, while achieving comparable or lower planning time in most cases.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Autonomous Parking Path Planning | Extreme Difficulty Parking Parallel | Minimum Time0.0423 | 9 | |
| Autonomous Parking | Parking Tasks Complex Parallel | Minimum Time (T)0.0506 | 9 | |
| Autonomous Parking | Easy Difficulty Parking Scenarios Parallel | Minimum Parking Time0.0514 | 9 | |
| Autonomous Parking | Parking Tasks Complex Reverse | Min Time0.0439 | 8 | |
| Autonomous Parking | Easy Difficulty Parking Scenarios Reverse | Min(T)0.0471 | 8 | |
| Autonomous Parking Path Planning | Difficulty Parking Reverse (Extreme) | Min Time0.0426 | 8 | |
| Autonomous Parking Path Planning | Extreme Difficulty Parking Forward | Min Time0.04 | 8 | |
| Autonomous Parking | Parking Tasks Complex Forward | Min Time0.0474 | 8 | |
| Autonomous Parking | Easy Difficulty Parking Scenarios Forward | Min Time0.049 | 8 |