A dynamic setting method of parking lot based on space planning

Abstract

The application provides a dynamic setting method of a parking lot based on space planning, and relates to the technical field of dynamic setting of parking lots. The dynamic setting method of the parking lot based on space planning can generate a virtual parking frame according to the size of a vehicle body, virtually mark the parking lot with a corner point of the virtual parking frame as a base point, divide the parking lot into multiple virtual parking spaces for parking of vehicles, and send new or missing base points in a base point set Q when each vehicle enters or leaves. The parking space is re-marked according to the dynamic change of the base points in the base point set Q, a method of dynamically planning the parking space according to the size of the vehicle is realized, the parking lot without planned solid parking spaces is orderly parked, and the utilization rate of the parking lot is improved.

Description

Technical Field

[0001] This invention relates to the field of dynamic parking lot setup technology, and specifically to a method for dynamic parking lot setup based on spatial planning. Background Technology

[0002] Currently, some parking lots lack designated solid-line parking spaces. Operators typically park haphazardly based on the size of the area. For example, bus depots often have a large number of buses. If a depot has 10 bus routes, each with 10 buses, then the depot needs to plan parking for 100 buses. If this haphazard parking continues, it will result in a chaotic parking situation and increase the risk of collisions.

[0003] Furthermore, the bus station can provide parking services for external vehicles as much as possible when the parking spaces are vacant. However, the size of external vehicles is different from that of buses. If fixed solid-line parking spaces are used, the utilization rate of the parking lot will be low. How to dynamically plan parking spaces according to the size of vehicles is a problem to be solved. Summary of the Invention

[0004] The purpose of this invention is to provide a dynamic parking lot layout method based on spatial planning. A virtual parking frame is generated based on the vehicle's size. A corner point of this virtual parking frame is used as a base point to virtually mark lines across the parking lot, dividing it into multiple virtual parking spaces for vehicles. Each time a vehicle enters or exits, a base point in the base point set Q is added or removed. Based on the dynamic changes in the base points in the base point set Q, the parking space is re-marked. This method achieves dynamic parking space planning based on vehicle size, enabling orderly parking in parking lots without pre-planned solid-line parking spaces and improving parking lot utilization.

[0005] To solve the above-mentioned technical problems, the present invention adopts the following solution:

[0006] A dynamic parking lot setup method based on spatial planning, applied when a vehicle enters, the method includes the following steps:

[0007] S1: At time t, obtain vehicle information of a vehicle entering the parking lot and the current display information of the parking lot. The display information of the parking lot includes a coordinate system with the edge of the parking lot as the X-axis and Y-axis, and at least one virtual parking space.

[0008] S2: Match the vehicle information with at least one virtual parking space in the displayed information at least once, and according to the matching result, park the vehicle orthogonally in the virtual parking space with the highest matching degree in the X-axis and Y-axis directions;

[0009] S3: Generate a virtual parking frame based on the vehicle information, take a corner point of the virtual parking frame as the base point Qx, and update the base point set Q{Q1,Q2,…,Qn} according to the intersection relationship between the base point Qx of the virtual parking frame and the edge of the parking lot or the edge of other virtual parking frames. The base point set Q{Q1,Q2,…,Qn} is a base point set Q{Q1,Q2,…,Qn} sorted by time from earliest to latest. "Q1,Q2,…,Qn" are the base points of the virtual parking frame.

[0010] S4: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence and draw a virtual line. Update the virtual parking space in the current parking lot display information according to the drawing result.

[0011] S4: At time t+1, obtain vehicle information of a vehicle entering the parking lot and the current parking lot display information, and proceed to step S2.

[0012] Furthermore, the base points include base points that do not intersect with the edge lines of the parking lot or other virtual parking frames, and base points that intersect with the edge lines of the parking lot or other virtual parking frames.

[0013] Furthermore, in S3, the specific process of updating the base point set Q{Q1,Q2,…,Qn} based on the intersection relationship between the base point Qx and the edge of the parking lot or other virtual parking frames is as follows:

