High-Density Automated Valet Parking with Relocation-Free Sequential Operations
Organizations: School of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea
Abstract
In this paper, we present DROP, high-Density Relocation-free sequential OPerations in automated valet parking. DROP addresses the challenges in high-density parking & vehicle retrieval without relocations. Each challenge is handled by jointly providing area-efficient layouts and relocation-free parking & exit sequences, considering accessibility with relocation-free sequential operations. To generate such sequences, relocation-free constraints are formulated as explicit logical conditions expressed in boolean variables. Recursive search strategies are employed to derive the logical conditions and enumerate relocation-free sequences under sequential constraints. We demonstrate the effectiveness of our framework through extensive simulations, showing its potential to significantly improve area utilization with relocation-free constraints. We also examine its viability on an application problem with prescribed operational order. The results from all experiments are available at: https://drop-park.github.io.
Figures & tables
| Parameter | Value | |
| Parking lot entrance | Entire left boundary of the lot | |
| Parking stall size | 3.0 m 9.5 m | |
| Vehicle | Size | 2.5 m 9.0 m |
| Front/rear overhang | 1.885 m / 2.875 m | |
| Wheelbase | 4.240 m | |
| Steering angle range | ||
| Layout 1 | Layout 2 | Layout 3 | |
|---|---|---|---|
| 56 | 34 | 1 |
| Instance | Steps | Brute-Force | DROP |
|---|---|---|---|
| 15x12 | Layout Gen. | 0.011 0.003 | |
| Postprocess | – | 0.0630 0.0003 | |
| Access. Analysis | – | 0.3126 0.0090 | |
| Seq. Enum. | 2.1961 0.0791 | 0.0042 0.0008 | |
| Total | 2.2071 0.0790 | 0.3908 0.021 | |
| 20x16 | Layout Gen. | 0.026 0.005 | |
| Operation Schedule | Layout 1 | Layout 2 | Layout 3 |
| 8 | 2 | 0 | |
| 24 | 2 | 0 | |
| 48 | 4 | 0 | |
| 40 | 12 | 0 | |
| 16 | 26 | 0 | |
| Note: Each cell represents for each layout and operation schedule . | |||