Font Size: a A A

Simulation Research On Picking Path Planning Of Warehouse Mobile Robot

Posted on:2018-02-10Degree:MasterType:Thesis
Country:ChinaCandidate:C H PanFull Text:PDF
GTID:2348330515483653Subject:Systems Engineering
Abstract/Summary:PDF Full Text Request
Under the background of electronic commerce,warehousing logistics distribution has the characteristics of "variety,small batch,multi batch and short period".With the rapid development of electronic commerce,the customer to improve the level of attention of consumption experience as well as the labor costs rising,the traditional logistics technology has become increasingly difficult to meet the needs of logistics and distribution.The warehouse robot technology based on artificial intelligence technology has been applied to the field of warehousing and logistics,and how to realize the multi warehouse robots in the warehouse with efficient real-time batch picking path planning is an urgent problem to solve.In this paper,a complete set of solutions was presented to solve the problem of how to realize the efficient and real-time path planning in the process of picking operation.First of all,according to the characteristics of logistics warehouse and mobile robot moving to build a flexible warehouse model and realize single robot path planning of single pick point by the modified A* method.Secondly,a mathematical model for the traveling salesman problem(TSP)with the objective of total length of the path optimization was established based on the characteristics of batch picking task.An improved adaptive genetic algorithm was presented to solve the traveling salesman problem(TSP)and then combined with the modified A* algorithm to solve the single robot batch picking path planning.Again,under the premise of considering the single warehouse robot turning time,picking time and waiting time for the traffic conflict,time cost and further improved in order to realize the multi robot path planning of logistics batch picking A* algorithm added time cost was amended to realize the multi warehouse robots in the warehouse with efficient real-time batch picking path planning.Finally,according to the proposed algorithm,a complete simulation system of multi warehouse robots batch picking path planning was established by the visual programming technology of.Net to verify the effectiveness of the proposed algorithm and analyze the influence of multi warehouse robots batch picking time,path length and path conflict coordination effect with the different number of robots on the condition of whether to consider avoiding obstacles.
Keywords/Search Tags:warehouse robot, batch picking, path planning, traveling salesman problem(TSP), genetic algorithm, A* algorithm
PDF Full Text Request
Related items