[0014] Determine whether the base point Qx intersects with the edge of the parking lot or the edge of other virtual parking frames. If yes, do not update the base point set Q{Q1,Q2,…,Qn}. If no, check whether the base points in the current base point set Q{Q1,Q2,…,Qn} intersect with the edge of the parking lot or the edge of other virtual parking frames. Remove the base points that intersect with the edge of the parking lot or the edge of other virtual parking frames from the base point set Q{Q1,Q2,…,Qn} and add the base point Qx to the base point set Q{Q1,Q2,…,Qn}.

[0015] Furthermore, the specific process in S4 is as follows:

[0016] Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence as the starting point of the virtual line segment, and take the edge line of the parking lot or the edge line of other virtual parking garages as the ending point of the virtual line segment. Draw lines according to the XY axis direction of the parking lot, and divide the parking lot into multiple virtual parking spaces according to the virtual line segments.

[0017] Furthermore, a virtual parking frame is located within a virtual parking space.

[0018] Furthermore, the vehicle information includes the time the vehicle entered the parking lot, the vehicle's size, and the vehicle's front direction. The virtual parking frame is a parallelogram that is proportionally enlarged to the vehicle's size.

[0019] A dynamic parking lot setup method based on spatial planning, applied when a vehicle leaves, the method includes the following steps:

[0020] S1: At time t, obtain vehicle information of a vehicle leaving the parking lot and the current parking lot display information. The parking lot display information includes a coordinate system with the edge of the parking lot as the X-axis and Y-axis, the virtual parking frame where the vehicle is located, and a base point set Q{Q1,Q2,…,Qn}. The base point set Q{Q1,Q2,…,Qn} is a base point set Q{Q1,Q2,…,Qn} sorted from earliest to latest according to time. "Q1,Q2,…,Qn" are the base points of the virtual parking frame. The base point is a corner point of the virtual parking frame. The base point set Q{Q1,Q2,…,Qn} includes the base point Qx of the virtual parking frame where the vehicle is located.

[0021] S2: Remove the virtual parking frame containing the vehicle from the displayed information, remove the base point Qx of the virtual parking frame containing the vehicle from the base point set Q{Q1,Q2,…,Qn}, and update the base point set Q{Q1,Q2,…,Qn} according to the intersection relationship between the base point and the edge of the parking lot or the edge of other virtual parking frames;

[0022] S3: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence and draw a virtual line. Update the display information of the parking lot according to the drawing result.

[0023] S4: At time t+1, obtain vehicle information of a vehicle leaving the parking lot and the current parking lot display information, and proceed to step S2.

[0024] Furthermore, the base points include base points that do not intersect with the edge lines of the parking lot or other virtual parking frames, and base points that intersect with the edge lines of the parking lot or other virtual parking frames. In S2, the process of updating the base point set Q{Q1,Q2,…,Qn} is as follows:

[0025] Determine whether any base point in the current base point set Q{Q1,Q2,…,Qn} intersects with the edge of the parking lot or the edge of other virtual parking frames. If so, remove the base point that intersects with the edge of the parking lot or the edge of other virtual parking frames from the base point set Q{Q1,Q2,…,Qn}.

[0026] Furthermore, the parking lot display information also includes at least one virtual parking space and at least one virtual line segment.

[0027] Furthermore, the specific process in S3 is as follows:

[0028] Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence as the starting point of the virtual line segment, and take the edge line of the parking lot or the edge line of other virtual parking garages as the ending point of the virtual line segment. Draw lines according to the XY axis direction of the parking lot, and divide the parking lot into multiple virtual parking spaces according to the virtual line segments.

[0029] The beneficial effects of this invention are:

[0030] This invention provides a dynamic parking lot layout method based on spatial planning. The method generates a virtual parking frame based on the vehicle's size, uses a corner point of this virtual parking frame as a base point to virtually mark lines across the parking lot, dividing it into multiple virtual parking spaces for vehicles. Each time a vehicle enters or exits, a base point in the base point set Q is added or removed. Based on the dynamic changes in the base points in the base point set Q, the parking space is re-marked. This method enables dynamic parking space planning based on vehicle size, allowing for orderly parking in parking lots without pre-planned solid-line parking spaces and improving parking lot utilization.

