Parking space arrangement method, device and readable storage medium

Abstract

This application relates to a parking space layout method, apparatus, and storage medium. The method includes: acquiring a layout path within a parking area; acquiring parameter setting instructions for the parking spaces; and, based on parking space information and fault information, arranging parking spaces along the layout path within the parking area. This method enables automatic avoidance of faulty objects around the layout path, thereby allowing for the reasonable and automatic layout of parking spaces within the parking area, even considering scenarios with faulty objects, thus improving the accuracy of the parking space layout results.

Description

Technical Field

[0001] This application relates to the field of computer-aided architectural design technology, and in particular to a parking space layout method, apparatus, and readable storage medium. Background Technology

[0002] With the continuous development of computer technology, the use of various computer-aided design software has become an essential skill for professionals. Computer-aided design software is one of the tools that professionals strive to use to improve the efficiency of engineering design. As a crucial process in the engineering design phase, improving the efficiency of parking space layout has always been a hot research topic for researchers in the related architectural field.

[0003] In traditional techniques, computer-aided design software can arrange parking spaces along a reference direction using a straight path to obtain the parking space layout result. However, the accuracy of the parking space layout result obtained using traditional methods is relatively low. Summary of the Invention

[0004] Therefore, it is necessary to provide a parking space arrangement method, device, and readable storage medium to address the aforementioned technical problems.

[0005] A method for arranging parking spaces, the method comprising:

[0006] Generate a layout path within the parking area according to user instructions;

[0007] Based on the parking space parameter setting interface, the system receives parameter setting instructions for the parking space; the parameter setting instructions include parking space information and fault information.

[0008] Based on the parking space information and the faulty object information, parking spaces are arranged along the arrangement path in the parking area.

[0009] In one embodiment, arranging the parking spaces along the arrangement path in the parking area according to the type of the arrangement path, the parking space information, and the fault information includes:

[0010] If the layout path is a straight line, then the number of parking spaces on the layout path is determined based on the parking space information and the faulty object information.

[0011] The parking spaces are arranged sequentially along the straight line according to the number of parking spaces.

[0012] In one embodiment, the parking space information includes the parking space width, and determining the number of parking spaces on the layout path based on the parking space information and the fault information includes:

[0013] Determine the starting and ending points of the layout path;

[0014] Based on the faulty object information, the starting point, and the ending point, determine the first distance between the starting point and the nearest faulty object, the second distance between any two adjacent faulty objects, and the third distance between the ending point and the nearest faulty object;

[0015] The number of first parking spaces, the number of second parking spaces, and the number of third parking spaces are determined based on the first distance, the second distance, the third distance, and the width of the parking space.

[0016] Wherein, the first number of parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the second number of parking spaces is the number of parking spaces between every two adjacent faulty objects, and the third number of parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

[0017] In one embodiment, the parking space information includes the parking space tilt angle and the corner coordinates of the parking space. Determining the number of parking spaces on the layout path based on the parking space information and the fault information includes:

[0018] Determine the starting and ending points of the layout path;

[0019] Based on the faulty object information, the starting point, and the ending point, determine the first distance between the starting point and the nearest faulty object, the second distance between any two adjacent faulty objects, and the third distance between the ending point and the nearest faulty object;

[0020] Based on the corner coordinates and the parking space tilt angle, determine the required width of the angled parking space;

[0021] The number of first angled parking spaces, the number of second angled parking spaces, and the number of third angled parking spaces are determined based on the first distance, the second distance, the third distance, and the occupied width.

[0022] Wherein, the number of the first angled parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the number of the second angled parking spaces is the number of parking spaces between every two adjacent faulty objects, and the number of the third angled parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

[0023] In one embodiment, the parking space information includes parking space insertion points, and the step of sequentially arranging the parking spaces along the straight line according to the number of parking spaces includes:

[0024] Determine the insertion position of the parking space insertion point;

[0025] Based on the insertion position, determine the target location of the parking space to be arranged;

[0026] Based on the number of parking spaces, the parking spaces are arranged sequentially along the straight line at the target location of the straight line.

[0027] In one embodiment, the parking space information includes parking space length and parking space width, and the step of arranging parking spaces along the arrangement path in the parking area based on the parking space information and the fault information includes:

[0028] The parking spaces are arranged along the arrangement path in the parking area according to the parking space length and the parking space width;

[0029] Based on the faulty object information and the parking spaces arranged, the parking spaces that overlap with the faulty object are deleted.

[0030] In one embodiment, arranging the parking spaces along the arrangement path in the parking area according to the type of the arrangement path, the parking space information, and the fault information includes:

[0031] If the type of the layout path is a polyline, then the target angle of the polyline is determined according to the parking space layout method;

[0032] On the target angle side, based on the parking space information and the fault information, the parking spaces are arranged along each straight line in the arrangement path within the parking area;

[0033] Based on the faulty object information and the parking spaces arranged, the parking spaces that overlap with the faulty object are deleted.

[0034] In one embodiment, determining the target angle of the broken line based on the parking space layout includes:

[0035] If the parking space arrangement is an inner circle arrangement, then the target angle is the smallest angle of the broken line;

[0036] If the parking space arrangement is an outer ring arrangement, then the target angle is the maximum angle of the broken line.

[0037] A parking space arrangement device, the device comprising:

[0038] The layout path acquisition module is used to acquire the layout path within the parking area;

[0039] The setting instruction acquisition module is used to acquire parameter setting instructions for parking spaces; the parameter setting instructions include parking space information and fault information;

[0040] The parking space arrangement module is used to arrange parking spaces along the arrangement path in the parking area based on the parking space information and the fault information.

[0041] A readable storage medium having a computer program stored thereon, the computer program performing the following steps when executed by a processor:

[0042] Obtain the layout path within the parking area;

[0043] Obtain parameter setting instructions for parking spaces; the parameter setting instructions include parking space information and fault information;

[0044] Based on the parking space information and the faulty object information, parking spaces are arranged along the arrangement path in the parking area.

[0045] The above-mentioned parking space arrangement method, device, and readable storage medium enable the computer device to obtain the arrangement path within the parking area, obtain the parameter setting instructions for the parking spaces, and arrange parking spaces along the arrangement path within the parking area based on parking space information and fault information. The above method can automatically avoid faults based on fault information around the arrangement path, thereby enabling the reasonable and automatic arrangement of parking spaces within the parking area under the consideration of faulty objects, thus improving the accuracy of the parking space arrangement results. Attached Figure Description

[0046] Figure 1 This is an internal structural diagram of a computer device in one embodiment;

