TY - JOUR
T1 - Probability-Tuned Market-Based Allocations for UAV Swarms Under Unreliable Observations
AU - Xiong, Jing
AU - Li, Jie
AU - Li, Juan
AU - Kang, Senbo
AU - Liu, Chang
AU - Yang, Chengwei
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023/11/1
Y1 - 2023/11/1
N2 - Unmanned aerial vehicle (UAV) swarms are becoming increasingly attractive as highly integrated miniature sensors and processors deliver extraordinary performance. The employment of UAV swarms on complex real-life tasks has motivated exploration on allocation problems involving multiple UAVs, complex constraints, and multiple tasks with coupling relationships. Such problems have been summarized domain independently as multirobot task allocation problems with temporal and ordering constraints (MRTA/TOC). The majority of MRTA/TOC works have hitherto focused on deterministic settings, while their stochastic counterparts are sparsely explored. In this article, allocation problems incorporating classification uncertainty of targets and soft ordering constraints of tasks are considered. To address such problems, a novel market-based allocation algorithm, the probability-tuned market-based allocation (PTMA), is proposed. PTMA consists of iterations between two phases: 1) the first phase updates local perception of global situational awareness and 2) the second phase is a market-based allocation scheme with embedded artificial randomness to locally generate allocation results. Under reasonable assumptions on classification uncertainty, the proposed PTMA algorithm is proven to guarantee a superior performance compared with conventional auctions, verifying the feasibility of using randomness to counter randomness theoretically. Three groups of numerical experiments have been conducted to assess the performance of the proposed PTMA. The first group of experiments compares PTMA with the consensus-based auction algorithm (CBAA), the chance-constrained CBAA, and the PTMA-I (specialization of PTMA with the Identity matrix), on simulated task scenarios with varying degrees of classification uncertainty. The second group evaluates the stability of PTMA. The third group tests the scalability of PTMA on expanded task scenarios. Simulation results demonstrate a satisfactory performance in effectiveness, robustness, stability, and scalability of the proposed PTMA.
AB - Unmanned aerial vehicle (UAV) swarms are becoming increasingly attractive as highly integrated miniature sensors and processors deliver extraordinary performance. The employment of UAV swarms on complex real-life tasks has motivated exploration on allocation problems involving multiple UAVs, complex constraints, and multiple tasks with coupling relationships. Such problems have been summarized domain independently as multirobot task allocation problems with temporal and ordering constraints (MRTA/TOC). The majority of MRTA/TOC works have hitherto focused on deterministic settings, while their stochastic counterparts are sparsely explored. In this article, allocation problems incorporating classification uncertainty of targets and soft ordering constraints of tasks are considered. To address such problems, a novel market-based allocation algorithm, the probability-tuned market-based allocation (PTMA), is proposed. PTMA consists of iterations between two phases: 1) the first phase updates local perception of global situational awareness and 2) the second phase is a market-based allocation scheme with embedded artificial randomness to locally generate allocation results. Under reasonable assumptions on classification uncertainty, the proposed PTMA algorithm is proven to guarantee a superior performance compared with conventional auctions, verifying the feasibility of using randomness to counter randomness theoretically. Three groups of numerical experiments have been conducted to assess the performance of the proposed PTMA. The first group of experiments compares PTMA with the consensus-based auction algorithm (CBAA), the chance-constrained CBAA, and the PTMA-I (specialization of PTMA with the Identity matrix), on simulated task scenarios with varying degrees of classification uncertainty. The second group evaluates the stability of PTMA. The third group tests the scalability of PTMA on expanded task scenarios. Simulation results demonstrate a satisfactory performance in effectiveness, robustness, stability, and scalability of the proposed PTMA.
KW - Market-based algorithm
KW - soft ordering constraints
KW - task allocation
KW - unreliable observations
UR - http://www.scopus.com/inward/record.url?scp=85129413582&partnerID=8YFLogxK
U2 - 10.1109/TCYB.2022.3162907
DO - 10.1109/TCYB.2022.3162907
M3 - Article
C2 - 35476566
AN - SCOPUS:85129413582
SN - 2168-2267
VL - 53
SP - 6803
EP - 6814
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
IS - 11
ER -