Task Allocation Of Warehouse Robots Based On Intelligence Optimization Algorithm

Multi-robot task allocation is a very critical problem for intelligent storagesystem, since it determines the efficiency and cost of the system to complete thetask directly. In order to find good ways for robot task allocation, research workabout this problem is carried out in this paper.Firstly, the thesis introduces the intelligence optimization algorithms and robottask allocation problem. Intelligence optimization algorithms are good at solvingcomplex combination optimization problem which is hard to be solved bytraditional optimization algorithm.Secondly, the thesis describes the mathematical model in detail under theconditions of two definitions and two assumptions, and use integer programmingmethod to solve the small scale problem, and get the optimal solution.Finally, since the integer programming method can’t solve the complexproblem, the genetic algorithm and ant colony algorithm in the intelligenceoptimization algorithms are used to solve the robot task allocation of intelligentwarehouse. The concept of virtual task is used to code the robot task allocationproblem, and evaluation function and genetic operator are also designed speciallyfor the problem. Some examples are used to verify the effect of the geneticalgorithm solving the problem. The thesis introduces the idea of random tasknumber assigned to use ant colony algorithm solving Multi-robot task allocationproblem. The same examples are used for ant colony algorithm to simulate, and theresult is compared with the result of genetic algorithm.Through the simulation result, it has been proved that the genetic algorithmand ant colony algorithm are effective for robot task allocation of intelligentwarehouse.