[0031] The virtual parking frame is a parallelogram that is proportionally enlarged to the size of the vehicle. The edges of the virtual parking frame are a certain distance from the actual outline of the vehicle. Enlarging the virtual parking frame is to leave a passageway between two vehicles to facilitate their entry or exit.

[0032] Furthermore, the vehicle is orthogonally parked in the virtual parking space with the highest matching degree along the X and Y axes, so that the edge line of the virtual parking frame is parallel to the edge line of the parking lot, and the parking angle of the vehicle in the virtual parking space is fixed, which facilitates the parking of the vehicle and the aesthetics of the parking lot.

[0033] In addition, when a vehicle is parked, the present invention can match the vehicle information with the information of the virtual parking space and select the virtual parking space with the highest matching degree for parking. Attached Figure Description

[0034] Figure 1 This is an interactive schematic diagram of a dynamic parking lot setting method based on spatial planning in Embodiment 1 of the present invention;

[0035] Figure 2 This is a schematic diagram of the parking lot after vehicle a enters the parking lot in Embodiment 1 of the present invention;

[0036] Figure 3This is a schematic diagram of the parking lot after vehicle b enters the parking lot in Embodiment 1 of the present invention;

[0037] Figure 4 This is a schematic diagram of the parking lot after vehicle c enters the parking lot in Embodiment 1 of the present invention;

[0038] Figure 5 This is an interactive schematic diagram of a dynamic parking lot setting method based on spatial planning in Embodiment 2 of the present invention;

[0039] Figure 6 This is a schematic diagram of the parking lot after vehicles a, b, c, d, and e enter the parking lot in sequence, as shown in Embodiment 2 of the present invention.

[0040] Figure 7 This is a schematic diagram of the parking lot after vehicle d leaves the parking lot in Embodiment 2 of the present invention. Detailed Implementation

[0041] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. The following description of at least one exemplary embodiment is merely illustrative and is in no way intended to limit the present invention or its application or use. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0042] Unless otherwise specifically stated, the relative arrangement, numerical expressions, and values ​​of the components and steps described in these embodiments do not limit the scope of the invention.

[0043] At the same time, it should be understood that, for ease of description, the dimensions of the various parts shown in the accompanying drawings are not drawn according to actual scale.

[0044] Furthermore, for clarity and brevity, descriptions of well-known structures, functions, and configurations may have been omitted. Those skilled in the art will recognize that various changes and modifications can be made to the examples described herein without departing from the spirit and scope of this disclosure.

[0045] Techniques, methods, and equipment known to those skilled in the art may not be discussed in detail, but where appropriate, such techniques, methods, and equipment should be considered part of the specification.

[0046] In all examples shown and discussed herein, any specific values ​​should be interpreted as merely exemplary and not as limitations. Therefore, other examples of exemplary embodiments may have different values.

[0047] The present invention will now be described in detail with reference to the accompanying drawings and embodiments:

[0048] Currently, some parking lots lack designated solid-line parking spaces. Operators typically park haphazardly based on the size of the area. For example, bus depots often have a large number of buses. If a depot has 10 bus routes, each with 10 buses, then the depot needs to plan parking for 100 buses. If this haphazard parking continues, it will result in a chaotic parking situation and increase the risk of collisions.

[0049] Furthermore, the bus depot can provide parking services for external vehicles as much as possible when parking spaces are vacant. However, the size of external vehicles is different from that of buses. If fixed-line parking spaces are used, the utilization rate of the parking lot will be low. How to dynamically plan parking spaces according to vehicle size is a problem to be solved. Therefore, this invention provides a dynamic parking lot setting method based on spatial planning, which can solve the above problems. The specific implementation is illustrated in the following embodiments.

[0050] Example 1

[0051] A dynamic parking lot setup method based on spatial planning, applied when a vehicle enters, the method includes the following steps:

[0052] S1: At time t, obtain vehicle information of a vehicle entering the parking lot and the current display information of the parking lot. The display information of the parking lot includes a coordinate system with the edge of the parking lot as the X-axis and Y-axis, and at least one virtual parking space.

[0053] S2: Match the vehicle information with at least one virtual parking space in the displayed information at least once, and according to the matching result, park the vehicle orthogonally in the virtual parking space with the highest matching degree in the X-axis and Y-axis directions;

