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.
Task Allocation of Multiple UAVs for Cooperative Parcel Delivery
2017-12-15
12 pages
Article/Chapter (Book)
Electronic Resource
English
Emerald Group Publishing | 2018
|