Genetic Algorithm Based C Cigarette Factory AGV Path Planning

With the rapid growth of the domestic economy, companies have been expanding, continuously improve productivity and limit the shortage of land resources; material automation has become the focus of attention of many domestic enterprises. AGV as a modern logistics system organized as part of the focus, and its applications are increasingly widespread, AGV more expensive, if unreasonable, will cause serious waste, AGV routing problem has been the focus of the study, not only good path improve the efficiency of material handling, but also to increase the utilization of AGV, indirect cost savings for businesses. Therefore, this thesis is the study of AGV, its path planning, in order to improve its operational efficiency.This thesis put forward the research background and significance, the domestic and foreign research of AGV path planning development is summarized, and elaborates the related theory of AGV, the path planning algorithm are analyzed, the advantages and disadvantages of the simple comparison of various algorithms, the final choice of the genetic algorithm as the algorithm for AGV path planning.Secondly, a single AGV as the research object, the operation conditions are known, the shortest path as the goal to establish the mathematical model, the use of genetic algorithm for path planning of AGV, and the simulation with MATLAB programming, through the simulation results the feasibility of the algorithm is analyzed.Thirdly, based on the research of path planning for a single AGV, or to avoid the path finding method of short time occupied by parking, path planning based on multi AGV, multi AGV path planning, collision free coordination. Also, the task allocation AGV car vehicle management constraints, to develop a priority criteria, and with reference to the traffic rules traffic rules properly constrained AGV car law, conflict rules of use can not avoid, put forward the strategies to solve the problems, so as to ensure the coordination of multi AGV can run in the system.Finally, the current situation of C factory accessories library were analyzed, the path planning method and practice, through the analysis of production capacity and demand is calculated the number of needed AGV car, and path planning of multi AGV planning method according to the above design and algorithm, and a time for example, for each system car route choice, to analysis the AGV car collision problems that may occur during operation, how to use the rules of planning strategies have been developed to detect the collision problem, how to avoid the collision problem, so as to realize the path planning of multi AGV.Through the research of this thesis, the idea of AGV path planning, especially the application of the genetic algorithm and MATLAB software, combined with the application programming examples will be designed in practice, provides a feasible method of path planning for C delivery system in AGV cigarette factory accessories library, path planning of mobile robot has good practical reference value.