[0047] Figure 2 This is a flowchart illustrating a parking space arrangement method in one embodiment;

[0048] Figure 3 This is a schematic diagram of the parking space parameter setting interface in one embodiment;

[0049] Figure 4 This is a flowchart illustrating a method for arranging parking spaces along a layout path in a parking area, as described in another embodiment.

[0050] Figure 5 This is a flowchart illustrating a method for arranging parking spaces along a layout path in a parking area, as described in another embodiment.

[0051] Figure 6 This is a flowchart illustrating a method for determining the number of parking spaces between adjacent faulty objects around a layout path, as shown in another embodiment.

[0052] Figure 7This is a flowchart illustrating a method for determining the number of angled parking spaces between adjacent faulty objects around a layout path, as shown in another embodiment.

[0053] Figure 8 A model diagram of an angled parking space in another embodiment;

[0054] Figure 9 This is a flowchart illustrating a method for arranging parking spaces sequentially along a straight line according to the number of parking spaces in another embodiment;

[0055] Figure 10 This is a flowchart illustrating a method for arranging parking spaces along a layout path in a parking area, as described in another embodiment.

[0056] Figure 11 This is a model diagram of the parking space layout result obtained when two rows of right-angled parking spaces are arranged on both sides of a straight line in another embodiment;

[0057] Figure 12 This is a model diagram of the parking space layout result obtained when two rows of angled parking spaces are arranged on both sides of a straight line in another embodiment;

[0058] Figure 13 This is a flowchart illustrating a method for arranging parking spaces along a layout path in a parking area, as described in another embodiment.

[0059] Figure 14 This is a model diagram of the parking space layout result obtained when arranging double rows of right-angled parking spaces along a broken line in another embodiment;

[0060] Figure 15 This is a structural block diagram of a parking space arrangement device in one embodiment. Detailed Implementation

[0061] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0062] The parking space arrangement method provided in this application can be applied to Figure 1 The computer equipment shown. (For example...) Figure 1As shown, the computer device includes a processor, memory, network interface, display screen, and input devices connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The computer device's database stores parking space information. The network interface allows communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a parking space arrangement method.

[0063] Those skilled in the art will understand that Figure 1 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0064] It should be noted that the parking space arrangement method provided in this application can be implemented by a parking space arrangement device, which can be implemented as part or all of a computer device through software, hardware, or a combination of software and hardware. The following method embodiments will use a computer device as an example to illustrate the implementation subject.

[0065] This embodiment describes the process of automatically arranging parking spaces in a parking area using computer equipment. The parking area can be located in an underground parking garage, a ground-level parking garage, an open-air parking garage, an indoor parking garage, or other similar environments. This embodiment does not limit the location of the parking space.

[0066] In one embodiment, such as Figure 2 As shown, a parking space arrangement method is provided, which can be applied to... Figure 1 Taking a computer device as an example, the explanation includes the following steps:

[0067] S1000: Obtain the layout path within the parking area.

[0068] Specifically, the computer device can open a blank drawing interface through drawing software or a drawing webpage, then receive and respond to user instructions, generating a layout path within the parking area. These user instructions can be user actions triggered on the drawing interface, such as the user drawing a path using a mouse, touch, or voice input, and using that path as the layout path. The number of paths drawn by the user on the drawing interface can be greater than or equal to one; if greater than one, multiple drawn paths can be combined to form the layout path. Furthermore, after generating the layout path, the computer device can automatically obtain the layout path parameters, which can be displayed in a certain area of ​​the drawing interface. These layout path parameters can include the width and length of the layout path.

[0069] S2000: Obtain the parameter setting instructions for the parking space; the parameter setting instructions include parking space information and fault information.

[0070] Specifically, after generating the layout path, the computer device can, based on the drawing interface with the layout path drawn on it, receive an instruction to open the parking space parameter setting interface and display it. The user sets the relevant parameters for the parking spaces on the parking space parameter setting interface. After confirmation, the computer device receives the parameter setting instructions from the user and then further arranges the parking spaces within the parking area according to the received parameter setting instructions. The parking area can be a closed region of any shape, and its specific size is not limited in this embodiment. The layout path can be drawn within the parking area.

[0071] Understandably, the above parameter setting instructions can carry parking space information and fault information. Parking space information may include parking space length, parking space width, parking space edge distance, parking space insertion point, and lane width, etc. However, when arranging double-layer parking spaces in a parking area, the parking space information may also include parking space height. Fault information may include the location, size, shape, and corner coordinates of the faulty object, etc.

[0072] In this embodiment, the parking space parameter setting interface may include a parking space parameter setting area, a parking space preview area, and a parking space avoidance selection area, etc. Figure 3 The image shows a schematic diagram of a parking space parameter setting interface. The cross marks on the parking spaces in the preview area are the parking space insertion points, and the parking space angle can be understood as the parking space tilt angle.

[0073] S3000: Based on parking space information and fault information, parking spaces are arranged along the layout path in the parking area.

[0074] Specifically, the computer equipment can arrange single or multiple rows of parking spaces along a layout path within the parking area, starting from the initial layout point and ending at the final layout point, based on parking space information and fault information, thus obtaining a parking space layout result. This parking space layout result can be the result after avoiding the fault. The layout path includes two endpoints, where either endpoint can be used as the starting point and the other endpoint as the ending point. In this embodiment, the fault information can include information on all faults within a certain layout area surrounding the layout path. The area of ​​this layout area can be smaller than the area of ​​the parking area. The layout area can be understood as the portion of the parking area occupied by the parking spaces arranged around the layout path.

[0075] In addition, when all fault information is 0, it indicates that there are no faults around the arrangement path. In this scenario, the above steps can also be used to automatically arrange parking spaces along the arrangement path in the parking area.

[0076] In the above parking space layout method, the layout path within the parking area can be obtained, the parameter setting instructions for the parking spaces can be obtained, and parking spaces can be arranged along the layout path within the parking area based on the parking space information and fault information. This method can automatically avoid faults based on the fault information of the surrounding faults, thereby enabling reasonable automatic layout of parking spaces within the parking area even when considering the presence of faults, thus improving the accuracy of the parking space layout results. At the same time, this method can also be applied to automatically arrange parking spaces in the absence of faults, thereby improving the versatility of the parking space layout method.

[0077] As one example, such as Figure 4 As shown, the step in S3000 above, which involves arranging parking spaces along the layout path in the parking area based on parking space information and fault information, can be achieved through the following steps:

[0078] S3100, Get the type of the layout path.

