Research on Collaborative Task Allocation of Heterogeneous UAVs With Complex Constraints

This paper addresses task allocation to multi-UAV systems in time- and communication-constrained environments by presenting an extension to the novel heuristic performance impact (PI) algorithm. The presented algorithm, termed local reassignment performance impact (LR-PI), consists of an improved task inclusion phase, a novel communication and conflict resolution phase, and a systematic method of reassignment for unallocated tasks. Considering the cooperation in accomplishing tasks that may require multiple UAVs or an individual UAV, the task inclusion phase can build the ordered task list on each UAV with a greedy approach, and the significance value of tasks can be further decreased and conflict-free assignments can be reached eventually. Furthermore, the local reassignment for unallocated tasks focuses on maximizing the number of allocated tasks without conflicts. In particular, the non-ideal communication factors, such as bit error, time delay, and package loss, are integrated with task allocation in the conflict resolution phase, which inevitably exist and can degrade task allocation performance in realistic communication environments. Finally, we show the performance of the proposed algorithm under different communication parameters and verify the superiority in comparison with the PI-MaxAsses and the baseline PI algorithm.

show abstract

Enhancing Unmanned Aerial Vehicle Task Assignment with the Adaptive Sampling-Based Task Rationality Review Algorithm

Sun,

Yao,

Zheng

2024

Drones

View full text Add to dashboard Cite

As the application areas of unmanned aerial vehicles (UAVs) continue to expand, the importance of UAV task allocation becomes increasingly evident. A highly effective and efficient UAV task assignment method can significantly enhance the quality of task completion. However, traditional heuristic algorithms often perform poorly in complex and dynamic environments, and existing auction-based algorithms typically fail to ensure optimal assignment results. Therefore, this paper proposes a more rigorous and comprehensive mathematical model for UAV task assignment. By introducing task path decision variables, we achieve a mathematical description of UAV task paths and propose collaborative action constraints. To balance the benefits and efficiency of task assignment, we introduce a novel method: the Adaptive Sampling-Based Task Rationality Review Algorithm (ASTRRA). In the ASTRRA, to address the issue of high-value tasks being easily overlooked when the sampling probability decreases, we propose an adaptive sampling strategy. This strategy increases the sampling probability of high-value targets, ensuring a balance between computational efficiency and maximizing task value. To handle the coherence issues in UAV task paths, we propose a task review and classification method. This method involves reviewing issues in UAV task paths and conducting classified independent auctions, thereby improving the overall task assignment value. Additionally, to resolve the crossover problems between UAV task paths, we introduce a crossover path exchange strategy, further optimizing the task assignment scheme and enhancing the overall value. Experimental results demonstrate that the ASTRRA exhibits excellent performance across various task scales and dynamic scenarios, showing strong robustness and effectively improving task assignment outcomes.

show abstract

Research on Collaborative Task Allocation of Heterogeneous UAVs With Complex Constraints

Cited by 3 publications

References 40 publications

A Fast Calculation Method for AUV Line Guide Discovery Probability Based on Monte Carlo

A Fast Calculation Method for AUV Line Guide Discovery Probability Based on Monte Carlo

A Distributed Task Allocation Method for Multi-UAV Systems in Communication-Constrained Environments

Enhancing Unmanned Aerial Vehicle Task Assignment with the Adaptive Sampling-Based Task Rationality Review Algorithm

Contact Info

Product

Resources

About