Planning the collision-free, simultaneous movement of multiple agents is a fundamental problem in multirobot systems and becomes particularly challenging in highly confined environments. This paper addresses this problem by first searching for collision-free paths in a discretized environment and then optimizing the agents' dynamically feasible trajectories along the discrete paths with respect to energy and time. Our approach extends the available movement options at each planning step of the enhanced conflict-based search and results in shorter path lengths, faster planning times, and reduced number of waiting events for agents at waypoints. We compare our new approach with the original algorithm in a simulation study and investigate the performance in confined spaces.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-Agent Path Planning and Trajectory Generation for Confined Environments


    Contributors:


    Publication date :

    2022-06-21


    Size :

    3023421 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    TRAJECTORY OPTIMIZATION IN MULTI-AGENT ENVIRONMENTS

    KOBILAROV MARIN / PARK CHONHYON | European Patent Office | 2025

    Free access

    TRAJECTORY OPTIMIZATION IN MULTI-AGENT ENVIRONMENTS

    KOBILAROV MARIN / PARK CHONHYON | European Patent Office | 2024

    Free access

    Quadrotor Path Planning and Polynomial Trajectory Generation Using Quadratic Programming for Indoor Environments

    Muhammad Awais Arshad / Jamal Ahmed / Hyochoong Bang | DOAJ | 2023

    Free access

    Path Planning of Multi-robots in Confined Spaces

    Raibail, Mehak / Rahman, Abdul Hadi Abd | Springer Verlag | 2024