A symmetrical group-theoretic solution to task assignment

This paper deals with the task assignment for a fleet of unmanned aerial vehicles(UAVs).Task assignment,whose solution is a permutation of all tasks,is the basis of cooperative control of UAVs.In order to find a near-optimal solution in reasonable time,heuristic algorithms are often used.A symmetrical group is used to interpret the search space of task assignment of UAVs.Based on right multiply in symmetrical group,a search neighborhood is generated.Simulation results prove the efficiency of the group-theoretic tabu search algorithm.