Lane line generation method, device and equipment

Abstract

The invention relates to the field of buildings, and discloses a lane line generation method, device and equipment, and the method comprises the steps: firstly extracting a region for arranging a vertical lane line after a region where a parking space can be arranged in a building design drawing is recognized, and then updating the region where the parking space can be arranged based on the region of the vertical lane line; based on the updated area where the parking space can be arranged, the area where the horizontal lane line is arranged is extracted, and based on the two areas where the vertical lane line and the horizontal lane line are arranged, corresponding lane lines are arranged. According to the method, the logic of area screening and combination is set to be used in the setting process of the vertical lane line and the horizontal lane line, so that the problems of low arrangement efficiency and low space utilization rate of an existing lane line arrangement scheme are solved.

Description

Technical Field

[0001] The present invention relates to the field of architecture, and particularly to a lane line generation method, apparatus and device thereof. Background Art

[0002] With the development of building design automation, especially in the design of underground parking lots of buildings, in order to maximize the setting of parking spaces, it is first required to determine the distribution of lane lines, and the design of lane lines is a key and difficult point in the design of parking spaces. Especially when there are multiple parking areas in a project, separate lane lines need to be set for each parking area.

[0003] Currently, the layout of lane lines is mainly carried out manually or with the assistance of design software according to factors such as the basement entrance and exit of the project, above-ground buildings, specification requirements and planning control. However, such a method cannot guarantee the maximum utilization of space, and the efficiency is also low. Summary of the Invention

[0004] The main purpose of the present invention is to provide a lane line generation method, apparatus and device thereof, which are used to solve the problems of low layout efficiency and low space utilization rate of the existing lane line layout scheme.

[0005] In the first aspect of the present invention, a lane line generation method is provided. The method includes: obtaining an architectural design drawing of a site to be designed, and extracting a parking space layout area in the architectural design drawing; extracting a coherent area that penetrates the site to be designed in a single direction in the lane layout area, and obtaining a plurality of first candidate areas; combining a plurality of areas belonging to the same direction among the plurality of first candidate areas, and selecting the area with the largest projected coverage area between each pair of areas in the combination as a vertical lane line layout area; updating the parking space layout area based on the vertical lane line layout area, and extracting a coherent area in the horizontal direction from the area other than the vertical lane line layout area, and obtaining a plurality of second candidate areas; combining two adjacent areas among the plurality of second candidate areas, and selecting the area with the largest projected coverage area between each pair of areas in the combination as a horizontal lane line layout area; generating lane lines in the vertical lane line layout area and the horizontal lane line layout area respectively according to the design requirements of lane lines.

[0006] Optionally, the obtaining an architectural design drawing of a site to be designed, and extracting a parking space layout area in the architectural design drawing includes: obtaining an architectural design drawing of a site to be designed input by a designer, and using expert system technology to extract obstacles in the architectural design drawing, where the obstacles include tower areas, ramps, fire prevention zones, columns and entrance and exit areas; drawing a parking space layout area based on the boundaries of the obstacles.

[0007] Optionally, extracting the coherent regions that penetrate the site to be designed in a single direction from the lane layout region, obtaining multiple first candidate regions, includes: using the sides of the tower region and the ramp in the lane layout region as the base sides, constructing a first sub-region that is perpendicular to and connects the base sides; based on the first lane width of the vertical lane line, removing the first sub-regions whose sub-region widths in the layout direction of the vertical lane do not meet the first lane width, obtaining multiple first regions; selecting and combining multiple of the first regions that penetrate the site to be designed in a single direction and are coherent, obtaining multiple first candidate regions.

[0008] Optionally, the removing the first regions whose region widths in the layout direction of the vertical lane do not meet the first lane width based on the first lane width of the vertical lane line includes: based on the lane width of the vertical lane line, avoiding half of the lane width for the boundaries of each of the first regions; calculating the region widths of each of the first regions after avoidance in the layout direction of the vertical lane line, and removing the first regions whose region widths are less than the lane width.

[0009] Optionally, the combining multiple regions of the same orientation among the multiple first candidate regions and selecting the regions with the largest projected coverage area between each pair in the combination as the vertical lane line layout region includes: based on the positional relationship between each of the first candidate regions and the construction rules of a preset directed acyclic graph, constructing a first directed acyclic graph containing all the first candidate regions, where the construction rules of the first directed acyclic graph are that each first candidate region is regarded as a node, and the weight of the edge between every two nodes is the size of the projected coverage area between the parking space layout regions of the two lane lines; based on the preset directed graph, calling a topological sorting method to extract the combination of the longest paths with the largest weight from the first directed acyclic graph, obtaining the vertical lane line layout region.

[0010] Optionally, the updating the parking space layout region based on the vertical lane line layout region and extracting the coherent regions in the horizontal direction from the regions other than the vertical lane line layout region, obtaining multiple second candidate regions, includes: updating the parking space layout region based on the vertical lane line layout region and extracting the unused regions therein; using the vertical lane line layout region as the base, constructing a second sub-region in the unused regions in the direction perpendicular to the vertical lane line layout region; based on the second lane width of the horizontal lane line, removing the second sub-regions whose sub-region widths in the layout direction of the horizontal lane do not meet the second lane width, obtaining multiple second regions; selecting and combining multiple of the second regions that connect two of the vertical lane line layout regions in a single direction and are coherent, obtaining multiple second candidate regions.

[0011] Optionally, combining two adjacent regions among the multiple second candidate regions and arranging the horizontal lane line regions by selecting the region with the largest projected coverage area between every two regions in the combination includes: constructing a second directed acyclic graph containing all the second candidate regions based on the positional relationship between the second candidate regions and the construction rules of a preset directed acyclic graph, where the construction rules of the second directed acyclic graph are that each second candidate region is regarded as a node, and the weight of the edge constructed between every two nodes is the size of the projected coverage area between the parking space arrangement regions of two lane lines; extracting the longest path combination with the largest weight from the second directed acyclic graph based on the preset topological sorting method for directed graphs to obtain the horizontal lane line arrangement regions.