[0054] S3: Generate a virtual parking frame based on the vehicle information, take a corner point of the virtual parking frame as the base point Qx, and update the base point set Q{Q1,Q2,…,Qn} according to the intersection relationship between the base point Qx of the virtual parking frame and the edge of the parking lot or the edge of other virtual parking frames. The base point set Q{Q1,Q2,…,Qn} is a base point set Q{Q1,Q2,…,Qn} sorted by time from earliest to latest. "Q1,Q2,…,Qn" are the base points of the virtual parking frame.

[0055] S4: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence and draw a virtual line. Update the virtual parking space in the current parking lot display information according to the drawing result.

[0056] S4: At time t+1, obtain vehicle information of a vehicle entering the parking lot and the current parking lot display information, and proceed to step S2.

[0057] Preferably, the base points include base points that do not intersect with the edge line of the parking lot or the edge line of other virtual parking frames, and base points that intersect with the edge line of the parking lot or the edge line of other virtual parking frames.

[0058] Preferably, in S3, the specific process of updating the base point set Q{Q1,Q2,…,Qn} based on the intersection relationship between the base point Qx and the edge line of the parking lot or other virtual parking frames is as follows:

[0059] Determine whether the base point Qx intersects with the edge of the parking lot or the edge of other virtual parking frames. If yes, do not update the base point set Q{Q1,Q2,…,Qn}. If no, check whether the base points in the current base point set Q{Q1,Q2,…,Qn} intersect with the edge of the parking lot or the edge of other virtual parking frames. Remove the base points that intersect with the edge of the parking lot or the edge of other virtual parking frames from the base point set Q{Q1,Q2,…,Qn} and add the base point Qx to the base point set Q{Q1,Q2,…,Qn}.

[0060] Preferably, the specific process in S4 is as follows:

[0061] Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence as the starting point of the virtual line segment, and take the edge line of the parking lot or the edge line of other virtual parking garages as the ending point of the virtual line segment. Draw lines according to the XY axis direction of the parking lot, and divide the parking lot into multiple virtual parking spaces according to the virtual line segments.

[0062] Preferably, a virtual parking frame is located within a virtual parking space.

[0063] Preferably, the vehicle information includes the time the vehicle entered the parking lot, the vehicle's size, and the vehicle's front direction, and the virtual parking frame is a parallelogram that is proportionally enlarged according to the vehicle's size.

[0064] Based on the above principles, the present invention will be further described as follows:

[0065] like Figure 1As shown, the present invention provides a dynamic setting method for a parking lot based on spatial planning, which is applied when a vehicle enters. By taking a corner point of a virtual parking frame as a base point to perform virtual marking of the parking lot, the parking lot is divided into a plurality of virtual parking spaces for vehicles to park. When each vehicle enters, the base point set Q may change accordingly. The parking spaces are re-marked according to the dynamic changes of the base points in the base point set Q, so as to implement a method for dynamically planning parking spaces according to vehicle sizes, so that the parking lot without pre-planned solid-line parking spaces can achieve orderly parking, and the utilization rate of the parking lot is improved.

[0066] Wherein, the base point set Q, the virtual parking frames, the virtual parking spaces and virtual line segments are all displayed as display information of the parking lot, which is convenient for operators to command the parking of vehicles or directly send guidance routes to drivers.

[0067] Specifically, in actual operation, the lower left corner of the parking lot is generally selected as the origin of the parking lot coordinate system, then the lower side of the parking lot is taken as the X-axis and the left side of the parking lot is taken as the Y-axis to establish a coordinate system. Based on the established coordinate system, when the first vehicle selects a parking position, it will choose to park against the lower left corner of the parking lot. At this time, only the top-right corner point of the virtual parking frame of the vehicle does not intersect with the boundary lines of the parking lot, so the top-right corner point is generally selected as the base point for virtual marking.

[0068] When a vehicle enters, a new virtual parking frame will be generated in the parking lot, and the base points in the base point set Q are the base points of the virtual parking frames. In order to adopt the virtual marking method, it is required that the base points in the base point set Q are always base points that do not intersect with the boundary lines of the parking lot or the boundary lines of other virtual parking frames, so the base point set Q in the present invention needs to be dynamically updated according to the entry of vehicles.

