Research On Application Of Multi-car-on-one-rail Mode In Lane-way-stow-typed Automatic 3D-park

With the development of the Automated Storage and Retrieval System, the traditional model of operation cannot meet the requirement of the storage during a special time. While the many-stoker-one-orbital technology can be used to improve the efficiency of such access.However, in the process of accessing multi-car, the reasonable avoidance should be considered seriously. So that we should set a new method to guarantee its safety, in order to ensure that the customers can get their cars in an acceptable time. In this thesis, via the foundation model of the Lane-way-stow-typed Automatic 3D-Park, the application based on the automatic storage-retrieval garage technology is concluded with the following steps.Summarizing the features of multi-car, the scheduling principle and the scheduling model. Based on analyzing the characteristics of its structure and tasks, the scheduling principle contains four aspects: the proximity principle, the proportionality principle, the satisfaction principle and the VIP principle. By the number of the tasks, this thesis determine the access scheduling model under multi-car situation. The operation model is divided into the single-stacking mode and the double-stacking modes, according to the data of different tasks.At the same time, the double modes can be detailed into two categories: partition-access mode and omnidistance-access mode, which is classified by their differences between their paths.In addition, the collision avoidance plan is put forward. Under multi-car situation, the stokers might meet the problem of route intersection, which could cause the dodge situation.Through studying several types of collision avoidance methods, this thesis has present a reasonable bound-task scheme. The mathematical model of the push mode, the pop mode and the push&pop mode is established, and the program related is designed by Visual C++, which comes with the conclusion that the bound-task scheme is suitable for the Automated Storage and Retrieval System, comparing the results of the working time and social total waiting time from the three cases: single-stacking mode, partition-access mode and omnidistance-access mode. In the next place, optimizing the task list with the idea of the Dymatic Programming.Stocker might be at a standstill during the conversion stage, if simple-task arragement is accept. The Dynamic Programming adjusts the task list and ensures its superiorities, which reduces the time and improves the efficiency.