[0012] Optionally, after combining two adjacent regions among the multiple second candidate regions and arranging the horizontal lane line regions by selecting the region with the largest projected coverage area between every two regions in the combination, it further includes: using a preset optimization algorithm to optimize the area or position of the vertical lane line arrangement region and the horizontal lane line arrangement region, where the optimization process is to move the positions of the vertical lane line arrangement region and the horizontal lane line arrangement region without adding or deleting the vertical lane line arrangement region and the horizontal lane line arrangement region.

[0013] The second aspect of the present invention provides a lane line generation device, and the device includes: an acquisition module for acquiring the architectural design drawing of the site to be designed and extracting the parking space arrangement region in the architectural design drawing; a first extraction module for extracting the coherent regions that run through the site to be designed in a single direction in the lane arrangement region to obtain a plurality of first candidate regions; a first combination module for combining multiple regions with the same orientation among the multiple first candidate regions and selecting the region with the largest projected coverage area between every two regions in the combination as the vertical lane line arrangement region; a second extraction module for updating the parking space arrangement region based on the vertical lane line arrangement region and extracting the coherent regions in the horizontal direction from the regions other than the vertical lane line arrangement region to obtain a plurality of second candidate regions; a second combination module for combining two adjacent regions among the multiple second candidate regions and arranging the horizontal lane line regions by selecting the region with the largest projected coverage area between every two regions in the combination; and an arrangement module for generating lane lines in the vertical lane line arrangement region and the horizontal lane line arrangement region respectively according to the design requirements of the lane lines.

[0014] Optionally, the acquisition module includes:

[0015] An acquisition unit, configured to acquire an architectural design drawing of a site to be designed input by a designer, and extract obstacles in the architectural design drawing by using expert system technology, where the obstacles include a tower area, a ramp, a fire compartment, columns, and an entrance and exit area;

[0016] A drawing unit, configured to draw a parking space layout area based on the boundaries of the obstacles.

[0017] Optionally, the first extraction module includes:

[0018] A first extraction unit, configured to construct a first sub-region that is perpendicular to and connected to a base side based on the sides of the tower area and the ramp in the lane layout area;

[0019] A first elimination unit, configured to eliminate first sub-regions whose sub-region widths in the layout direction of the vertical lane do not meet the first lane width based on the first lane width of the vertical lane line, to obtain a plurality of first regions;

[0020] A first selection unit, configured to select a combination of a plurality of the first regions that penetrate the site to be designed and are coherent in a single direction, to obtain a plurality of first candidate regions.

[0021] Optionally, the first elimination unit is specifically configured to: avoid half of the lane width for the boundaries of each of the first regions based on the lane width of the vertical lane line; calculate the region widths of each of the first regions after avoidance in the layout direction of the vertical lane line, and eliminate the first regions whose region widths are less than the lane width.

[0022] Optionally, the first combination module includes:

[0023] A first construction unit, configured to construct a first directed acyclic graph including all the first candidate regions based on the positional relationship between the first candidate regions and the construction rules of a preset directed acyclic graph, where the construction rules of the first directed acyclic graph are that each first candidate region is regarded as a node, and the weight of the edge constructed between every two nodes is the size of the projection coverage area between the parking space layout areas of two lane lines;

[0024] A first combination unit, configured to extract the longest path combination with the largest weight from the first directed acyclic graph based on a preset directed graph call topological sorting method, to obtain the vertical lane line layout area.

[0025] Optionally, the second extraction module includes:

[0026] A second extraction unit, configured to update the parking space layout area based on the vertical lane line layout area and extract the unused area therein; based on the vertical lane line layout area, construct a second sub-area in the unused area in a direction perpendicular to the vertical lane line layout area;

[0027] A second elimination unit, configured to eliminate second sub-areas whose sub-area widths in the layout direction of the horizontal lane do not meet the second lane width based on the second lane width of the horizontal lane, to obtain a plurality of second areas;

[0028] A second selection unit, configured to select and combine a plurality of the second areas that are connected and coherent between two vertical lane line layout areas in a single direction to obtain a plurality of second candidate areas.

[0029] Optionally, the second combination module includes:

[0030] A second construction unit, configured to construct a second directed acyclic graph including all second candidate areas based on the positional relationship between the second candidate areas and the construction rules of a preset directed acyclic graph, wherein the construction rules of the second directed acyclic graph are that each second candidate area is regarded as a node, and the weight of the edge constructed between every two nodes is the size of the projection coverage area between the parking space layout areas of two lane lines;

[0031] A second combination unit, configured to extract the combination of the longest path with the largest weight from the second directed acyclic graph based on a preset directed graph call topological sorting method to obtain the horizontal lane line layout area.

[0032] Optionally, the lane line generation device further includes: an optimization module, configured to:

[0033] Utilize a preset optimization algorithm to perform optimization processing on the area or position of the vertical lane line layout area and the horizontal lane line layout area, wherein the optimization processing is to move the positions of the vertical lane line layout area and the horizontal lane line layout area without adding or deleting the vertical lane line layout area and the horizontal lane line layout area.

[0034] A third aspect of the present invention provides an electronic device, including: a memory and at least one processor, wherein instructions are stored in the memory; the at least one processor calls the instructions in the memory to enable the electronic device to execute the above-mentioned lane line generation method.

[0035] A fourth aspect of the present invention provides a computer-readable storage medium, wherein instructions are stored in the computer-readable storage medium, and when the instructions are run on a computer, the computer is enabled to execute the above-mentioned lane line generation method.

[0036] In the technical solution provided by the present invention, after identifying the area where parking spaces can be arranged in the architectural design drawing, the area for arranging vertical lane lines is first extracted, and then the area where parking spaces can be arranged is updated based on the area of the vertical lane lines. The area for arranging horizontal lane lines is extracted based on the updated area where parking spaces can be arranged, and the corresponding lane lines are arranged based on the two areas of arranging vertical lane lines and arranging horizontal lane lines. Such a method is used in the setting processes of vertical lane lines and horizontal lane lines respectively by setting the logic of area screening and combination to solve the problems of low arrangement efficiency and low space utilization rate of the existing lane line arrangement scheme. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 FIG. 1 is a schematic diagram of an embodiment of the lane line generation method provided by an embodiment of the present invention;