[0069] When the parking lot obtains the vehicle information of vehicle a entering the parking lot at time t1, the vehicle a is selected to be parked at the lower left corner of the parking lot coordinate system, then a virtual parking frame is generated by proportional amplification according to the body size of vehicle a. Since vehicle a is the first vehicle, the top-right corner point does not intersect with the boundary lines of the parking lot or the boundary lines of virtual parking spaces, so the top-right corner point of vehicle a is directly taken as the base point to generate a base point set Q{Qa}. Marking is carried out along the X-axis direction and Y-axis direction respectively, with the base point as the starting point of the virtual line segment and the boundary line of the parking lot or the boundary line of a virtual parking space as the end point of the virtual line segment, as Figure 1 shown, the parking lot is divided into three virtual parking spaces.

[0070] When the parking lot obtains the vehicle information of vehicle b entering the parking lot at time t2 (t1<t2), the vehicle information of vehicle b is compared with that of Figure 1The matching degree calculation is performed on the information of the virtual parking space 1, the virtual parking space 2, and the virtual parking space 3 as shown. The vehicle information includes the time when the vehicle enters the parking lot, the body size of the vehicle, and the heading direction of the vehicle. The information of the virtual parking space includes the size, direction and position of the virtual parking space. The matching degree can be obtained through a trained matching model, and no redundant description is given herein.

[0071] If it is obtained that the matching degree between the virtual parking space 3 and the vehicle b is the highest, the vehicle b is parked in the virtual parking space 3, and each parking is performed based on the lower left corner of the coordinate system.

[0072] After the vehicle b is parked, a virtual parking frame of the vehicle b is generated. Since the upper right corner point of the virtual parking frame does not intersect with the boundary line of the parking lot or the boundary line of the virtual parking space, the upper right corner point is taken as a base point, and the base point is added to the base point set Q. Since the time of the base point is later than the base point of the vehicle a, the base points in the base point set Q are updated to {Qa, Qb}.

[0073] Then, one base point is sequentially selected from the base point set Q {Qa, Qb} for virtual scribing. The base point is used as the starting point of the virtual line segment, and the boundary line of the parking lot or the boundary line of the virtual parking space is used as the end point of the virtual line segment. Scribing is performed in the X-axis direction and Y-axis direction respectively. Figure 3 As shown, the parking lot is divided into five new virtual parking spaces.

[0074] When the parking lot obtains the vehicle information of the vehicle c entering the parking lot at time t3 (t2<t3), the vehicle information of the vehicle c is respectively compared with the information of Figure 2 the virtual parking space 1, virtual parking space 2, virtual parking space 3, virtual parking space 4, and virtual parking space 5 as shown for matching degree calculation. If the vehicle c is parked in the virtual parking space 3, and a virtual parking frame of the vehicle c is generated, the width of the virtual parking frame is the same as that of the virtual parking frame of the vehicle b, and the length of the virtual parking frame is exactly equal to the difference between the length of the virtual parking frame of the vehicle a minus the length of the virtual parking frame of the vehicle b, which is as shown in Figure 4 the figure.

[0075] Then, according to that the base point of the vehicle c does not intersect with the boundary line of the parking lot or the boundary line of other virtual parking frames, it is determined whether the base points in the current base point set Q {Qa, Qb} intersect with the boundary line of the parking lot or the boundary line of other virtual parking frames. Since both Qa and Qb intersect with the boundary line of the virtual parking frame, Qa and Qb are removed from the base point set Q, the base point of the vehicle c is added to the base point set Q, the base points in the base point set Q are updated to {Qc}, and then one base point is sequentially selected from the base point set Q {Qc} for virtual scribing, as shown in Figure 4As shown, the parking lot is divided into three new virtual parking spaces.

[0076] This invention provides a dynamic parking lot setting method based on spatial planning. Whenever a vehicle enters the parking lot, the virtual parking spaces in the parking lot are dynamically updated by virtual marking, and parking spaces are dynamically planned according to the size of the vehicle, which can improve the utilization rate of parking lots without fixed parking space planning.

[0077] Example 2

