A blockchain bee colony double inhibition labor division algorithm for spatio-temporal coupling task with application to UAV swarm task allocation
Husheng Wu, Hao Li, Xiao Renbin
Abstract
It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks. Using the idea of clustering, after clustering tasks according to spatio-temporal attributes, the clustered groups are linked into task sub-chains according to similarity. Then, based on the correlation between clusters, the child chains are connected to form a task chain. Therefore, the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension. When a sudden task occurs, a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks. Through the above improvements, the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks. In order to reflect the efficiency and applicability of the algorithm, a task allocation model for the unmanned aerial vehicle (UAV) group is constructed, and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed. Task assignment has been constructed. The study uses the self-adjusting characteristics of the bee colony to achieve task allocation. Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance.