Abstract Modified sequential greedy algorithm is proposed to enhance the efficiency of task allocation for cooperative parcel delivery problem of multiple unmanned aerial vehicles (UAVs). The cooperative parcel delivery problem is formulated as an integer programming problem. In view of practical and commercial operation, multiple UAVs should build a team and carry together when the weight of the parcel is greater than the payload limit of a single UAV, and this makes the problem hard to solve. Numerical simulation is conducted to demonstrate the performance of the proposed algorithm comparing with the traditional sequential greedy algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Task Allocation of Multiple UAVs for Cooperative Parcel Delivery


    Contributors:


    Publication date :

    2017-12-15


    Size :

    12 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Morphing Concept for Multirotor UAVs Enabling Stability Augmentation and Multiple-Parcel Delivery

    Cheng, Damian / Charles, Aravinda C. / Srigrarom, Spot et al. | AIAA | 2019


    Morphing Concept for Multirotor UAVs Enabling Stability Augmentation and Multiple-Parcel Delivery

    Cheng, Damian / Charles, Aravinda C. / Srigrarom, Spot et al. | TIBKAT | 2019


    Decentralized task allocation for multiple UAVs with task execution uncertainties *

    Liu, Ruifan / Seo, Minguk / Yan, Binbin et al. | IEEE | 2020


    Integration of UAVs and Public Transportation Vehicles for Parcel Delivery

    Huang, Hailong / Savkin, Andrey V. / Huang, Chao | Wiley | 2022


    Distributed task allocation for multiple heterogeneous UAVs based on consensus algorithm and online cooperative strategy

    Wu, Weinan / Cui, Naigang / Shan, Wenzhao et al. | Emerald Group Publishing | 2018