[0078] A dynamic parking lot setup method based on spatial planning, applied when a vehicle leaves, the method includes the following steps:

[0079] S1: At time t, obtain vehicle information of a vehicle leaving the parking lot and the current parking lot display information. The parking lot display information includes a coordinate system with the edge of the parking lot as the X-axis and Y-axis, the virtual parking frame where the vehicle is located, and a base point set Q{Q1,Q2,…,Qn}. The base point set Q{Q1,Q2,…,Qn} is a base point set Q{Q1,Q2,…,Qn} sorted from earliest to latest according to time. "Q1,Q2,…,Qn" are the base points of the virtual parking frame. The base point is a corner point of the virtual parking frame. The base point set Q{Q1,Q2,…,Qn} includes the base point Qx of the virtual parking frame where the vehicle is located.

[0080] S2: Remove the virtual parking frame containing the vehicle from the displayed information, remove the base point Qx of the virtual parking frame containing the vehicle from the base point set Q{Q1,Q2,…,Qn}, and update the base point set Q{Q1,Q2,…,Qn} according to the intersection relationship between the base point and the edge of the parking lot or the edge of other virtual parking frames;

[0081] S3: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence and draw a virtual line. Update the display information of the parking lot according to the drawing result.

[0082] S4: At time t+1, obtain vehicle information of a vehicle leaving the parking lot and the current parking lot display information, and then proceed to step S2.

[0083] Preferably, the base points include base points that do not intersect with the edge lines of the parking lot or other virtual parking frames, and base points that intersect with the edge lines of the parking lot or other virtual parking frames. In S2, the process of updating the base point set Q{Q1,Q2,…,Qn} is as follows:

[0084] Determine whether any base point in the current base point set Q{Q1,Q2,…,Qn} intersects with the edge of the parking lot or the edge of other virtual parking frames. If so, remove the base point that intersects with the edge of the parking lot or the edge of other virtual parking frames from the base point set Q{Q1,Q2,…,Qn}.

[0085] Preferably, the parking lot display information also includes at least one virtual parking space and at least one virtual line segment.

[0086] Preferably, the specific process in S3 is as follows:

[0087] Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence as the starting point of the virtual line segment, and take the edge line of the parking lot or the edge line of other virtual parking garages as the ending point of the virtual line segment. Draw lines according to the XY axis direction of the parking lot, and divide the parking lot into multiple virtual parking spaces according to the virtual line segments.

[0088] Based on the above principles, the present invention will be further described as follows:

[0089] This invention provides a method for dynamically setting up parking lots based on spatial planning, such as... Figure 1 As shown, when a vehicle leaves, the base point set Q may change accordingly. Based on the dynamic changes of the base points in the base point set Q, the parking space is re-virtually marked, so that the virtual parking space can be re-planned according to the departure of the vehicle, thereby improving the utilization rate of the parking lot.

[0090] The parking lot is equipped with virtual parking frames for vehicles. These virtual parking frames are scaled up to the size of the vehicles. The parking lot's X-axis, Y-axis, base point set Q, virtual parking frames, virtual parking spaces, and virtual line segments are all displayed as parking lot information, facilitating operators to direct vehicle parking or send route guidance directly to drivers.

[0091] If the parking lot also chooses the lower left corner of the parking lot as the origin of the parking lot coordinate system, and then establishes a coordinate system with the bottom of the parking lot as the X-axis and the left side of the parking lot as the Y-axis, then when the first car chooses a parking position, it will choose to park near the lower left corner of the parking lot. In this case, the corner point of the virtual parking frame of the car will only have the upper right corner point that does not intersect with the edge line of the parking lot. Therefore, the upper right corner point is usually chosen as the base point for virtual line drawing.

[0092] When a vehicle leaves, the virtual parking frame containing the vehicle is removed from the displayed information. The base points in the base point set Q are the base points of the virtual parking frame. In order to use the virtual line drawing method, the base points in the base point set Q must always be base points that do not intersect with the edge line of the parking lot or the edge line of other virtual parking frames. Therefore, the base point set Q in this invention needs to be dynamically updated according to the departure of the vehicle.