[0038] Figure 2 FIG. 2 is a schematic diagram of another embodiment of the lane line generation method provided by an embodiment of the present invention;

[0039] Figure 3 FIG. 3 is a schematic diagram of an area distribution after field area screening provided by an embodiment of the present invention;

[0040] Figure 4 FIG. 4 is a schematic diagram of an optional area of the vertical lane line provided by an embodiment of the present invention;

[0041] Figure 5 FIG. 5 is a schematic diagram of the area after area combination based on Figure 4 ;

[0042] Figure 6 FIG. 6 is a schematic diagram of another area distribution after field area screening provided by an embodiment of the present invention;

[0043] Figure 7 FIG. 7 is a schematic diagram of an area of an optional area of the horizontal lane line provided by an embodiment of the present invention;

[0044] Figure 8 FIG. 8 is a schematic diagram of the area after area combination based on Figure 7 ;

[0045] Figure 9 FIG. 9 is a schematic diagram of the optimization of the vertical lane line arrangement area and the horizontal lane line arrangement area provided by an embodiment of the present invention;

[0046] Figure 10 FIG. 10 is a schematic diagram of an embodiment of the lane line generation device provided by an embodiment of the present invention;

[0047] Figure 11 FIG. 11 is a schematic diagram of another embodiment of the lane line generation device provided by an embodiment of the present invention;

[0048] Figure 12 Schematic diagram of an embodiment of the electronic device provided by an embodiment of the present invention. Detailed implementation manners

[0049] An embodiment of the present invention provides a lane line generation method, its device, and equipment. By setting the logic of area screening and combination and invoking it in vertical lane lines and horizontal lane lines, this method not only simplifies the lane line layout process but also improves the layout efficiency and space utilization rate.

[0050] The terms "first", "second", "third", "fourth", etc. (if any) in the description and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects and do not necessarily need to describe a specific order or sequence. It should be understood that such data can be interchanged under appropriate circumstances so that the embodiments described here can be implemented in an order other than those illustrated or described here. In addition, the terms "comprising" or "having" and any variation thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or equipment that includes a series of steps or units does not necessarily have to be limited to those clearly listed steps or units, but may include other steps or units not clearly listed or inherent to these processes, methods, products, or equipment.

[0051] For ease of understanding, the following describes the specific process of an embodiment of the present invention. It can be understood that the execution subject of the present invention can be a lane line generation device, or a terminal or a server, and specifically is not limited here. An embodiment of the present invention is described by taking the server as the execution subject as an example.

[0052] Please refer to Figure 1 , an embodiment of the lane line generation method in an embodiment of the present invention includes:

[0053] 101. Obtain the architectural design drawing of the site to be designed, and extract the parking space layout area in the architectural design drawing.

[0054] In this embodiment, a two-dimensional or three-dimensional architectural model input by the user is received in software such as CAD, the architectural model is parsed to obtain the architectural design drawing, and the parking lot design drawing therein is extracted.

[0055] Using technologies such as BIM, identify the architectural markings in the parking lot design drawing, so as to obtain the architectural information where parking spaces cannot be arranged, that is, the positions and outlines of obstacles, such as the outlines and position information of towers, columns, fire prevention zones, intersections, etc.

[0056] Based on the architectural information and the preset boundary avoidance rules, draw the empty areas in the parking lot, that is, the parking space layout areas where parking spaces may be set.

[0057] It is understandable that when drawing the parking space layout area, specifically after avoiding the outflow safety passage, the area under each corner contour is matched based on the size of a single parking space, and the areas where parking spaces can be set but do not meet the design requirements are excluded to obtain the parking space layout area, which includes the vertical lane line layout area, the horizontal lane line layout area, and the area set of parking positions.

[0058] 102. Extract the coherent areas that run through the site to be designed in a single direction in the lane layout area to obtain multiple first candidate areas.

[0059] In this embodiment, the first candidate area refers to the area where vertical lane lines can be arranged. This area is the area where vertical lane lines can be arranged in a single direction. The vertical lane line is defined as the lane that undertakes the main road in the parking lot, and its arrangement direction can be set based on the positions of the exits and entrances in the parking lot. Of course, it can also be set in combination with the length and width of the parking lot and the main distribution positions of the parking positions.

[0060] Specifically, the principle for extracting the first candidate area is to select, in the lane layout area, the partial area whose width meets the width requirement of the main road and can be linearly interspersed therein as the first candidate area. That is, select, from the parking space layout area, the area that is continuous in a single direction and is not separated by obstacles to cause turning as the first candidate area.

[0061] 103. Combine the multiple areas belonging to the same orientation among the multiple first candidate areas, and select the area with the largest projected coverage area between each pair of areas in the combination as the vertical lane line layout area.

[0062] It should be noted that the multiple first candidate areas are arranged in parallel in one orientation. There are multiple small areas where horizontal lane lines can be arranged between two adjacent first candidate areas in the position sorting. These small areas are formed by the separation of the first candidate areas.

[0063] Take two adjacent first candidate areas as a combination, and at the same time, it is also necessary to consider that they are in the same direction. For example, if the first candidate areas are along the east-west direction, then select adjacent two combinations from all the first candidate areas in the east-west direction. Then calculate the number and area of the small areas sandwiched in each combination, as well as the length of each lane with a larger number and area of small areas in the combination. Finally, select the area of the longest pair of combinations as the vertical lane line layout area.

[0064] In practical applications, the setting of the vertical lane lines should follow the principle of having the fewest turns or even no turns. Select the first candidate area from the combinations that meet this principle, and then combine the selected first candidate areas to select the position with the largest parking area sandwiched between the two first candidate areas when setting the vertical lane lines as the vertical lane line layout area.

[0065] 104. Update the parking space layout area based on the vertical lane line layout area, and extract the horizontally coherent areas from the areas other than the vertical lane line layout area to obtain multiple second candidate areas.

