Job Analysis Of Automotive Engine Assmbly Line And AGV Path Planning

This thesis sets one large commercial vehicle company’s engine-workshopas the research background, through field research, obtaine the data about presentengine-assembling situation. The thesis analyzes and demonstrates the currentproblems of the assembling line, using the bottleneck segmentation method tomake the corresponding production process optimization and redesign jobscompiled for the assembly line. Analyzes the path of the automated transportequipment——AGV used in assembling line and using the GA algorithm to planthe path of AGV. The following is the main work of this thesis:1）The thesis raises the present problems targeted the operating conditionof the company. In the paper, those problems are analyzed from the whole layoutof the workshop，the running condition of assembling line and service conditionof AGV.2）The paper aims the lack of standardization of assembling line, throughthe bottleneck segmentation method. Meanwhile the author also optimizes thework flow and redesigns the process of production. Comparing with the formerprocess, the new process presented in this paper is much more scientific andefficient.3）Design one new layout of working-storage section by means of SLP,which analyzing the mutual-relationship among components, summarizing partsmutual-relationship chart, comprehensive correlation chart and parts-positionchart.4）AGV path planning.（1）The author analyzes the theory of AGV path planning and introducesthe advanced study from foreign researchers.（2）The thesis analyzes the running environment ofAGV case in the thesisand builds the grid model which benefits the Post-Path Program of AGV.（3）The paper plans the running path of AGV by means of GA algorithm,meanwhile, which also raises the most advanced Detouring Long-distance obstacles subjunctive and Adding middle-nodal method in order to realizenon-obstacles AGV Path Program. Finally, the author also proves the possibilityof the method by means of assimilation of MATLAB.（4）The thesis proves again the possibility of Detouring Long-distanceobstacles subjunctive and Adding middle-nodal method by means of utilizingmuch more advanced continuous Hopfield Neural Network algorithm.Innovation points of this paper:1）The satisfying result is achieved in the paper by means of takingadvantage of mutual-relation sheet of SLP method, comprehensive correlationchart and parts-position chart etc.2）For achieving auto-obstacle avoidance function in the process of AGVPath Program, the paper raises Detouring Long-distance obstacles subjunctiveand Adding middle-nodal method in order to control searching process. Toachieve the AGV path planning of barrier free, simple, reliable and effective.All above methods are not only available in the paper; it also can bepromoted in the similar path program problems.