Solving Multi-robot Task Assignment Problem based on Improved Genetic Algorithm

Le résumé fourni par la source

Aiming at the low efficiency of robot task distribution and unbalanced task distribution in the process of warehouse task scheduling, this paper aims at minimum total task path and balanced task distribution, establishes a warehouse robot scheduling scheme and mathematical model, and proposes an improved genetic algorithm for task allocation. Firstly, greedy algorithm is introduced to optimize the initial population and improve the quality of the initial population. Secondly, the heuristic bidirectional triple crossover operator is designed to expand the search range of the population and improve the accuracy of the optimal solution. Finally, the multi-variant strategy is introduced to solve the problem that the algorithm falls into local optimality. The experimental results show that the improved algorithm has better convergence and balanced distribution ability.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.