[0066] It can be understood that after the extraction and layout of the vertical lane line layout area are completed, updating the vertical lane line layout area to the parking space layout area is the parking space layout area obtained in step 101. So that the vertical lane line layout area is marked in the parking space layout area. In the updated parking space layout area, use the layout rule of the horizontal lane lines to extract the second candidate areas. The layout rule of the horizontal lane lines is the same as the selection principle of the above first candidate areas. The difference is that the second candidate areas are extracted based on the vertical lane line layout area, that is, multiple horizontal lane line layout areas are divided in the parking space layout area between two vertical lane line layout areas. The size of this layout area includes the size of the parking spaces and the horizontal lane lines, and the other processing logics are the same.

[0067] 105. Combine two adjacent areas among the multiple second candidate areas, and select the horizontal lane line layout area with the largest projected coverage area between each pair of areas in the combination.

[0068] In this step, after extracting multiple second candidate areas, identify and combine each pair of the second candidate areas, remove duplicates, calculate the projected coverage area between each pair of areas, and select the one with the largest area as the horizontal lane line layout area.

[0069] 106. Generate lane lines in the vertical lane line layout area and the horizontal lane line layout area respectively according to the design requirements of the lane lines.

[0070] It should be noted that the vertical lane line layout area includes a turning area and a straight area. Identify whether the straight area in the vertical lane line layout area runs through the entire vertical lane line layout area. If it does, select the area based on the principle of the fewest turns, and then arrange the vertical lane lines on the selected area or the straight area that can run through the entire vertical lane line layout area. The same applies to the layout of the horizontal lane lines.

[0071] In an embodiment of the present invention, by obtaining the architectural design drawing of the site to be designed and extracting the parking space layout area in the architectural design drawing; extracting the coherent areas that run through the site to be designed in a single direction in the lane layout area to obtain a plurality of first candidate areas; combining the areas belonging to the same orientation among the plurality of first candidate areas, and selecting the area with the largest projected coverage area between each pair of areas in the combination as the vertical lane line layout area; updating the parking space layout area based on the vertical lane line layout area, and extracting the coherent areas in the horizontal direction from the areas other than the vertical lane line layout area to obtain a plurality of second candidate areas; combining two adjacent areas among the plurality of second candidate areas, and selecting the area with the largest projected coverage area between each pair of areas in the combination as the horizontal lane line layout area; generating lane lines in the vertical lane line layout area and the horizontal lane line layout area respectively according to the design requirements of the lane lines. By setting the logic of area screening and combination and calling it in the vertical lane line and the horizontal lane line, this method not only simplifies the lane line layout process, but also improves the layout efficiency and the utilization rate of space.

[0072] Please refer to Figure 2 , another embodiment of the lane line generation method in the embodiment of the present invention. This embodiment realizes the program substitution of traditional design experience and the automation of the vehicle flow line design in the parking garage through modules such as field area screening, available position acquisition for vertical lane lines, and optimal combination acquisition. In addition, this method encapsulates methods such as combinatorial graph theory and computational geometry into decision-making modules, and realizes unified call in their respective task scenarios in the generation problems of vertical lane lines and horizontal lane lines, improving the maintainability of functions in the architecture.

[0073] It should be noted that this method runs based on BIM (Building Information Modeling) software. BIM software directly processes based on building components as basic primitives, so it can better carry the information calculated in the present invention and directly reflect it to the designers. Specifically, this method can be understood as consisting of seven steps: field area screening, available position acquisition for vertical lane lines, combination decision for vertical lane lines, field area screening update, available position acquisition for horizontal lane lines, combination decision for horizontal lane lines, and post-processing of lane lines. Among them, available position acquisition and combination decision constitute a decision-making module, which will be called in different task scenarios later. The specific implementation steps are as follows:

[0074] 201. Field area screening.

[0075] In this embodiment, first, obtain the architectural design drawing of the site to be designed input by the designer, and use expert system technology to extract the obstacles in the architectural design drawing, where the obstacles include tower areas, ramps, fire compartments, columns, and entrance and exit areas; draw the parking space layout area based on the boundaries of the obstacles. Specifically, obtain the geometric information of the site and the layout information of the existing buildings through BIM software, and determine key parameters such as the boundaries of the site, the positions of the towers, and the positions of the entrances and exits. This expert system technology can be image recognition technology, or an obstacle recognition model obtained through pre-training, etc.

[0076] Then, screen out the vertical lane line layout area in the parking space layout area, which includes two steps: extraction and combination of the first candidate areas. Specifically:

[0077] Extract the coherent areas that run through the site to be designed in a single direction in the lane layout area to obtain a plurality of first candidate areas;

[0078] Combine multiple areas with the same orientation among the multiple first candidate areas, and select the area with the largest projected coverage area between each pair of areas in the combination as the vertical lane line layout area.

[0079] In another embodiment, the step of extracting the coherent areas that run through the site to be designed in a single direction in the lane layout area to obtain a plurality of first candidate areas includes:

[0080] Based on the sides of the tower areas and ramps in the lane layout area as the base sides, construct first sub-areas that are perpendicular to and connect the base sides;

[0081] Based on the first lane width of the vertical lane line, eliminate the first sub-areas whose sub-area widths in the layout direction of the vertical lane do not meet the first lane width to obtain a plurality of first areas;

[0082] Select and combine multiple first areas that run through the site to be designed in a single direction and are coherent to obtain a plurality of first candidate areas.

[0083] Among them, the step of eliminating the first areas whose sub-area widths in the layout direction of the vertical lane do not meet the first lane width based on the first lane width of the vertical lane line includes:

[0084] Based on the lane width of the vertical lane line, avoid half of the lane width for the boundaries of each first area;

[0085] Calculate the sub-area widths in the layout direction of the vertical lane line for each of the first areas after avoidance, and eliminate the first areas whose sub-area widths are less than the lane width.