[0079] Specifically, the layout path can be a curve, a straight line, or a polyline. In other words, the layout path generated by the computer equipment within the parking area can be a curve, a straight line, or a polyline.

[0080] The computer equipment can determine whether there are straight lines in the layout path. If there are straight lines, it can further determine whether there is an angle between the multiple straight lines in the layout path. If there is an angle, the layout path is determined to be a broken line; if not, the layout path is determined to be a straight line. If there are no straight lines in the layout path, the layout path is determined to be a curve.

[0081] S3200: Based on the type of layout path, parking space information, and fault information, arrange parking spaces along the layout path in the parking area.

[0082] It is understandable that different types of layout paths may require different parking space layout methods. The computer equipment can determine the corresponding parking space layout method based on the type of layout path, and further, based on parking space information and fault information, arranges parking spaces along the layout path in the parking area using the corresponding parking space layout method. The parking space layout method may include information such as the number of rows of parking spaces and the direction of the parking spaces. In this embodiment, the parking spaces can be right-angled parking spaces.

[0083] The above-described parking space layout method can obtain the type of layout path and, based on the layout path type, parking space information, and fault information, arrange parking spaces along the layout path in the parking area using the corresponding parking space layout method. This method can automatically avoid faults around the layout path based on their fault information, thus enabling the reasonable and automatic layout of parking spaces in the parking area even when considering scenarios with faults, thereby improving the accuracy of the parking space layout results. At the same time, this method can arrange parking spaces along the layout path in the parking area using the corresponding parking space layout method based on the layout path type, avoiding the problem of a single parking space layout method and making the parking space layout methods more diverse.

[0084] As one example, such as Figure 5 As shown, the step of arranging parking spaces along the arrangement path in the parking area according to the type of arrangement path, parking space information, and fault information in S3200 above may specifically include the following steps:

[0085] S3210. If the layout path is a straight line, then determine the number of parking spaces on the layout path based on the parking space information and the fault information.

[0086] Specifically, if the computer equipment determines that the layout path is a straight line and there are faulty objects around the layout path, it can determine the number of parking spaces that can be arranged on the layout path (which can refer to the two endpoints of the layout path) based on the parking space information and the faulty object information.

[0087] S3220. Arrange parking spaces in a straight line according to the number of parking spaces.

[0088] Specifically, the computer equipment can arrange single-row or double-row parking spaces sequentially along a straight line from the starting point to the ending point, based on the number of parking spaces. In this embodiment, if double-row parking spaces are arranged, they are composed of two single-row parking spaces. In this case, there can be a certain lane distance, i.e., the edge distance of the parking spaces, between the two single-row parking spaces. The parking spaces in this embodiment can be right-angled parking spaces or angled parking spaces.

[0089] The above-mentioned parking space layout method can automatically avoid faulty objects around the layout path based on their fault information, thereby enabling the reasonable and automatic layout of parking spaces within the parking area even when considering faulty objects, thus improving the accuracy of the parking space layout results. At the same time, this method can also be applied to automatically layout parking spaces when there are no faulty objects, thereby improving the versatility of the parking space layout method.

[0090] As one embodiment, the parking space information includes the parking space width. The step in S3210 described above, which determines the number of parking spaces between adjacent faulty objects around the layout path based on the parking space information and the faulty object information, is as follows: Figure 6 As shown, this can be achieved through the following steps:

[0091] S3211. Determine the starting and ending points of the layout path.

[0092] Specifically, the computer device can use any one endpoint of the layout path as the starting point of the layout path and the other endpoint as the ending point of the layout path.

[0093] S3212. Based on the faulty object information, the starting point and the ending point, determine the first distance between the starting point and the nearest faulty object, the second distance between any two adjacent faulty objects, and the third distance between the ending point and the nearest faulty object.

[0094] Specifically, the computer equipment can determine the horizontal or vertical distance between the starting placement point and the nearest edge point of the nearest faulty object, i.e., the first distance, based on the faulty object information and the starting placement point; determine the horizontal or vertical distance between the nearest edge points of every two adjacent faulty objects around the placement path, i.e., the second distance, based on the faulty object information and the ending placement point; and determine the horizontal or vertical distance between the ending placement point and the nearest edge point of the nearest faulty object, i.e., the third distance, based on the faulty object information and the ending placement point.

[0095] Specifically, the computer equipment can determine the coordinates of the nearest boundary point of the faulty object closest to the starting point in the horizontal or vertical direction based on the location, size, shape, and / or corner coordinates of the faulty object. Then, based on the coordinates of the starting point and the nearest edge point of the nearest faulty object, it can calculate the horizontal or vertical distance between the starting point and the nearest edge point of the nearest faulty object. Simultaneously, the computer equipment can also determine the coordinates of the nearest edge point of an adjacent faulty object in the horizontal or vertical direction based on the location, size, shape, and / or corner coordinates of the faulty object. Then, based on the corresponding coordinates of the two adjacent faulty objects, it can calculate the horizontal or vertical distance between them. Furthermore, the computer equipment can also determine the coordinates of the nearest boundary point of the faulty object closest to the ending point in the horizontal or vertical direction based on the location, size, shape, and / or corner coordinates of the faulty object. Then, based on the coordinates of the ending point and the nearest edge point of the nearest faulty object, it can calculate the horizontal or vertical distance between the ending point and the nearest edge point of the nearest faulty object.

[0096] In terms of horizontal spacing, the horizontal spacing between the starting point and the nearest boundary point on the nearest faulty object can be understood as the distance between two points projected onto a horizontal straight line from the starting point and the nearest boundary point.

[0097] It is understandable that whether the horizontal or vertical spacing distance is calculated depends on the direction of the layout path. If the layout path is horizontal, then the determined first, second, and third distances are all horizontal spacing distances; if the layout path is vertical, then the determined first, second, and third distances are all vertical spacing distances. In this embodiment, the determined first, second, and third distances can all be greater than or equal to 0, and the number of second distances can be greater than or equal to 0, specifically determined based on the number of obstacles between the two endpoints of the layout path.

[0098] S3213. Determine the number of first parking spaces, second parking spaces, and third parking spaces based on the first distance, second distance, third distance, and parking space width.

[0099] The first number of parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the second number of parking spaces is the number of parking spaces between any two adjacent faulty objects, and the third number of parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

