2023
DOI: 10.1007/s10846-023-02011-0
|View full text |Cite
|
Sign up to set email alerts
|

A Review of Task Allocation Methods for UAVs

George Marios Skaltsis,
Hyo-Sang Shin,
Antonios Tsourdos

Abstract: Unmanned aerial vehicles, can offer solutions to a lot of problems, making it crucial to research more and improve the task allocation methods used. In this survey, the main approaches used for task allocation in applications involving UAVs are presented as well as the most common applications of UAVs that require the application of task allocation methods. They are followed by the categories of the task allocation algorithms used, with the main focus being on more recent works. Our analysis of these methods f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2024
2024
2025
2025

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 109 publications
0
2
0
Order By: Relevance
“…In regard to multi-drone task allocation, references [24] and [25] provides a detailed survey of the most recent decentralized algorithms. Apart from the distinction in centralized and decentralized approaches, these algorithms may be divided in [25]:…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In regard to multi-drone task allocation, references [24] and [25] provides a detailed survey of the most recent decentralized algorithms. Apart from the distinction in centralized and decentralized approaches, these algorithms may be divided in [25]:…”
Section: Related Workmentioning
confidence: 99%
“…This combination is usually adopted to meet the requirements of a specific application. In particular, game-theoretic approaches for multi-drone task allocation generally [25]: (i) demonstrate greater efficiency with respect to other decentralized approaches, producing suboptimal solutions that are closer to the optimal one; (ii) have comparable or lower complexity with respect to CBBA approaches and are suitable for large-scale systems; (iii) have limited communication burden, especially in the case of competitive algorithms (i.e., using non-cooperative game settings) [29].…”
Section: Related Workmentioning
confidence: 99%