[0086] That is, based on the existing information of obstacles such as the underground area of the main building, boundaries, and ramps on the site, determine the area where the vertical lane lines can be located. This area needs to meet two conditions. First, it is the area vertically connecting the side of the tower. Since the vertical lane lines usually undertake the main traffic function, they are usually located in the side areas of the tower area, ramps, etc. Second, it does not occupy the main horizontal lane line area and reserves space for the subsequent layout of horizontal lane lines. Finally, the first candidate area is obtained, as shown in Figure 3 as shown.

[0087] 202. Obtaining the area where vertical lane lines can be arranged.

[0088] Specifically, based on the positional relationship between each of the first candidate areas and the construction rules of a preset directed acyclic graph, construct a first directed acyclic graph containing all the first candidate areas. Among them, the construction rule of the first directed acyclic graph is that each first candidate area is regarded as a node, and the weight of the edge constructed between every two nodes is the size of the projected coverage area between the parking space layout areas of the two lane lines;

[0089] Based on the preset directed graph, call the topological sorting method to extract the longest path combination with the largest weight from the first directed acyclic graph to obtain the area for arranging vertical lane lines.

[0090] It can be understood that based on the first candidate area obtained above, obtain all the optional areas where vertical lane lines can be located. Refer to Figure 4 , since the center line of the vertical lane that needs to be drawn due to the function needs to meet the requirement of arranging a complete lane width, it is necessary to make left - right avoidance with the first candidate area. The avoidance relationship is as follows:

[0091] 1. For an area with a width < lane width W, there is no optional position for vertical lane lines;

[0092] 2. For an area with a width >= lane width W & < lane width W + 2 * vertical parking space depth D, there are only two optional positions for vertical lane lines on the two sides, that is, the positions where the inner retreat is 1 / 2 lane width on both the left and right sides;

[0093] 3. For an area with a width >= lane width W + 2 * vertical parking space depth, there are four optional positions for vertical lane lines, that is, (the positions where the inner retreat is 1 / 2 lane width on both sides) + (the positions where the inner retreat is 1 / 2 lane width + vertical parking space depth on both sides).

[0094] 203. Decision - making on the combination of vertical lane line areas.

[0095] After obtaining the optional areas of multiple vertically arrangeable lane lines, the optional areas of the multiple vertically arranged lane lines are rearranged and combined. The optional areas and the relationships between them are constructed into a first directed acyclic graph. The principle of graph construction is as follows: each optional position is regarded as a node, and the weight of the edge between every two nodes is the area size between the arrangeable positions of the two lane lines. Then, based on the directed graph, a topological sorting method is called to obtain the combination of the longest path with the largest weight. After restoring the point-edge relationship to the graph surface, refer to Figure 5 to obtain the combination of vertically arranged lane line areas with the largest available space area.

[0096] After completing the arrangement of the optional areas of the vertically arranged lane lines and the combination of the optional areas, a method for obtaining the largest available area between the areas is based on the area positions. In the task of vertically arranged lane lines, a single decision needs to be made based on the entire site, that is, taking the entire project as the boundary, obtaining the globally arrangeable positions, converting them into graph relationships, and solving them through algorithms. In fact, this method can solve the problem of maximizing the available area between lines within any boundary conditions. The following will describe the situation of calling this method multiple times to solve the problem of horizontal lane line arrangement after the boundary conditions change.

[0097] 204. Screening and updating of the site area.

[0098] That is, the parking space arrangement area is updated based on the vertically arranged lane line arrangement area. Before arranging the horizontal lane lines, it is necessary to re-identify the site area based on the combination of the vertically arranged lane line areas. After the vertically arranged lane line area cuts the site, multiple areas for arranging the horizontal lane lines can be divided according to the cutting results. Refer to Figure 6 . And these areas form the boundary conditions for the subsequent execution decision-making module.

[0099] 205. Obtaining the arrangeable areas of the horizontal lane lines.

[0100] Specifically, continuous areas in the horizontal direction are extracted from the areas other than the vertically arranged lane line arrangement areas to obtain multiple second candidate areas.

[0101] It should be noted that the parking space arrangement area is updated based on the vertically arranged lane line arrangement area, and the unused areas are extracted from it;

[0102] Based on the vertically arranged lane line arrangement area, a second sub-area is constructed in the unused area in the direction perpendicular to the vertically arranged lane line arrangement area;

[0103] Based on the second lane width of the horizontal lane line, the second sub-areas with the sub-area width in the arrangement direction of the horizontal lane not meeting the second lane width are excluded to obtain multiple second areas;

[0104] Select and combine multiple of the second regions that are connected in a single direction between the two vertical lane line arrangement regions and are coherent to obtain multiple second candidate regions.

[0105] This step is actually similar to the rule for obtaining the optional positions of vertical lane lines. Since a complete lane line needs to be placed in the vertical direction, it is necessary to compare in the up and down directions with areas such as tower regions and ramps. Refer to Figure 7 .

[0106] 206. Horizontal lane line area combination decision.

[0107] It should be noted that similar to the vertical lane line area combination decision rule, the available areas between horizontal lane line areas can be referred to Figure 8 , which refers to the space on both sides of the lane line that can be used for arranging parking spaces and includes avoiding obstacles such as walls and rooms to accurately describe the number of parking spaces that can be arranged between the lane lines. After the graph transformation, the methods of topological sorting and maximum weight path are still called to obtain the horizontal lane line area combination scheme that maximizes the use of space.

[0108] In practical applications, based on the positional relationship between the second candidate regions and the construction rules of a preset directed acyclic graph, a second directed acyclic graph including all the second candidate regions is constructed, where the construction rule of the second directed acyclic graph is that each second candidate region is regarded as a node, and the weight of the edge constructed between every two nodes is the size of the projected coverage area between the parking space arrangement regions of two lane lines;

[0109] Based on the preset directed graph, call the topological sorting method to extract the longest path combination with the largest weight from the second directed acyclic graph to obtain the horizontal lane line arrangement region.

[0110] It can be understood that the difference between the combination decision of the horizontal lane line area and the vertical lane line combination decision is that in the combination decision of the horizontal lane line, the call of the decision module is carried out concurrently in multiple regions. Since the vertical lane lines divide the site, multiple regions can independently complete the decision-making process of maximizing the available space of the horizontal lane lines inside them.