[0100] Specifically, the computer equipment can determine the number of right-angle parking spaces that can be arranged between the starting point and the nearest faulty object, i.e., the first number of parking spaces, based on the first distance between the starting point and the nearest faulty object and the width of the parking space required to arrange right-angle parking spaces. At the same time, the computer equipment can also determine the number of right-angle parking spaces that can be arranged between each pair of adjacent faulty objects, i.e., the second number of parking spaces, based on the second distance between each pair of adjacent faulty objects around the arrangement path and the width of the parking space required to arrange right-angle parking spaces. In addition, the computer equipment can also determine the number of right-angle parking spaces that can be arranged between the ending point and the nearest faulty object, i.e., the third number of parking spaces, based on the third distance between the starting point and the nearest faulty object and the width of the parking space required to arrange right-angle parking spaces.

[0101] In this configuration, if the product of the first number of parking spaces and the width of the parking space is greater than the first distance, the parking space can be placed in the center between the starting point and the nearest faulty object; alternatively, the parking spaces can be placed starting from the starting point. If the product of the second number of parking spaces and the width of the parking space is greater than the second distance, the parking space can be placed in the center between two adjacent faulty objects. If the product of the third number of parking spaces and the width of the parking space is greater than the third distance, the parking space can be placed in the center between the ending point and the nearest faulty object; alternatively, the parking spaces can be placed starting from the ending point. The long side of a right-angled parking space can be perpendicular to the horizontal direction, and the short side can be perpendicular to the vertical direction, without any angle of inclination. In this embodiment, the parking space can be a right-angled parking space.

[0102] The above parking space layout method can determine the starting and ending points of the layout path. Based on the fault information, the starting and ending points, it determines the first distance between the starting point and the nearest fault, the second distance between any two adjacent faults, and the third distance between the ending point and the nearest fault. Based on the first, second, and third distances and the width of the parking space, it determines the first number of parking spaces between the starting point and the nearest fault, the second number of parking spaces between any two adjacent faults, and the third number of parking spaces between the ending point and the nearest fault. Furthermore, based on the number of first, second, and third parking spaces, parking spaces are sequentially arranged between the starting point and the nearest fault, between any two adjacent faults, and between the ending point and the nearest fault, thereby achieving the goal of avoiding faults when arranging parking spaces and improving the accuracy of the parking space layout results.

[0103] In some scenarios, if there is a fault on the parking space placement side of the starting point of the placement path, and the parking space information includes the parking space tilt angle and the corner coordinates of the parking space, then the step in S3210 above, which determines the number of parking spaces on the placement path based on the parking space information and the fault information, is as follows: Figure 7 As shown, this can be achieved through the following steps:

[0104] S3214. Determine the starting and ending points of the layout path.

[0105] Specifically, the computer device can use any one endpoint of the layout path as the starting point of the layout path and the other endpoint as the ending point of the layout path.

[0106] S3215. Based on the faulty object information, the starting point and the ending point, determine the first distance between the starting point and the nearest faulty object, the second distance between any two adjacent faulty objects, and the third distance between the ending point and the nearest faulty object.

[0107] Specifically, the implementation process in S3215 is the same as that in S3212, and will not be described again in this embodiment.

[0108] S3216. Determine the required width of the angled parking space based on the corner coordinates and the parking space tilt angle.

[0109] Specifically, an angled parking space can be understood as a parking space with an angle. If the layout path is a horizontal straight line, the angle of inclination of the parking space can be the angle between the two longer sides of the angled parking space and the horizontal straight line. Where the angles between each longer side of the angled parking space and the horizontal straight line are equal, then each angle can be considered the angle of inclination of the parking space. For example... Figure 8 The diagram shows a two-dimensional planar model of an angled parking space. The four corner points of the angled parking space are numbered, with the topmost corner point called corner point 1, and the others clockwise called corner points 2, 3, and 4. If the layout path is a horizontal straight line, and corner point 3 of the angled parking space is placed on the horizontal straight line, the computer equipment can calculate the horizontal distance between corner points 3 and 4 using the sine and cosine theorems and / or the Pythagorean theorem, based on the coordinates of corner points 3 and 4 and the angle of inclination of the parking space. This horizontal distance is the distance between the point projected onto the horizontal straight line of corner point 4 and corner point 3. This distance can be called the required width of the angled parking space.

[0110] S3217. Determine the number of first angled parking spaces, second angled parking spaces, and third angled parking spaces based on the first distance, second distance, third distance, and occupied width.

[0111] The number of parking spaces at the first angle is the number of parking spaces between the starting point and the nearest faulty object, the number of parking spaces at the second angle is the number of parking spaces between every two adjacent faulty objects, and the number of parking spaces at the third angle is the number of parking spaces between the ending point and the nearest faulty object.

[0112] Specifically, the computer equipment can determine the number of angled parking spaces that can be arranged between the starting point and the nearest faulty object, i.e., the number of first angled parking spaces, based on the first distance between the starting point and the nearest faulty object and the width required to arrange the angled parking spaces. If the number of first angled parking spaces multiplied by the width is greater than the first distance, and the first distance is less than (the number of first angled parking spaces plus 1) multiplied by the width, then the angled parking spaces can be arranged in the center between the starting point and the nearest faulty object.

[0113] Simultaneously, the computer equipment can determine the number of angled parking spaces that can be arranged between each pair of adjacent faulty objects based on the second distance between each pair of adjacent faulty objects around the arrangement path and the occupancy width required to arrange angled parking spaces; that is, the second number of angled parking spaces. If the second number of angled parking spaces multiplied by the occupancy width is greater than the second distance, and the second distance is less than (the second number of angled parking spaces plus 1) multiplied by the occupancy width, then the angled parking spaces can be arranged in the center position between the two adjacent faulty objects.

[0114] Additionally, the computer equipment can determine the number of angled parking spaces that can be arranged between the termination point and the nearest faulty object, i.e., the number of third angled parking spaces, based on the third distance between the termination point and the nearest faulty object and the required width for arranging angled parking spaces. If the number of third angled parking spaces multiplied by the width is greater than the third distance, and the third distance is less than (the number of third angled parking spaces plus 1) multiplied by the width, then the angled parking spaces can be arranged in the center between the termination point and the nearest faulty object.

[0115] The above parking space layout method can determine the starting and ending points of the layout path. Based on the fault information, the starting and ending points, it determines the first distance between the starting point and the nearest fault, the second distance between any two adjacent faults, and the third distance between the ending point and the nearest fault. Based on the corner coordinates and the parking space tilt angle, it determines the required width of the angled parking space. Based on the first, second, and third distances and the width, it determines the number of first angled parking spaces between the starting point and the nearest fault, the number of second angled parking spaces between any two adjacent faults, and the number of third angled parking spaces between the ending point and the nearest fault. Furthermore, based on the number of first, second, and third angled parking spaces, it sequentially arranges angled parking spaces between the starting point and the nearest fault, between any two adjacent faults, and between the ending point and the nearest fault, thereby achieving the purpose of avoiding faults when arranging angled parking spaces and improving the accuracy of the parking space layout results.