[0093] For example, the current parking lot display information includes a coordinate system with the parking lot's edge as the XY axis, virtual parking frames for vehicle a, vehicle b, vehicle c, vehicle d, and vehicle e, virtual parking space 1, virtual parking space 2, virtual parking space 3, virtual parking space 4, virtual parking space 5, and a base point set Q{Qe,Qd}, where base points Qe and Qd in the base point set are the base points for vehicle e and vehicle d, respectively. Figure 6 As shown.

[0094] When vehicle d leaves the parking lot, the virtual parking frame containing vehicle d is removed from the displayed information, and the base point Qd of the virtual parking frame containing vehicle d is removed from the base point set Q{Qe,Qd}. The current base point set Q{Qe} is updated according to the intersection relationship between the base point and the edge of the parking lot or the edge of other virtual parking frames. If a base point in the current base point set Q intersects with the edge of the parking lot or the edge of other virtual parking frames, the base point intersecting with the edge of the parking lot or the edge of other virtual parking frames is removed from the base point set Q.

[0095] Since the base point Qe in the current base point set Q{Qe} does not intersect with the edge line of the parking lot or other virtual parking spaces, there is no need to update the current base point set Q{Qe}. Then, a base point is sequentially selected from the base point set Q{Qe} for virtual line drawing, using base point Qe as the starting point of the virtual line segment and the edge line of the parking lot or virtual parking space as the ending point. Lines are drawn along the X-axis and Y-axis directions respectively. Figure 7 As shown, the parking lot is divided into three new virtual parking spaces.

[0096] Therefore, the present invention provides a dynamic parking lot setting method based on spatial planning. Whenever a vehicle leaves the parking lot, the virtual parking spaces of the parking lot are dynamically updated by virtual marking, and parking spaces are dynamically planned according to the size of the vehicle, which can improve the utilization rate of parking lots without fixed parking spaces.

[0097] Example 3

[0098] This embodiment provides a computer-readable storage medium, including: one or more processors; and a storage unit for storing one or more programs, which, when executed by the one or more processors, enable the one or more processors to implement a method for monitoring river floating pollutants according to Embodiment 1 or Embodiment 2.

[0099] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0100] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and the blocks within the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions.

[0101] Or a combination of boxes. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing device to produce a machine, such that the instructions, which are executable by the processor of the computer or other programmable data processing device, produce instructions for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0102] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0103] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment, whereby a series of operational steps are performed to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0104] The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention in any way. Based on the technical essence of the present invention, any simple modifications, equivalent substitutions, and improvements made to the above embodiments within the spirit and principles of the present invention shall still fall within the protection scope of the present invention.

Claims

1. A method for dynamically setting up parking lots based on spatial planning, characterized in that, When applied to vehicle entry, the method includes the following steps: S1: At time t, obtain vehicle information of a vehicle entering the parking lot and the current display information of the parking lot. The display information of the parking lot includes a coordinate system with the edge of the parking lot as the X-axis and Y-axis, and at least one virtual parking space. S2: Match the vehicle information with at least one virtual parking space in the displayed information at least once, and according to the matching result, park the vehicle orthogonally in the virtual parking space with the highest matching degree in the X-axis and Y-axis directions; S3: Generate a virtual parking frame based on the vehicle information, take a corner point of the virtual parking frame as the base point Qx, and update the base point set Q{Q1,Q2,…,Qn} according to the intersection relationship between the base point Qx of the virtual parking frame and the edge of the parking lot or the edge of other virtual parking frames. The base point set Q{Q1,Q2,…,Qn} is a base point set Q{Q1,Q2,…,Qn} sorted by time from earliest to latest, and "Q1,Q2,…,Qn" is the base point of the virtual parking frame; S4: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence and draw a virtual line. Update the virtual parking space in the current parking lot display information according to the drawing result. S4: At time t+1, obtain vehicle information of a vehicle entering the parking lot and the current parking lot display information, and proceed to step S2.

2. The method for dynamically setting up parking lots based on spatial planning according to claim 1, characterized in that, The base points include base points that do not intersect with the edge lines of the parking lot or other virtual parking frames, and base points that intersect with the edge lines of the parking lot or other virtual parking frames.

