A Study About Vehicle Routing And Reusing In Plane Garage Decision Support System

The background of this research is from the research project named "Plane Garage Decision Support System". The core problem to solve in this system is how to search optimal path for vehicles quickly and accurately. After gained the optimal path, the vehicles can implement this task according to the planned path.Firstly, this paper studies the path planning algorithm in "Plane Garage Decision Support System", it holds discussions from many-sided in many aspects such as pose space, environment expression, searching methods of path and path safety, then puts forward a very applicable way based on grid method to express environment, and adopts a space saving method using sparse matrix to save environmental information, finally, realizes the shortest path algorithm based on Dijikstra Algorithm to generate route for cars. Secondly, the thesis studies the method to reuse lines which have been generated in "Plane Garage Decision Support System". It proposes a idea to set up a single-machine lines resource pool which is the foundation for reusing route. Two methods are given to reuse the route, one is based on matching environment principle, another one is based on safety path principle. Finally, analysis and design of the system structure and business process are achieved and the proposed algorithm of path generation and method of reusing paths are applied to the developed system.This research does great deeds for guiding actual production in vehicle transporting of plane garage. Research about algorithm of path generation and method of reusing paths generates positive significance in system of vehicle transporting path planning in plane garage.