This paper introduces a grouping and routing problem of multiple agents for cooperative missions. The introduced problem, referred to as the Vehicle Grouping and Routing Problem with Profits, aims to maximize the total reward obtained by conducting a multi-agent mission (e.g., cooperative reconnaissance) while reducing its makespan by appropriately grouping the agents and determining their routes under operational constraints (e.g., fuel, endurance). A mixed-integer linear programming formulation and a conservative column generation-based solution procedure for the problem are proposed. A case study with homogeneous and heterogeneous agents and numerical experiments involving a cooperative reconnaissance mission with multiple unmanned aerial vehicles demonstrate the validity of the proposed formulation and solution procedure.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Multi-Agent Grouping and Routing with Cooperative Tasks


    Beteiligte:
    Choi, Euihyeon (Autor:in) / Ahn, Jaemyung (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    01.03.2025




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    A multi-agent based cooperative approach to scheduling and routing

    Martin, Simon / Ouelhadj, Djamila / Beullens, Patrick et al. | BASE | 2016

    Freier Zugriff

    GROUPING FOR EFFICIENT COOPERATIVE POSITIONING CALCULATIONS

    ERIKSSON OLOF / SVENSSON CHRISTIAN / ADERUM TOBIAS et al. | Europäisches Patentamt | 2020

    Freier Zugriff


    Grouping for efficient cooperative positioning calculations

    ERIKSSON OLOF / SVENSSON CHRISTIAN / ADERUM TOBIAS et al. | Europäisches Patentamt | 2021

    Freier Zugriff

    GROUPING FOR EFFICIENT COOPERATIVE POSITIONING CALCULATIONS

    ERIKSSON OLOF / SVENSSON CHRISTIAN / ADERUM TOBIAS et al. | Europäisches Patentamt | 2023

    Freier Zugriff