Prioritized Multi-Agent Path Finding for AVPC Leveraging Distributional Dueling DQN
IEEE Open Journal of Intelligent Transportation Systems · 2026 · 7 · 1809-1820
DOI: 10.1109/ojits.2026.3708138 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Open Journal of Intelligent Transportation Systems, 2026. Verfasst von Cheng Chen und 4 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
The proliferation of vehicle ownership in major cities and urban areas has presented significant challenges in parking environments, including a demand-supply imbalance of parking spaces, traffic congestion, and overall parking inconvenience. Automated Valet Parking (AVP) has emerged as a promising solution to address the parking problem by efficiently automating parking operations and optimizing parking space utilization. However, most existing AVP solutions overlook the growing popularity of Electric Vehicles (EVs) and the added complexity of EV-charging, which exacerbates the existing parking problem. Moreover, multiple vehicles attempting to find their allocated parking spaces and/or charging units in a constrained parking lot are susceptible to collisions and path conflicts. This paper proposes a novel prioritized multi-vehicle path-finding framework for Automated Valet Parking and Charging (AVPC) that leverages Distributional Dueling Deep Q-Network (TDQN). Specifically, we formulate the multi-vehicle path-finding problem as a Priority-based Distributed Cooperative Control (PDCC) optimization by assigning parking resources (parking spaces and charging units) with different priorities to multiple vehicles, each acting as an agent. We design a new reward mechanism to ensure efficient task execution among cooperating vehicles, thereby improving the parking success rate and mitigating congestion. Simulation results and analysis indicate that the proposed framework not only enhances vehicle cooperation but also significantly reduces parking space requirements, providing new ideas for smarter urban parking solutions.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Chen, C., Si, H., Boateng, G. O., Guo, X., & Yao, D. (2026). Prioritized Multi-Agent Path Finding for AVPC Leveraging Distributional Dueling DQN. IEEE Open Journal of Intelligent Transportation Systems, 7, 1809-1820. https://doi.org/10.1109/ojits.2026.3708138
Vancouver
Chen C, Si H, Boateng GO, Guo X, Yao D. Prioritized Multi-Agent Path Finding for AVPC Leveraging Distributional Dueling DQN. IEEE Open Journal of Intelligent Transportation Systems. 2026;7:1809-1820. doi:10.1109/ojits.2026.3708138
BibTeX
@article{Chen2026,
author = {Chen, Cheng and Si, Haonan and Boateng, Gordon Owusu and Guo, Xiansheng and Yao, Danya},
title = {Prioritized Multi-Agent Path Finding for AVPC Leveraging Distributional Dueling DQN},
journal = {IEEE Open Journal of Intelligent Transportation Systems},
year = {2026},
volume = {7},
pages = {1809--1820},
doi = {10.1109/ojits.2026.3708138}
}
EUVIMED