[0111] 207. Optimize the vertical lane line arrangement region and the horizontal lane line arrangement region.

[0112] Specifically, use a preset optimization algorithm to optimize the area or position of the vertical lane line arrangement region and the horizontal lane line arrangement region, where the optimization process is to move the positions of the vertical lane line arrangement region and the horizontal lane line arrangement region without adding or deleting the vertical lane line arrangement region and the horizontal lane line arrangement region.

[0113] That is, based on the previous steps, the main lane lines in the project, including horizontal lane lines and vertical lane lines, have been completed. The lane line post-processing fine-tunes on the basis of the main vehicle flow lines. On the premise that the available space is still maximized, the vehicle flow line design is made more in line with the design experience. It should be noted that this fine-tuning refers to the fine-tuning without adding or deleting lane lines, that is, adjusting the arrangement positions of the lane lines. The lane line post-processing specifically includes: supplementing the ramp exit lane lines, aligning the lane lines at intersections, trimming some dead-end roads, etc.

[0114] So far, the vehicle flow line design of the parking garage has been completed, achieving a layout that maximizes the available space and providing a good design basis for subsequent design steps such as parking space layout. Refer to the vehicle flow line design result Figure 9 。

[0115] In the embodiment of the present invention, after identifying the area where parking spaces can be arranged in the architectural design drawing, first extract the area for arranging vertical lane lines, then update the area where parking spaces can be arranged based on the area of the vertical lane lines, extract the area for arranging horizontal lane lines based on the updated area where parking spaces can be arranged, and arrange the corresponding lane lines based on the two areas of arranging vertical lane lines and arranging horizontal lane lines. Such a method is used in the setting processes of vertical lane lines and horizontal lane lines respectively by setting the logic of area screening and combination to solve the problems of low arrangement efficiency and low space utilization rate of the existing lane line arrangement scheme.

[0116] The method for generating lane lines in the embodiment of the present invention has been described above. Next, the lane line generating device in the embodiment of the present invention will be described. Please refer to Figure 9 , an embodiment of the lane line generating device in the embodiment of the present invention. The device includes:

[0117] An acquisition module 910, configured to acquire an architectural design drawing of a site to be designed and extract the parking space arrangement area in the architectural design drawing;

[0118] A first extraction module 920, configured to extract the coherent areas that run through the site to be designed in a single direction in the lane arrangement area to obtain a plurality of first candidate areas;

[0119] A first combination module 930, configured to combine a plurality of areas belonging to the same orientation among the plurality of first candidate areas, and use the area with the largest projected coverage area between every two selected areas in the combination as the vertical lane line arrangement area;

[0120] A second extraction module 940, configured to update the parking space arrangement area based on the vertical lane line arrangement area, and extract the coherent areas in the horizontal direction from the areas other than the vertical lane line arrangement area to obtain a plurality of second candidate areas;

[0121] The second combination module 950 is used to combine two adjacent regions among the multiple second candidate regions, and arrange the horizontal lane line layout regions according to the regions with the largest projected coverage area between each pair of regions in the combination.

[0122] The layout module 960 is used to generate lane lines in the vertical lane line layout region and the horizontal lane line layout region respectively according to the design requirements of the lane lines.

[0123] In this embodiment, by obtaining the architectural design drawing of the site to be designed and extracting the parking space layout region in the architectural design drawing; extracting the continuous regions that run through the site to be designed in a single direction in the lane layout region to obtain a plurality of first candidate regions; combining the multiple regions with the same orientation among the multiple first candidate regions, and using the region with the largest projected coverage area between each pair of regions in the combination as the vertical lane line layout region; updating the parking space layout region based on the vertical lane line layout region, and extracting the continuous regions in the horizontal direction from the regions other than the vertical lane line layout region to obtain a plurality of second candidate regions; combining two adjacent regions among the multiple second candidate regions, and arranging the horizontal lane line layout regions according to the regions with the largest projected coverage area between each pair of regions in the combination; generating lane lines in the vertical lane line layout region and the horizontal lane line layout region respectively according to the design requirements of the lane lines. By setting the logic of region screening and combination and calling it in the vertical lane lines and horizontal lane lines, this method not only simplifies the lane line layout process, but also improves the layout efficiency and the utilization rate of space.

[0124] Please refer to Figure 10 , another embodiment of the lane line generation device in the embodiment of the present invention. The device includes:

[0125] The acquisition module 910 is used to obtain the architectural design drawing of the site to be designed and extract the parking space layout region in the architectural design drawing.

[0126] The first extraction module 920 is used to extract the continuous regions that run through the site to be designed in a single direction in the lane layout region to obtain a plurality of first candidate regions.

[0127] The first combination module 930 is used to combine the multiple regions with the same orientation among the multiple first candidate regions, and use the region with the largest projected coverage area between each pair of regions in the combination as the vertical lane line layout region.

[0128] The second extraction module 940 is used to update the parking space layout region based on the vertical lane line layout region, and extract the continuous regions in the horizontal direction from the regions other than the vertical lane line layout region to obtain a plurality of second candidate regions.

[0129] A second combination module 950, configured to combine two adjacent regions among the multiple second candidate regions, and arrange horizontal lane line layout regions according to the regions with the largest projected coverage area between each pair of regions in the combination.

[0130] An arrangement module 960, configured to generate lane lines in the vertical lane line layout region and the horizontal lane line layout region respectively according to the design requirements of the lane lines.

[0131] Optionally, the obtaining module 910 includes:

[0132] An obtaining unit 911, configured to obtain an architectural design drawing of a site to be designed input by a designer, and extract obstacles in the architectural design drawing by using expert system technology, where the obstacles include tower regions, ramps, fire prevention zones, columns, and entrance and exit regions.

[0133] A drawing unit 912, configured to draw a parking space layout region based on the boundaries of the obstacles.

[0134] Optionally, the first extraction module 920 includes:

