Improving the land use of parking lots is an essential component of good urban planning. To this end, many planners have introduced cooperative automated valet parking (Co-AVP) systems that realize high-density parking (HDP). Effective HDP requires the relocation of vehicles that blocks other vehicles from entering and leaving the Co-AVP. This paper proposes and solves a destination-assignment and path-planning problem for multiple vehicles with three roles: entering, leaving, and relocating. We minimize the total travel time of leaving vehicles and the total travel distance of entering and relocating vehicles from a service-policy viewpoint. We then propose two methods, integer linear programming (ILP)-based and conflictbased search (CBS)-based, for solving the problem. Numerical experiments demonstrated that the ILP-based approach scales better than the CBS-based approach. We also confirmed the applicability of our approaches to realistic parking situations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    High Density Automated Valet Parking via Multi-agent Path Finding


    Contributors:


    Publication date :

    2022-10-08


    Size :

    2473238 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Multi-Agent Path Finding with Priority for Cooperative Automated Valet Parking

    Okoso, Ayano / Otaki, Keisuke / Nishi, Tomoki | IEEE | 2019


    AUTOMATED VALET PARKING METHOD AND AUTOMATED VALET PARKING SYSTEM

    NAKAGAWA TAKUYA / KOSUGE FUMIO / IKEDA MASAO | European Patent Office | 2024

    Free access

    AUTOMATED VALET PARKING METHOD AND AUTOMATED VALET PARKING SYSTEM

    NAKAGAWA TAKUYA / KOSUGE FUMIO / IKEDA MASAO | European Patent Office | 2022

    Free access

    VEHICLE AUTOMATED VALET PARKING SYSTEM AND AUTOMATED VALET PARKING METHOD

    MARUIWA NOBUTSUGU / SUGANO TATSUYA | European Patent Office | 2023

    Free access