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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-Agent Grouping and Routing with Cooperative Tasks


    Contributors:

    Published in:

    Publication date :

    2025-03-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A multi-agent based cooperative approach to scheduling and routing

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

    Free access

    GROUPING FOR EFFICIENT COOPERATIVE POSITIONING CALCULATIONS

    ERIKSSON OLOF / SVENSSON CHRISTIAN / ADERUM TOBIAS et al. | European Patent Office | 2020

    Free access


    Grouping for efficient cooperative positioning calculations

    ERIKSSON OLOF / SVENSSON CHRISTIAN / ADERUM TOBIAS et al. | European Patent Office | 2021

    Free access

    GROUPING FOR EFFICIENT COOPERATIVE POSITIONING CALCULATIONS

    ERIKSSON OLOF / SVENSSON CHRISTIAN / ADERUM TOBIAS et al. | European Patent Office | 2023

    Free access