.png){kind=icon}
Return
A Novel Hybrid Auction Algorithm for Multi-UAVs Dynamic Task Assignment
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2959327.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The auction algorithm is a widely used method for task assignments. However, most existing auction algorithms yield poor performance when applied to multi-UAVs dynamic task assignment. To end this, we propose a novel hybrid & x201C;Two-Stage & x201D; auction algorithm based on the hierarchical decision mechanism and an improved objective function, which simultaneously realizes heterogeneous multi-UAVs dynamic task assignment with limited resources of each UAV and avoidance obstacle path planning. In the first stage, according to the novel proposed hierarchical decision mechanism, we select a task that is urgently needed to be performed in the task group by using the decision function and three attribute values of tasks. After the first stage, it will result in a reasonable auction sequence, instead of random auction sequence as in previous algorithms. In the second stage, by considering the coverage factor and adaptive-limitation penalty term, a novel objective function is proposed and directs related UAVs for auction. In addition, we combine the structural advantages of the centralized and distributed auction algorithm, which greatly promotes its performance in dynamic task assignment. The experimental results demonstrate that the proposed method outperforms many state-of-the-art models in efficiency and robustness.
Keywords:
Task analysis
Heuristic algorithms
Vehicle dynamics
Unmanned aerial vehicles
Linear programming
Resource management
Dynamic scheduling
Hierarchical decision mechanism
unmanned air vehicle
dynamic task assignment
auction algorithm
decision function
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
The Diagnostic Validity of Melancholic Major Depression in a Population-Based Sample of Female Twins
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more