TY - JOUR
T1 - A Novel Hybrid Auction Algorithm for Multi-UAVs Dynamic Task Assignment
AU - Duan, Xiaojun
AU - Liu, Huiying
AU - Tang, Hong
AU - Cai, Qing
AU - Zhang, Fan
AU - Han, Xiaotian
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2020
Y1 - 2020
N2 - 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 'Two-Stage' 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.
AB - 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 'Two-Stage' 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.
KW - auction algorithm
KW - decision function
KW - dynamic task assignment
KW - Hierarchical decision mechanism
KW - unmanned air vehicle
UR - http://www.scopus.com/inward/record.url?scp=85082977463&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2019.2959327
DO - 10.1109/ACCESS.2019.2959327
M3 - 文章
AN - SCOPUS:85082977463
SN - 2169-3536
VL - 8
SP - 86207
EP - 86222
JO - IEEE Access
JF - IEEE Access
M1 - 8932401
ER -