[0116] In some scenarios, parking space information includes the insertion point of the parking space. If angled parking spaces are arranged, then parking spaces are arranged within the parking area based on the insertion point of the angled parking space. Therefore, as... Figure 9 As shown, the step of arranging parking spaces sequentially along a straight line according to the number of parking spaces in S3220 above can be achieved through the following steps:

[0117] S3221. Determine the insertion position of the parking space insertion point.

[0118] Specifically, the computer equipment can determine whether the insertion point of the angled parking space is the upper or lower corner of the angled parking space based on the set parking space information.

[0119] See also Figure 8 The angled parking spaces shown are defined using the center line between corner points 1 and 3 as a reference line. Corner points above the center line are called upper corner points, and those below are called lower corner points. Typically, when arranging angled parking spaces, the insertion points can be placed along the layout path. Therefore, either the uppermost or lowermost corner point along the center line can be used as the insertion point.

[0120] S3222. Determine the target location of the parking space to be placed based on the insertion position.

[0121] Specifically, the computer equipment can determine the target orientation of the parking space to be placed relative to the placement path based on the insertion position. The target orientation can be to the left or right of the placement path, or it can be above or below the placement path.

[0122] In this embodiment, if the arrangement path is a horizontal straight line, the target orientation of the parking space to be arranged relative to the arrangement path can be the upper or lower side of the arrangement path; if the arrangement path is a vertical straight line, the target orientation of the parking space to be arranged relative to the arrangement path can be the left or right side of the arrangement path.

[0123] S3223. Based on the number of parking spaces, arrange the parking spaces sequentially along the straight line at the target location.

[0124] Specifically, the computer equipment can arrange single-row or double-row angled parking spaces sequentially along a straight line from the starting point to the ending point, based on the number of parking spaces. In this embodiment, the parking spaces can be angled parking spaces.

[0125] The above parking space layout method can arrange angled parking spaces sequentially from the starting point to the ending point of the layout path according to the parking space insertion point, so that the method can be applied to the automatic layout of different types of parking spaces, thus improving the versatility of the parking space layout method.

[0126] As one embodiment, the parking space information includes the length and width of the parking space, and the parking space is either a right-angled parking space or an angled parking space, such as... Figure 10 As shown, the step in S3000 above, which involves arranging parking spaces along the layout path in the parking area based on parking space information and fault information, can also be achieved through the following steps:

[0127] S3300. Arrange parking spaces along the layout path in the parking area according to the length and width of the parking space.

[0128] Specifically, the computer equipment can arrange single-row right-angle parking spaces, double-row right-angle parking spaces, single-row angled parking spaces, or double-row angled parking spaces sequentially along the layout path in the parking area, from the starting point to the ending point of the layout path, based on the length and width of the parking space.

[0129] S3400: Based on the faulty object information and the arranged parking spaces, delete the parking spaces that overlap with the faulty object.

[0130] Specifically, when executing the steps in S3300 above, the issue of parking spaces not being able to be placed at the location of the faulty object within the parking area is not considered. Therefore, after placing parking spaces along the placement path within the parking area, it is necessary to process the parking spaces placed at the faulty object to ensure that no parking spaces are placed at the faulty object in the parking space placement result. Specifically, the computer equipment can delete parking spaces overlapping with the faulty object within the parking area based on the faulty object information and the placed parking spaces. Furthermore, if a portion of a parking space intersects with the boundary of the faulty object, these parking spaces intersecting with the boundary of the faulty object can also be deleted.

[0131] For example, if the layout path is a straight line, and the parking spaces are arranged in double rows with right angles, the resulting parking space layout model diagram is as follows. Figure 11 As shown, double rows of right-angled parking spaces are arranged along the layout path from the starting point to the ending point. If the parking spaces are arranged in a single row, they can be placed on either side of the straight line, with the edges of the single row of parking spaces adjacent to the straight line. If the parking spaces are arranged in a double row, they can be placed on both sides of the straight line, with the two single rows of right-angled parking spaces arranged simultaneously, and their opposite edges adjacent to the straight line. The starting point in the diagram can be understood as the starting point of the straight line, and the ending point can be understood as the ending point of the straight line. The solid rectangle represents a faulty object.

[0132] Additionally, if the path type is straight, and double rows of parking spaces are arranged, with the parking spaces being angled, the resulting parking space layout model diagram is as follows. Figure 12 As shown, double-row angled parking spaces are arranged along the layout path from the starting point to the ending point. If the parking spaces are arranged in a single row, the target location of the parking space to be arranged can be determined based on the insertion point of the parking space. Then, a single-row angled parking space is arranged on the side of the target location on the straight line, and the insertion point of the single-row angled parking space is located on the straight line. If the parking spaces are arranged in a double row, single-row angled parking spaces can be arranged on both sides of the straight line, and two single-row angled parking spaces are arranged simultaneously. Only one of the two single-row angled parking spaces has its insertion point located on the straight line. Solid rectangles in the figure represent faulty objects, and deleted areas represent areas where angled parking spaces are repeatedly arranged or areas where angled parking spaces cannot be arranged between two adjacent faulty objects. In this embodiment, when arranging double-row angled parking spaces along a straight line, there is a certain distance between the two single-row angled parking spaces, i.e., the lane width. The lane width can be understood as the width of the parking garage aisle that vehicles can pass through when entering and exiting the parking space.

[0133] The above-mentioned parking space layout method can delete parking spaces that overlap with faulty objects after the parking spaces are arranged, thereby achieving avoidance of faulty objects during parking space layout and automatically arranging parking spaces in a reasonable manner within the parking area, thus improving the accuracy of the parking space layout results. At the same time, this method can also be applied to automatically arrange parking spaces when there are no faulty objects, thereby improving the versatility of the parking space layout method.

[0134] As one example, such as Figure 13 As shown, the step in S3200 above, which involves arranging parking spaces along the arrangement path in the parking area based on the type of the arrangement path, parking space information, and fault information, may specifically include:

[0135] S3230. If the layout path is a polyline, then determine the target angle of the polyline according to the parking space layout method.