[0135] A first extraction unit 921, configured to construct a first sub-region that is perpendicular to and connected to the base sides, with the sides of the tower regions and ramps in the lane layout region as the base sides.

[0136] A first elimination unit 922, configured to eliminate first sub-regions with a sub-region width in the layout direction of the vertical lane that does not meet the first lane width based on the first lane width of the vertical lane line, to obtain a plurality of first regions.

[0137] A first selection unit 923, configured to select and combine a plurality of the first regions that penetrate the site to be designed and are coherent in a single direction to obtain a plurality of first candidate regions.

[0138] Optionally, the first elimination unit 922 is specifically configured to: avoid half of the lane width for the boundaries of each of the first regions based on the lane width of the vertical lane line; calculate the region width in the layout direction of the vertical lane line for each of the first regions after avoidance, and eliminate the first regions with a region width less than the lane width.

[0139] Optionally, the first combination module 930 includes:

[0140] The first construction unit 931 is configured to construct a first directed acyclic graph including all the first candidate regions based on the positional relationship between the first candidate regions and the construction rules of a preset directed acyclic graph. The construction rules of the first directed acyclic graph are that each first candidate region is regarded as a node, and the weight of the edge between every two nodes is the size of the projected coverage area between the parking space layout regions of two lane lines;

[0141] The first combination unit 932 is configured to extract the longest path combination with the largest weight from the first directed acyclic graph based on the preset directed graph calling topological sorting method to obtain the vertical lane line layout region.

[0142] Optionally, the second extraction module 940 includes:

[0143] The second extraction unit 941 is configured to update the parking space layout region based on the vertical lane line layout region and extract the unused regions therein; based on the vertical lane line layout region, construct a second sub-region in the unused regions in the direction perpendicular to the vertical lane line layout region;

[0144] The second elimination unit 942 is configured to eliminate the second sub-regions whose sub-region widths in the layout direction of the horizontal lane do not meet the second lane width based on the second lane width of the horizontal lane line to obtain a plurality of second regions;

[0145] The second selection unit 943 is configured to select and combine a plurality of the second regions that are connected and coherent between two vertical lane line layout regions in a single direction to obtain a plurality of second candidate regions.

[0146] Optionally, the second combination module 950 includes:

[0147] The second construction unit 951 is configured to construct a second directed acyclic graph including all the second candidate regions based on the positional relationship between the second candidate regions and the construction rules of a preset directed acyclic graph. The construction rules of the second directed acyclic graph are that each second candidate region is regarded as a node, and the weight of the edge between every two nodes is the size of the projected coverage area between the parking space layout regions of two lane lines;

[0148] The second combination unit 952 is configured to extract the longest path combination with the largest weight from the second directed acyclic graph based on the preset directed graph calling topological sorting method to obtain the horizontal lane line layout region.

[0149] Optionally, the lane line generating device further includes an optimization module 970, which is configured to:

[0150] Using a preset optimization algorithm, optimize the area or position of the vertical lane line arrangement area and the horizontal lane line arrangement area, where the optimization process is to move the positions of the vertical lane line arrangement area and the horizontal lane line arrangement area without adding or deleting the vertical lane line arrangement area and the horizontal lane line arrangement area.

[0151] In an embodiment of the present invention, after identifying the area where parking spaces can be arranged in the architectural design drawing, first extract the area for arranging vertical lane lines, then update the area where parking spaces can be arranged based on the area of the vertical lane lines, extract the area for arranging horizontal lane lines based on the updated area where parking spaces can be arranged, and arrange the corresponding lane lines based on the two areas of arranging vertical lane lines and arranging horizontal lane lines. Such a method is used in the setting processes of vertical lane lines and horizontal lane lines respectively by setting the logic of area screening and combination to solve the problems of low arrangement efficiency and low space utilization rate of the existing lane line arrangement scheme.

[0152] Above Figure 10 And 11 The lane line generation device in the embodiment of the present invention is described in detail from the perspective of modular functional entities. Next, an electronic device in the embodiment of the present invention is described in detail from the perspective of hardware processing.

[0153] See Figure 12 As shown, the electronic device includes a processor 1200 and a memory 1201. The memory 1201 stores machine-executable instructions that can be executed by the processor 1200, and the processor 1200 executes the machine-executable instructions to implement the above-mentioned lane line generation method.

[0154] Furthermore, Figure 12 The shown electronic device further includes a bus 1202 and a communication interface 1203. The processor 1200, the communication interface 1203, and the memory 1201 are connected through the bus 1202.

[0155] Among them, the memory 1201 may include a high-speed random access memory (Random Access Memory, RAM), and may also include a non-volatile memory, for example, at least one disk memory. Through at least one communication interface 1203 (which can be wired or wireless), a communication connection between the system network element and at least one other network element is realized, and the Internet, wide area network, local area network, metropolitan area network, etc. can be used. The bus 1202 can be an ISA bus, a PCI bus, an EISA bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For the convenience of representation, Figure 12It is represented only by a bidirectional arrow, but it does not mean that there is only one bus or one type of bus.

[0156] The processor 1200 may be an integrated circuit chip with the ability to process signals. In the implementation process, each step of the above method can be completed by the integrated logic circuit in the hardware of the processor 1200 or the instructions in the form of software. The above-mentioned processor 1200 may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. It can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present disclosure. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present disclosure can be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor. The software module may be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. This storage medium is located in the memory 1201, and the processor 1200 reads the information in the memory 1201 and combines its hardware to complete the method steps of the foregoing embodiments.

[0157] The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When the instructions run on a computer, the computer is caused to execute the steps of the lane line generation method.

[0158] Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the foregoing method embodiments, and will not be described herein again.

[0159] When the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The foregoing storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs.

