| The automatic arrangement of parking spaces in underground parking lots refers to the automatic layout of lanes and parking spaces by reading the parameter information of the underground parking design and the arrangement algorithm.The automatic arrangement can reduce the repetitive design work of architects.At present,there are few researches in this field,and different design standards and specifications have also brought some obstacles to the research of automatic arrangement.Based on the arrangement strategy of modular parking spaces,this paper combined with the classification of cutting and blanking and packing problems,this paper describes the arrangement of underground parking spaces using a constrained two-dimensional complete knapsack problem model.This paper studies the problem of parking spaces in a rectangular area,and gives an upper bound of the rectangular area.This paper refers to the implementation of improved Bottom-Left algorithm and the branch and bound method,adopts a similar arrangement strategy to solve the proposed model.Then this paper proposed a two-stage dynamic planning packing algorithm and the complexity and wasted space of the algorithm.Experimental values show that the two-stage dynamic planning lane layout algorithm proposed in this paper has a better layout effect than the improved Bottom-Left algorithm and branch-and-bound layout algorithm with an acceptable time cost.In this paper,the underground parking lot area is approximately segmented by gridding,and the complex original problem area with holes is divided into multiple sub-areas where the arrangement algorithm can be applied,and a greedy segmentation underground parking space arrangement that satisfies global constraints is proposed algorithm.At the end of this paper,the above algorithm is tested in several real-world scenarios and compared with the corresponding manual solutions. |