[0136] Specifically, if the layout path is determined to be a polyline, meaning it's a polyline formed by sequentially connecting the endpoints of multiple straight lines, the computer device can determine the target angle of the polyline based on the parking space layout method. The parking space layout method corresponding to a polyline layout path can differ from the parking space layout method corresponding to a straight line layout path. The parking space layout method can include the layout direction of the parking spaces and their orientation relative to the polyline, etc. The layout direction of the parking spaces can be from the starting point to the ending point of the layout path. In this embodiment, the layout path can consist of multiple polylines.

[0137] When the endpoints of two straight lines are connected, they form a broken line. The computer can then determine the two included angles of the broken line based on the coordinates of the endpoints of the two straight lines. These included angles are the minimum and maximum included angles. The target angle can be either the minimum or the maximum included angle of the broken line.

[0138] Specifically, the step of determining the target angle of the broken line according to the parking space layout in S3230 can include: if the parking space layout is an inner circle layout, the target angle is the minimum angle of the broken line; if the parking space layout is an outer circle layout, the target angle is the maximum angle of the broken line.

[0139] Specifically, the aforementioned parking space layout methods can include inner circle layouts and outer circle layouts. These layouts can include the direction of the parking spaces and their orientation relative to the zigzag line. The orientation of the parking spaces relative to the zigzag line can be understood as the target orientation. If the parking space layout is an inner circle layout, then the parking spaces will be placed on the side with the smallest angle of the zigzag line, and the target angle will be the smallest angle of the zigzag line. If the parking space layout is an outer circle layout, then the parking spaces will be placed on the side with the largest angle of the zigzag line, and the target angle will be the largest angle of the zigzag line.

[0140] like Figure 14 The diagram shows a model of a parking space layout when the path is a broken line and double-row right-angled parking spaces are arranged. When arranging double-row right-angled parking spaces, the layout starts from the angle between the lines of the broken line and proceeds towards the other end of each line. Figure 14 There is a small area on the right edge of the straight line on the right, which is not suitable for setting up a double-row right-angle parking space. Therefore, the right edge of the straight line on the right in the diagram is empty and no parking space is set up there.

[0141] This embodiment can determine the target angle of the broken line according to the parking space layout method, and then arrange parking spaces along each straight line of the broken line on the side of the target angle. This allows the method to arrange parking spaces along different layout paths, further improving the versatility of the parking space layout method.

[0142] S3240. On the target angle side, based on the parking space information and fault information, arrange parking spaces along each straight line in the arrangement path within the parking area.

[0143] Specifically, the target angle side can be either the side with the smallest angle or the side with the largest angle of the broken line. The computer equipment can, on the target angle side, arrange parking spaces along each straight line of the arrangement path within the parking area, based on parking space information and fault information. The specific method for arranging parking spaces along each straight line of the arrangement path within the parking area based on parking space information and fault information is the same as the method described in the above embodiment for arranging parking spaces when the arrangement path is a straight line and a fault exists in the parking area; therefore, it will not be repeated in this embodiment. If there is no fault in the parking area, the fault information can be set to 0, and then the method described above for arranging parking spaces when the arrangement path is a straight line and a fault exists in the parking area can be executed.

[0144] However, since the layout path is a broken line, to avoid overlapping parking spaces when placing them along each straight line of the path, a certain preset distance can be reserved at the angle end of each straight line towards the other end of the line. This prevents overlapping parking spaces when starting to place them from the angle end. Alternatively, if no preset distance is reserved at the angle end of each straight line, overlapping parking spaces can be deleted after placement. The preset distance can be equal to the width of the parking space, or it can be set according to the actual situation, but it must be less than the length of the straight lines in the broken line.

[0145] In addition, the above method also includes: deleting parking spaces that overlap with the faulty object based on the faulty object information and the parking spaces arranged.

[0146] Understandably, if the presence of faulty objects within the parking area was not considered when arranging parking spaces along the zigzag path, then parking spaces overlapping with faulty objects can be deleted after the parking spaces are arranged. Furthermore, if a portion of a parking space intersects with the boundary of a faulty object, those parking spaces intersecting with the boundary of the faulty object can also be deleted.

[0147] This embodiment can delete parking spaces that overlap with faulty objects after parking spaces are arranged, thereby avoiding faulty objects during parking space arrangement and automatically arranging parking spaces in a reasonable manner within the parking area, improving the accuracy of parking space arrangement results. At the same time, this method can also be applied to automatically arrange parking spaces when there are no faulty objects, thereby improving the versatility of the parking space arrangement method.

[0148] The above-mentioned parking space layout method can arrange parking spaces along the broken line path when the layout path is a broken line, so that the method can arrange parking spaces along different layout paths, improving the versatility of the parking space layout method; at the same time, the method realizes the avoidance of malfunctioning objects when arranging parking spaces, and automatically arranges parking spaces in a reasonable manner within the parking area, improving the accuracy of the parking space layout results.

[0149] To facilitate understanding by those skilled in the art, the parking space arrangement method provided in this application is described using a computer device as the execution subject as an example. Specifically, the method includes:

[0150] (1) Obtain the layout path within the parking area.

[0151] (2) Obtain the parameter setting instructions for the parking space; the parameter setting instructions include parking space information and fault information.

[0152] (3) If the type of the layout path is a straight line, then determine the starting point and ending point of the layout path.

[0153] (4) Based on the faulty object information, the starting point and the ending point, determine the first distance between the starting point and the nearest faulty object, the second distance between every two adjacent faulty objects, and the third distance between the ending point and the nearest faulty object;

[0154] (5) Determine the number of first parking spaces, the number of second parking spaces, and the number of third parking spaces based on the first distance, the second distance, the third distance, and the width of the parking space; wherein, the number of first parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the number of second parking spaces is the number of parking spaces between each pair of adjacent faulty objects, and the number of third parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

[0155] (6) When the parking space information includes the parking space tilt angle and the corner coordinates of the parking space, the starting point and ending point of the layout path are determined.

[0156] (7) Based on the fault information, the starting point and the ending point, determine the first distance between the starting point and the nearest fault, the second distance between each pair of adjacent faults, and the third distance between the ending point and the nearest fault.

[0157] (8) Determine the required width of the angled parking space based on the coordinates of the corner point and the tilt angle of the parking space.

[0158] (9) Determine the number of first angled parking spaces, the number of second angled parking spaces, and the number of third angled parking spaces based on the first distance, the second distance, the third distance, and the occupied width; wherein, the number of first angled parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the number of second angled parking spaces is the number of parking spaces between every two adjacent faulty objects, and the number of third angled parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