[0160] As described above, the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments or perform equivalent replacements for some of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A lane line generation method, characterized in that, The method includes: Obtain the architectural design drawing of the site to be designed, and extract the parking space layout area in the architectural design drawing; Extract the continuous areas in the lane layout area that run through the site to be designed in a single direction to obtain multiple first candidate areas; Combine multiple areas with the same orientation among the multiple first candidate areas, and select the area with the largest projected coverage area between each pair of areas in the combination as the vertical lane line layout area; Update the parking space layout area based on the vertical lane line layout area, and extract the continuous areas in the horizontal direction from the areas other than the vertical lane line layout area to obtain multiple second candidate areas; Combine two adjacent areas among the multiple second candidate areas, and select the area with the largest projected coverage area between each pair of areas in the combination as the horizontal lane line layout area; Generate lane lines in the vertical lane line layout area and the horizontal lane line layout area respectively according to the design requirements of the lane lines.

2. The lane line generation method according to claim 1, characterized in that The obtaining of the architectural design drawing of the site to be designed and the extraction of the parking space layout area in the architectural design drawing include: Obtain the architectural design drawing of the site to be designed input by the designer, and use expert system technology to extract the obstacles in the architectural design drawing, where the obstacles include tower areas, ramps, fire prevention zones, columns, and entrance and exit areas; Draw the parking space layout area based on the boundaries of the obstacles.

3. The lane line generation method according to claim 1, wherein The extraction of the continuous areas in the lane layout area that run through the site to be designed in a single direction to obtain multiple first candidate areas includes: Take the sides of the tower areas and ramps in the lane layout area as the base sides, and construct a first sub-area that is perpendicular to and connects the base sides; Based on the first lane width of the vertical lane line, eliminate the first sub-areas whose sub-area widths in the layout direction of the vertical lane do not meet the first lane width to obtain multiple first areas; Select and combine multiple first areas that run through the site to be designed in a single direction and are continuous to obtain multiple first candidate areas.

4. The lane line generation method according to claim 3, wherein The eliminating of the first areas whose area widths in the layout direction of the vertical lane do not meet the first lane width based on the first lane width of the vertical lane line includes: Based on the lane width of the vertical lane line, avoid half of the lane width for the boundaries of each first area; Calculate the area width of each first area after avoidance in the layout direction of the vertical lane line, and eliminate the first areas whose area width is less than the lane width.

5. The lane line generation method according to claim 4, wherein, The combining of multiple areas with the same orientation among the multiple first candidate areas and the selection of the area with the largest projected coverage area between each pair of areas in the combination as the vertical lane line layout area includes: Based on the positional relationship between each first candidate area and the construction rules of a preset directed acyclic graph, construct a first directed acyclic graph including all first candidate areas, where the construction rule of the first directed acyclic graph is that each first candidate area is regarded as a node, and the weight of the edge between every two nodes is the size of the projected coverage area between the parking space layout areas of the two lane lines; Based on a preset directed graph, call a topological sorting method to extract the longest path combination with the largest weight from the first directed acyclic graph, and obtain the vertical lane line arrangement area.

6. The lane line generation method according to any one of claims 1-5, characterized in that, Update the parking space arrangement area based on the vertical lane line arrangement area, and extract continuous areas in the horizontal direction from the area other than the vertical lane line arrangement area to obtain multiple second candidate areas, including: Update the parking space arrangement area based on the vertical lane line arrangement area, and extract the unused area therein; Based on the vertical lane line arrangement area, construct a second sub-area in the unused area in the direction perpendicular to the vertical lane line arrangement area; Based on the second lane width of the horizontal lane, eliminate the second sub-areas whose sub-area widths in the arrangement direction of the horizontal lane do not meet the second lane width, and obtain multiple second areas; Select multiple second areas that are connected in a single direction and continuous between the two vertical lane line arrangement areas for combination to obtain multiple second candidate areas.

7. The lane line generation method according to claim 6, wherein Combining two adjacent areas among the multiple second candidate areas, and based on the area with the largest projected coverage area between each pair of areas selected in the combination, the horizontal lane line arrangement area includes: Based on the positional relationship between each of the second candidate areas and the construction rules of the preset directed acyclic graph, construct a second directed acyclic graph including all the second candidate areas, where the construction rule of the second directed acyclic graph is that each second candidate area is regarded as a node, and the weight of the edge constructed between every two nodes is the size of the projected coverage area between the parking space arrangement areas of the two lane lines; Based on the preset directed graph, call a topological sorting method to extract the longest path combination with the largest weight from the second directed acyclic graph, and obtain the horizontal lane line arrangement area.

8. The lane line generation method according to claim 1, wherein After combining two adjacent areas among the multiple second candidate areas and based on the area with the largest projected coverage area between each pair of areas selected in the combination, the horizontal lane line arrangement area, it further includes: Using a preset optimization algorithm to optimize the area or position of the vertical lane line arrangement area and the horizontal lane line arrangement area, where the optimization process is to move the positions of the vertical lane line arrangement area and the horizontal lane line arrangement area without adding or deleting the vertical lane line arrangement area and the horizontal lane line arrangement area.

9. A lane line generation device, characterized in that, The device includes: An acquisition module, configured to acquire the architectural design drawing of the site to be designed, and extract the parking space arrangement area in the architectural design drawing; A first extraction module, configured to extract continuous areas in a single direction that penetrate the site to be designed in the lane arrangement area, and obtain multiple first candidate areas; A first combination module, configured to combine multiple areas belonging to the same orientation among the multiple first candidate areas, and use the area with the largest projected coverage area between each pair of areas selected in the combination as the vertical lane line arrangement area; A second extraction module, configured to update the parking space layout area based on the vertical lane line layout area, and extract continuous areas in the horizontal direction from areas other than the vertical lane line layout area to obtain a plurality of second candidate areas; A second combination module, configured to combine two adjacent areas among the plurality of second candidate areas, and select, according to the combination, the area with the largest projected coverage area between each pair of areas as the horizontal lane line layout area; A layout module, configured to generate lane lines in the vertical lane line layout area and the horizontal lane line layout area respectively according to the design requirements of the lane lines.

10. An electronic device, characterized in that, The electronic device includes: a memory and at least one processor, and instructions are stored in the memory; The at least one processor calls the instructions in the memory so that the electronic device executes the lane line generation method according to any one of claims 1-8.

Images