High-Density Automated Valet Parking with Relocation-Free Sequential Operations
This addresses the challenge of efficient parking and retrieval in automated valet systems, though it appears incremental as it builds on existing parking optimization concepts.
The paper tackles the problem of high-density automated valet parking without requiring vehicle relocations, presenting DROP, a method that generates area-efficient layouts and relocation-free sequences, achieving significant improvements in area utilization in simulations.
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.