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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Multi-Agent Path Planning and Trajectory Generation for Confined Environments


    Beteiligte:
    Beyoglu, Hikmet (Autor:in) / Weiss, Stephan (Autor:in) / Rinner, Bernhard (Autor:in)


    Erscheinungsdatum :

    2022-06-21


    Format / Umfang :

    3023421 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    TRAJECTORY OPTIMIZATION IN MULTI-AGENT ENVIRONMENTS

    KOBILAROV MARIN / PARK CHONHYON | Europäisches Patentamt | 2024

    Freier Zugriff

    TRAJECTORY OPTIMIZATION IN MULTI-AGENT ENVIRONMENTS

    KOBILAROV MARIN / PARK CHONHYON | Europäisches Patentamt | 2024

    Freier Zugriff

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

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

    Freier Zugriff


    Trajectory Generation and Path Planning for Autonomous Aerobots

    Sharma, Shivanjli / Kulczycki, Eric A. / Elfes, Alberto | NTRS | 2007