High-Density Automated Valet Parking with Relocation-Free Sequential Operations

2026-03-24

AI Summary

This work addresses the challenge of efficiently storing and retrieving vehicles in high-density automated valet parking systems without requiring intermediate vehicle relocations. To this end, the authors propose a joint optimization framework that simultaneously designs parking slot layouts and determines feasible, non-displacement-based operation sequences. The key innovation lies in explicitly modeling the no-relocation constraint as a Boolean logical condition, which is integrated with a recursive search algorithm to generate valid parking and retrieval sequences. Experimental results demonstrate that the proposed method significantly improves spatial utilization while guaranteeing operational feasibility, offering an effective solution for automated parking in space-constrained, high-density environments.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Search and Optimization: Mixed Discrete/Continuous Search
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Virtualization and resource management in Web systems and infrastructures
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking
• Graph Algorithms and Modeling for the Web: Querying, indexing, and retrieval in Web-related graphs

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.

Problem

• automated valet parking
• high-density parking
• relocation-free
• vehicle retrieval
• sequential operations

Innovation

• relocation-free
• automated valet parking
• high-density parking
• sequential operations
• boolean constraints