[0159] (10) If the parking space information includes the parking space insertion point, determine the insertion position of the parking space insertion point.

[0160] (11) Determine the target location of the parking space to be arranged based on the insertion position.

[0161] (12) Based on the number of parking spaces, arrange the parking spaces sequentially along the straight line at the target location.

[0162] (13) Parking space information includes parking space length and parking space width. Based on the parking space length and parking space width, parking spaces are arranged along the layout path in the parking area.

[0163] (14) Delete the parking spaces that overlap with the faulty object based on the faulty object information and the parking spaces arranged.

[0164] or

[0165] (15) If the type of the layout path is a broken line, the target angle of the broken line is determined according to the parking space layout method; where, if the parking space layout method is the inner circle layout method, the target angle is the minimum angle of the broken line; if the parking space layout method is the outer circle layout method, the target angle is the maximum angle of the broken line.

[0166] (16) On the target angle side, based on the parking space information and the fault information, arrange parking spaces along each straight line in the arrangement path in the parking area.

[0167] (17) Delete the parking spaces that overlap with the faulty object based on the faulty object information and the parking spaces arranged.

[0168] The specific execution process of (1) to (17) above can be found in the description of the above embodiments. The implementation principle and technical effect are similar, and will not be repeated here.

[0169] It should be understood that, although Figure 2 , Figures 4-7 , Figure 9 , Figure 10 and Figure 13 The steps in the flowchart are shown sequentially as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order in which these steps are executed, and they can be performed in other orders. Figure 2 , Figures 4-7 , Figure 9 , Figure 10 and Figure 13 At least some of the steps in the process may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but may be executed at different times. The execution order of these steps or stages is not necessarily sequential, but may be executed in turn or alternately with other steps or at least some of the steps or stages in other steps.

[0170] In one embodiment, such as Figure 15 As shown, a parking space arrangement device is provided, including: an arrangement path acquisition module 11, a setting instruction acquisition module 12, and a parking space arrangement module 13, wherein:

[0171] The layout path acquisition module 11 is used to acquire the layout path within the parking area;

[0172] The setting instruction acquisition module 12 is used to acquire the parameter setting instructions for the parking space; the parameter setting instructions include parking space information and fault information;

[0173] The parking space arrangement module 13 is used to arrange parking spaces along the arrangement path in the parking area according to the parking space information and the fault information.

[0174] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0175] In one embodiment, the arrangement module 13 includes: a first quantity determination unit and a first arrangement unit, wherein:

[0176] The first quantity determination unit is used to determine the number of parking spaces on the layout path based on parking space information and fault information when the layout path type is a straight line.

[0177] The first arrangement unit is used to arrange parking spaces sequentially along a straight line according to the number of parking spaces.

[0178] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0179] In one embodiment, the parking space information includes the parking space width, and the first quantity determination unit includes: a first placement point determination subunit, a first distance determination subunit, and a second quantity determination subunit, wherein;

[0180] The first layout point determination subunit is used to determine the starting and ending layout points of the layout path;

[0181] The first distance determination subunit is used to determine, based on the faulty object information, the starting arrangement point, and the ending arrangement point, a first distance between the starting arrangement point and the nearest faulty object, a second distance between every two adjacent faulty objects, and a third distance between the ending arrangement point and the nearest faulty object;

[0182] The second quantity determination subunit is used to determine the number of first parking spaces, the number of second parking spaces, and the number of third parking spaces based on the first distance, the second distance, the third distance, and the width of the parking space; wherein, the number of first parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the number of second parking spaces is the number of parking spaces between every two adjacent faulty objects, and the number of third parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

[0183] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0184] In one embodiment, the parking space information includes the parking space tilt angle and the corner coordinates of the parking space; the first quantity determination unit includes: a second placement point determination subunit, a second distance determination subunit, a first occupied width determination subunit, and a third quantity determination subunit, wherein:

[0185] The second arrangement point determination subunit is used to determine the starting and ending arrangement points of the arrangement path;

[0186] The second distance determination subunit is used to determine, based on the faulty object information, the starting arrangement point, and the ending arrangement point, a first distance between the starting arrangement point and the nearest faulty object, a second distance between every two adjacent faulty objects, and a third distance between the ending arrangement point and the nearest faulty object;

[0187] The first occupancy width determination sub-unit is used to determine the required occupancy width of the angled parking space based on the corner coordinates and the parking space tilt angle.

[0188] The third quantity determination subunit is used to determine the number of first angled parking spaces, the number of second angled parking spaces, and the number of third angled parking spaces based on the first distance, the second distance, the third distance, and the occupied width; wherein, the number of first angled parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the number of second angled parking spaces is the number of parking spaces between every two adjacent faulty objects, and the number of third angled parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

[0189] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0190] In one embodiment, the parking space information includes a parking space insertion point, and the first arrangement unit includes: an insertion position determination subunit, a target orientation determination subunit, and an arrangement subunit, wherein:

[0191] The insertion position determination subunit is used to determine the insertion position of the parking space insertion point;

[0192] The target orientation determination subunit is used to determine the target orientation of the parking space to be placed based on the insertion position;

[0193] The layout sub-unit is used to arrange parking spaces sequentially along a straight line at the target location, based on the number of parking spaces.

[0194] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0195] In one embodiment, the parking space information includes the parking space length and parking space width, and the arrangement module 13 further includes: a second arrangement unit and a parking space deletion unit, wherein:

[0196] The second arrangement unit is used to arrange parking spaces along the arrangement path in the parking area according to the length and width of the parking space;

[0197] The parking space deletion unit is used to delete parking spaces that overlap with the faulty object based on the faulty object information and the arranged parking spaces.

[0198] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0199] In one embodiment, the first arrangement unit further includes: a target angle determination subunit and a third arrangement subunit, wherein:

[0200] The target angle determination sub-unit is used to determine the target angle of the polyline based on the parking space layout method when the layout path is a polyline.

[0201] The third arrangement subunit is used to arrange parking spaces along each straight line in the arrangement path in the parking area on the target angle side, based on parking space information and fault information.

[0202] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0203] Specific limitations regarding the parking space arrangement device can be found in the limitations on parking space arrangement methods described above, and will not be repeated here. Each module in the aforementioned parking space arrangement device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device in hardware form, or stored in the memory of a computer device in software form, so that the processor can call and execute the corresponding operations of each module.

[0204] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

[0205] Obtain the layout path within the parking area;

[0206] Obtain parameter setting instructions for parking spaces; the parameter setting instructions include parking space information and fault information;