3. The method for dynamically setting up parking lots based on spatial planning according to claim 2, characterized in that, In S3, the specific process of updating the base point set Q{Q1,Q2,…,Qn} based on the intersection relationship between the base point Qx and the edge of the parking lot or other virtual parking frames is as follows: Determine whether the base point Qx intersects with the edge of the parking lot or the edge of other virtual parking frames. If yes, do not update the base point set Q{Q1,Q2,…,Qn}. If no, check whether the base points in the current base point set Q{Q1,Q2,…,Qn} intersect with the edge of the parking lot or the edge of other virtual parking frames. Remove the base points that intersect with the edge of the parking lot or the edge of other virtual parking frames from the base point set Q{Q1,Q2,…,Qn} and add the base point Qx to the base point set Q{Q1,Q2,…,Qn}.

4. The method for dynamically setting up parking lots based on spatial planning according to claim 1, characterized in that, The specific process in S4 is as follows: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence as the starting point of the virtual line segment, and take the edge line of the parking lot or the edge line of other virtual parking garages as the ending point of the virtual line segment. Draw lines according to the XY axis direction of the parking lot, and divide the parking lot into multiple virtual parking spaces according to the virtual line segments.

5. The method for dynamically setting up parking lots based on spatial planning according to claim 1, characterized in that, A virtual parking box is located within a virtual parking space.

6. The method for dynamically setting up parking lots based on spatial planning according to claim 1, characterized in that, The vehicle information includes the time the vehicle entered the parking lot, the vehicle's size, and the direction the vehicle is facing. The virtual parking frame is a parallelogram that is proportionally enlarged to the size of the vehicle.

7. A method for dynamically setting up parking lots based on spatial planning, characterized in that, When applied to the departure of a vehicle, the method includes the following steps: S1: At time t, obtain vehicle information of a vehicle leaving the parking lot and the current display information of the parking lot. The display information of the parking lot includes a coordinate system with the edge of the parking lot as the X-axis and Y-axis, the virtual parking frame where the vehicle is located, and the base point set Q{Q1,Q2,…,Qn}. The base point set Q{Q1,Q2,…,Qn} is a set of base points sorted from earliest to latest according to time. "Q1,Q2,…,Qn" is the base point of the virtual parking frame. The base point is a corner point of the virtual parking frame. The base point set Q{Q1,Q2,…,Qn} includes the base point Qx of the virtual parking frame where the vehicle is located. S2: Remove the virtual parking frame containing the vehicle from the displayed information, remove the base point Qx of the virtual parking frame containing the vehicle from the base point set Q{Q1,Q2,…,Qn}, and update the base point set Q{Q1,Q2,…,Qn} according to the intersection relationship between the base point and the edge of the parking lot or the edge of other virtual parking frames; S3: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence and draw a virtual line. Update the display information of the parking lot according to the drawing result. S4: At time t+1, obtain vehicle information of a vehicle leaving the parking lot and the current parking lot display information, and then proceed to step S2.

8. The method for dynamically setting up parking lots based on spatial planning according to claim 7, characterized in that, The base points include base points that do not intersect with the edge lines of the parking lot or other virtual parking frames, and base points that intersect with the edge lines of the parking lot or other virtual parking frames. In S2, the process of updating the base point set Q{Q1,Q2,…,Qn} is as follows: Determine whether any base point in the current base point set Q{Q1,Q2,…,Qn} intersects with the edge of the parking lot or the edge of other virtual parking frames. If so, remove the base point that intersects with the edge of the parking lot or the edge of other virtual parking frames from the base point set Q{Q1,Q2,…,Qn}.

9. A method for dynamically setting up parking lots based on spatial planning according to claim 7, characterized in that, The parking lot display information also includes at least one virtual parking space and at least one virtual line segment.

10. A method for dynamically setting up parking lots based on spatial planning according to claim 8, characterized in that, The specific process in S3 is as follows: Take one base point from the base point set Q{Q1,Q2,…,Qn} in sequence as the starting point of the virtual line segment, and take the edge line of the parking lot or the edge line of other virtual parking garages as the ending point of the virtual line segment. Draw lines according to the XY axis direction of the parking lot, and divide the parking lot into multiple virtual parking spaces according to the virtual line segments.

Images