[0207] Based on the parking space information and the faulty object information, parking spaces are arranged along the arrangement path in the parking area.

[0208] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, the computer program performing the following steps when executed by a processor:

[0209] Obtain the layout path within the parking area;

[0210] Obtain parameter setting instructions for parking spaces; the parameter setting instructions include parking space information and fault information;

[0211] Based on the parking space information and the faulty object information, parking spaces are arranged along the arrangement path in the parking area.

[0212] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical storage, etc. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0213] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0214] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this patent application should be determined by the appended claims.

Claims

1. A method for arranging parking spaces, characterized in that, The method includes: Obtain the layout path within the parking area, wherein the layout path is of type curve, straight line, or polyline; Obtain parameter setting instructions for parking spaces; the parameter setting instructions include parking space information and fault information; Based on the parking space information and the faulty object information, parking spaces are arranged along the arrangement path in the parking area; The parking space information includes the length and width of the parking space. The step of arranging parking spaces along the layout path in the parking area based on the parking space information and the faulty object information includes: Determine whether there is a straight line in the arrangement path. If there is a straight line in the arrangement path, then determine whether there is a certain angle between the multiple straight lines included in the arrangement path. If there is, then the arrangement path is determined to be a broken line. If not, then the arrangement path is determined to be a straight line. If there is no straight line in the arrangement path, then the arrangement path is determined to be a curve. Based on the type of the arrangement path, the corresponding parking space arrangement method is determined. Further, based on the parking space information and fault information, the corresponding parking space arrangement method is used to arrange parking spaces along the arrangement path in the parking area. Based on the faulty object information and the arranged parking spaces, parking spaces that overlap with the faulty object are deleted; wherein, if a part of the parking space intersects with the boundary of the faulty object, the parking space intersecting with the boundary of the faulty object is deleted.

2. The method according to claim 1, characterized in that, The step of arranging parking spaces along the arrangement path in the parking area based on the parking space information and the faulty object information further includes: If the layout path is a straight line, then the number of parking spaces on the layout path is determined based on the parking space information and the faulty object information. The parking spaces are arranged sequentially along the straight line according to the number of parking spaces.

3. The method according to claim 2, characterized in that, The parking space information includes the parking space width. Determining the number of parking spaces on the layout path based on the parking space information and the fault information includes: Determine the starting and ending points of the layout path; Based on the faulty object information, the starting point, and the ending point, determine the first distance between the starting point and the nearest faulty object, the second distance between any two adjacent faulty objects, and the third distance between the ending point and the nearest faulty object; The number of first parking spaces, the number of second parking spaces, and the number of third parking spaces are determined based on the first distance, the second distance, the third distance, and the width of the parking space. Wherein, the first number of parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the second number of parking spaces is the number of parking spaces between every two adjacent faulty objects, and the third number of parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

4. The method according to claim 2, characterized in that, The parking space information includes the parking space tilt angle and the corner coordinates of the parking space. Determining the number of parking spaces on the layout path based on the parking space information and the fault information includes: Determine the starting and ending points of the layout path; Based on the faulty object information, the starting point, and the ending point, determine the first distance between the starting point and the nearest faulty object, the second distance between any two adjacent faulty objects, and the third distance between the ending point and the nearest faulty object; Based on the corner coordinates and the parking space tilt angle, determine the required width of the angled parking space; The number of first angled parking spaces, the number of second angled parking spaces, and the number of third angled parking spaces are determined based on the first distance, the second distance, the third distance, and the occupied width. Wherein, the number of the first angled parking spaces is the number of parking spaces between the starting point and the nearest faulty object, the number of the second angled parking spaces is the number of parking spaces between every two adjacent faulty objects, and the number of the third angled parking spaces is the number of parking spaces between the ending point and the nearest faulty object.

5. The method according to claim 2, characterized in that, The parking space information includes parking space insertion points, and the step of arranging the parking spaces sequentially along the straight line according to the number of parking spaces includes: Determine the insertion position of the parking space insertion point; Based on the insertion position, determine the target location of the parking space to be arranged; Based on the number of parking spaces, the parking spaces are arranged sequentially along the straight line at the target location of the straight line.

6. The method according to claim 1, characterized in that, The step of determining the corresponding parking space layout method based on the type of the layout path, and further, based on the parking space information and fault information, arranging parking spaces along the layout path in the parking area using the corresponding parking space layout method, includes: If the type of the layout path is a polyline, then the target angle of the polyline is determined according to the parking space layout method; On the target angle side, based on the parking space information and the fault information, the parking spaces are arranged along each straight line in the arrangement path within the parking area.

7. The method according to claim 6, characterized in that, Determining the target angle of the broken line based on the parking space layout includes: If the parking space arrangement is an inner circle arrangement, then the target angle is the smallest angle of the broken line; If the parking space arrangement is an outer ring arrangement, then the target angle is the maximum angle of the broken line.

8. A parking space arrangement device, characterized in that, The device includes: The layout path acquisition module is used to acquire the layout path within the parking area, wherein the layout path is of the type of curve, straight line or polyline; The setting instruction acquisition module is used to acquire parameter setting instructions for parking spaces; the parameter setting instructions include parking space information and fault information; A parking space arrangement module is used to arrange parking spaces along the arrangement path in the parking area based on the parking space information and the faulty object information. The parking space information includes the length and width of the parking space, and the parking space arrangement module also includes a second arrangement unit and a parking space deletion unit; The second arrangement unit is used to arrange the parking spaces sequentially along the arrangement path in the parking area from the starting arrangement point to the ending arrangement point, according to the length and width of the parking space. The parking space deletion unit is used to delete parking spaces that overlap with the faulty object based on the faulty object information and the arranged parking spaces; wherein, if a part of the parking space intersects with the boundary of the faulty object, the parking space intersecting with the boundary of the faulty object is deleted. The step of arranging parking spaces along the arrangement path in the parking area based on the parking space information and the faulty object information is achieved through the following steps: Determine whether there is a straight line in the arrangement path. If there is a straight line in the arrangement path, then determine whether there is a certain angle between the multiple straight lines included in the arrangement path. If there is, then the arrangement path is determined to be a broken line. If not, then the arrangement path is determined to be a straight line. If there is no straight line in the arrangement path, then the arrangement path is determined to be a curve. Based on the type of the layout path, the corresponding parking space layout method is determined. Further, based on the parking space information and fault information, the corresponding parking space layout method is used to arrange parking spaces along the layout path in the parking area.

9. A readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 7.

10. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 7.

Images