Parking fence generation method, device and readable storage medium

Abstract

The present disclosure relates to a parking fence generation method, device and readable storage medium, the method comprising: acquiring at least two sampling points of a set road; for each first sampling point of the at least two sampling points, acquiring an index value of the first sampling point, wherein the first sampling point is any sampling point of the at least two sampling points, and the index value is a value for reflecting the parking demand of a vehicle; according to at least one second sampling point of the at least two sampling points, performing cutting processing on the set road to obtain each first road segment of the set road, wherein the index value of any second sampling point is less than or equal to the index value of other sampling points of the at least two sampling points except the at least one second sampling point; and generating a parking fence corresponding to each first road segment.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to the field of vehicle technology, and more specifically, to a parking fence generation method, device, and readable storage medium. Background Art

[0002] To regulate the parking of vehicles, an electronic parking fence can be set up. In this way, users need to park their vehicles in the parking fence according to the regulations.

[0003] In one feasible implementation, parking fences can be generated by manually drawing fences based on experience or requirements of stakeholders, but this implementation requires a large amount of manpower.

[0004] Another feasible implementation approach is to use a clustering algorithm to aggregate parking fences from positioning points (such as vehicle lock / unlock locations). However, this approach relies heavily on suitable clustering parameters, which are often difficult to find, resulting in poor parking fence generation. Summary of the Invention

[0005] One purpose of the embodiments of the present disclosure is to provide a new technical solution for generating parking fences.

[0006] According to a first aspect of the present disclosure, a parking fence generation method is provided, comprising: obtaining at least two sampling points of a set road; for each first sampling point of the at least two sampling points, obtaining an index value of the first sampling point, wherein the first sampling point is any sampling point of the at least two sampling points, and the index value is a value used to reflect the parking demand of the vehicle; according to at least one second sampling point of the at least two sampling points, cutting the set road to obtain each first road segment of the set road, wherein the index value of any second sampling point is less than or equal to the index value of other sampling points of the at least two sampling points except the at least one second sampling point; and generating a parking fence corresponding to each first road segment.

[0007] Optionally, the step of performing segmentation processing on the set road based on at least one second sampling point among the at least two sampling points to obtain each first road segment of the set road includes: performing segmentation processing on the set road based on at least one second sampling point among the at least two sampling points to obtain at least two second road segments; for each second road segment, determining whether the second road segment is a road segment that can be segmented; if the second road segment is a road segment that can be segmented, using the second road segment as a new set road and performing the step of obtaining at least two sampling points of the set road; if the second road segment is not a road segment that can be segmented, using the second road segment as the first road segment.

[0008] Optionally, before performing the cutting process on the set road based on at least one second sampling point among the at least two sampling points, the method further includes: determining a minimum index value among index values ​​of the at least two sampling points; wherein the second sampling point is the sampling point having the minimum index value.

[0009] Optionally, when the number of the second sampling points is greater than or equal to 2, the distance between any two adjacent second sampling points on the set road is greater than or equal to a set interval threshold.

[0010] Optionally, the method further includes: dividing a set map including the set road into grids; determining an index value for each of the grids based on a historical parking position of the vehicle on the set map; and obtaining the index value of the first sampling point includes: determining a first grid including the first sampling point; and obtaining the index value of the first sampling point based on the index value of the first grid.

[0011] Optionally, obtaining the index value of the first sampling point based on the index value of the first grid includes: using the index value of the first grid as the index value of the first sampling point; or obtaining a sampling point set including the first sampling point, wherein the sampling point set starts with the first sampling point and is arranged adjacently in sequence along the driving direction of the set road; and using an average of the index values ​​of the grids in which the sampling points in the sampling point set are located as the index value of the first sampling point.

[0012] Optionally, after generating the parking fence corresponding to each of the first road segments, the method further includes: obtaining a fence set, any parking fence in the fence set intersecting with at least one other parking fence in the fence set; for two intersecting parking fences in the fence set, deleting one of the two parking fences.

[0013] Optionally, for two intersecting parking fences in the fence set, deleting one of the two parking fences includes: for two intersecting parking fences in the fence set, determining whether the first road segments corresponding to the two parking fences are respectively a main road segment and a secondary road segment; in the case that the first road segments corresponding to the two parking fences are respectively a main road segment and a secondary road segment, deleting the parking fence corresponding to the main road segment among the two parking fences.

[0014] Optionally, after determining whether the first road segments corresponding to the two parking fences are main road segments and auxiliary road segments respectively, the method further includes: determining whether there are at least two deletion methods, wherein the deletion method is used to indicate the deletion of part of the parking fences in the fence set so that any two remaining parking fences in the fence set do not intersect; in the case where there are at least two deletion methods, determining the vehicle parking demand corresponding to each of the deletion methods to obtain at least two vehicle parking demands; determining the maximum vehicle parking demand among the at least two vehicle parking demands; and performing parking fence deletion processing on the fence set according to the deletion method corresponding to the maximum vehicle parking demand.

[0015] According to the second aspect of the present disclosure, a parking fence generation device is also provided, including: a first acquisition module for acquiring at least two sampling points of a set road; a second acquisition module for acquiring an index value of each first sampling point among the at least two sampling points, wherein the first sampling point is any sampling point among the at least two sampling points, and the index value is a value used to reflect the parking demand of the vehicle; a processing module for cutting the set road according to at least one second sampling point among the at least two sampling points to obtain each first road segment of the set road, wherein the index value of any second sampling point is less than or equal to the index value of other sampling points among the at least two sampling points except the at least one second sampling point; and a generation module for generating a parking fence corresponding to each first road segment.

[0016] According to a third aspect of the present disclosure, a parking fence generation device is also provided, including a memory and a processor, wherein the memory is used to store a computer program; the processor is used to execute the computer program to implement the method described in the first aspect of the present disclosure.

[0017] According to a fourth aspect of the present disclosure, a computer-readable storage medium is further provided, on which a computer program is stored. When the computer program is executed by a processor, the method according to the first aspect of the present disclosure is implemented.

[0018] One advantageous effect of the disclosed embodiments is that at least two sampling points are obtained for a set road; for each first sampling point of the at least two sampling points, an index value is obtained for the first sampling point, wherein the first sampling point is any sampling point of the at least two sampling points, and the index value is a value used to reflect the parking demand of vehicles; the set road is segmented based on at least one second sampling point of the at least two sampling points to obtain each first road segment of the set road, wherein the index value of any second sampling point is less than or equal to the index value of each sampling point of the at least two sampling points except the at least one second sampling point; and a parking fence is generated corresponding to each first road segment. This embodiment segments the road based on sampling points with lower parking demand, thereby separating road segments corresponding to different areas with higher parking demand. Parking fences are then generated based on the segmented road segments. The generated parking fences meet user parking needs and are more effectively generated.

[0019] Other features and advantages of the embodiments of the present disclosure will become apparent from the following detailed description of exemplary embodiments of the present disclosure with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the present disclosure and, together with the description, serve to explain the principles of the embodiments of the present disclosure.

[0021] Figure 1 is a schematic diagram of the composition structure of an electronic device to which a parking fence generation method according to one embodiment can be applied;

[0022] Figure 2 is a flowchart of a method for generating a parking fence according to one embodiment;

[0023] Figure 3 is a flowchart of a method for generating a parking fence according to another embodiment;

[0024] Figure 4 is a block diagram of a parking fence generating device according to one embodiment;

[0025] Figure 5 It is a schematic diagram of the hardware structure of a parking fence generating device according to one embodiment. DETAILED DESCRIPTION

[0026] Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that unless otherwise specifically stated, the relative arrangement of components and steps, numerical expressions and numerical values ​​set forth in these embodiments do not limit the scope of the present invention.

[0027] The following description of at least one exemplary embodiment is merely exemplary in nature and is in no way intended to limit the application or its application or uses.

[0028] Techniques, methods, and apparatus known to those of ordinary skill in the relevant art can not be discussed in detail herein, but should be considered as part of the specification.

[0029] In all of the examples shown and discussed herein, any specific values should be interpreted as merely exemplary, and not as a limitation. Thus, other examples of the exemplary embodiments can have different values.

[0030] It should be noted that like reference numerals and letters refer to like items throughout the attached drawings, and thus once an item is defined in one drawing, it is not necessary that it be further discussed in subsequent drawings.

[0031] <Hardware Configuration>

[0032] Figure 1 is a structural schematic diagram of an electronic device 1000 that can be used to implement embodiments of the present disclosure.

[0033] The electronic device 1000 can be a smart phone, a portable computer, a desktop computer, a tablet computer, a server, etc., and is not limited herein.

[0034] The electronic device 1000 can include, but is not limited to, a processor 1100, a memory 1200, an interface device 1300, a communication device 1400, a display device 1500, an input device 1600, a speaker 1700, a microphone 1800, etc. The processor 1100 can be a central processing unit CPU, a graphics processing unit GPU, a microprocessor MCU, etc., and is configured to execute a computer program, which can be written in an instruction set of an architecture such as x86, Arm, RISC, MIPS, SSE, etc. The memory 1200 includes, for example, a ROM (read only memory), a RAM (random access memory), a non-volatile memory such as a hard disk, etc. The interface device 1300 includes, for example, a USB interface, a serial interface, a parallel interface, etc. The communication device 1400 is configured to perform wired communication using an optical fiber or a cable, or wireless communication, and can include, for example, WiFi communication, Bluetooth communication, 2G / 3G / 4G / 5G communication, etc. The display device 1500 is, for example, a liquid crystal display screen, a touch display screen, etc. The input device 1600 can include, for example, a touch screen, a keyboard, a body-sensing input, etc. The speaker 1700 is configured to output an audio signal. The microphone 1800 is configured to acquire an audio signal.

[0035] As used in the embodiments of the present disclosure, the memory 1200 of the electronic device 1000 is used to store a computer program, which is used to control the processor 1100 to operate to implement the method according to the embodiments of the present disclosure. Technicians can design the computer program according to the scheme disclosed in the present disclosure. How the computer program controls the processor to operate is well known in the art and will not be described in detail here. The electronic device 1000 can be installed with an intelligent operating system (such as Windows, Linux, Android, IOS, etc.) and application software.

[0036] It should be understood by those skilled in the art that although Figure 1 , multiple devices of the electronic device 1000 are shown; however, the electronic device 1000 of the embodiment of the present disclosure may only involve some of the devices, for example, only the processor 1100 and the memory 1200.

[0037] Hereinafter, various embodiments and examples according to the present invention will be described with reference to the accompanying drawings.

[0038] <Method Example>

[0039] Figure 2 This is a flow chart of a method for generating a parking fence according to an embodiment. Figure 1 The electronic device 1000 is shown.

[0040] like Figure 2 As shown, the parking fence generation method of this embodiment may include the following steps S210 to S240:

[0041] Step S210: Acquire at least two sampling points of a set road.

[0042] In detail, the set road may be any road on an electronic map. The road may usually be represented by a road line. The position of the road line may correspond to the center line of the road. The attribute of the road line may be the actual width of the road.

[0043] Specifically, the parking demand at different locations may vary. For example, parking demand in downtown areas is generally higher, while parking demand in non-downtown areas is generally lower. To generate a parking fence that meets user needs, the parking demand at different locations may be combined to generate the parking fence.

[0044] In one feasible implementation, the number of vehicles parked at each location within a certain time period (e.g., one day, one month, etc.) can be determined based on the parking locations of the vehicles. That is, the parking demand can be reflected based on the historical number of parked vehicles. The greater the historical number of parked vehicles, the greater the corresponding parking demand.

[0045] Considering that parking fences are usually built on one side of the road, the generation location of the parking fence can be determined according to the parking demand of vehicles at various locations on the road, and the parking fence generated accordingly can meet the parking needs of users.

[0046] In this way, multiple sampling points of the road can be obtained first, so as to realize the construction of roadside parking fences according to the vehicle parking demand at the sampling points.

[0047] In one feasible implementation, sampling points on the road can be obtained by sampling at equal intervals. For example, the road can be cut into sampling segments at 1m intervals, and the starting point of each sampling segment is used as a sampling point to obtain sampling points on the road.

[0048] Step S220 : For each first sampling point among the at least two sampling points, obtain an index value of the first sampling point, wherein the first sampling point is any sampling point among the at least two sampling points, and the index value is a value used to reflect the parking demand of the vehicle.

[0049] Specifically, in order to generate a parking fence that meets the user's parking needs, an index value reflecting the parking demand at each sampling point can be obtained. For example, the index value can be order density.

[0050] Specifically, for shared vehicles, an order is generated when a user uses a shared vehicle. At the start of an order, the vehicle reports its location, which serves as the unlocking location for the order; at the end of the order, the vehicle reports its location, which serves as the locking location for the order. Based on the order location and the time it was reported, the historical number of vehicles parked at each location over a specific time period can be obtained, reflecting the parking demand at each location.

[0051] In this embodiment, the number of parked vehicles can be converted into order density. For example, the value of order density can be an integer between 0 and 6. The more parked vehicles there are in a location area, the larger the corresponding order density value is. The maximum value can be 6 and the minimum value can be 0.

[0052] In detail, the index value of the sampling point can be obtained according to the index value of the grid and the mapping relationship between the sampling point and the grid.

[0053] Based on this, in one embodiment of the present disclosure, the method may further include the following steps S2001 to S2002:

[0054] Step S2001: Divide the set map including the set road into grids.

[0055] In this step, the electronic map may be divided into grids, for example, the grids may be hexagonal grids, square grids, etc.

[0056] Step S2002 : determining an index value of each grid in the grids according to the historical parking position of the vehicle on the set map.

[0057] Each grid has a certain area, that is, a grid can include multiple positioning locations. In this way, the index value of the network can be obtained based on the historical number of parked vehicles at each positioning location in the grid.

[0058] Optionally, the index value may be order density. The larger the index value, that is, the greater the order density, the greater the historical parking demand of the grid, and the darker the color displayed on the electronic map.

[0059] Based on the above content, the step of obtaining the index value of the first sampling point in the above step S220 may include the following steps S2201 to S2202:

[0060] Step S2201: Determine a first grid including the first sampling point.

[0061] Since any sampling point can fall into a grid accordingly, the index value of the sampling point can be obtained according to the index value of the grid where it is located.

[0062] Step S2202: Obtain the index value of the first sampling point according to the index value of the first grid.

[0063] In this step, the index value of the sampling point is obtained according to the index value of the grid where the sampling point is located.

[0064] In one embodiment of the present disclosure, step S2202 of obtaining the index value of the first sampling point according to the index value of the first grid includes: using the index value of the first grid as the index value of the first sampling point.

[0065] In another embodiment of the present disclosure, the step S2202 of obtaining the index value of the first sampling point according to the index value of the first grid may include the following steps S22021 to S22022:

[0066] Step S22021: Acquire a sampling point set including the first sampling point, wherein the sampling point set starts with the first sampling point and is arranged adjacently in sequence along the driving direction of the set road.

[0067] Specifically, the sampling points of the road are arranged sequentially on the road. For example, the road can be cut into sampling segments at 1m intervals, and the starting point of each sampling segment is used as a sampling point to obtain the sampling points of the road.

[0068] Assume that N sampling points can be obtained, which are sampling point 1, sampling point 2, ..., sampling point N-1, and sampling point N in sequence, and these N sampling points are arranged adjacent to each other in the direction of road travel.

[0069] For any sampling point i among the N sampling points, its sampling point set may consist of sampling points from sampling point i to sampling point i+x.

[0070] Considering that the interval between parking fences can be 10 meters and the distance between sampling points is 1 meter, the value of x can be 9, so that any sampling point set consists of 10 sampling points. For example, the sampling point set of sampling point 1 can consist of sampling points 1 to 10; the sampling point set of sampling point 2 can consist of sampling points 2 to 11, and so on.

[0071] Step S22022: Taking the average of the index values ​​of the grids where the sampling points in the sampling point set are located as the index value of the first sampling point.

[0072] In this step, the sampling point set includes multiple sampling points, so the average of the index values ​​of the grids where these sampling points are located can be calculated to serve as the index value of the first sampling point. This can improve the accuracy of the sampling point index value and reduce the impact of order position drift on this accuracy.

[0073] Based on this, assuming that sampling point i is the second sampling point, when the road is segmented based on sampling point i, the road can be segmented according to the sampling point set of sampling point i, so that the two road segments obtained by segmentation are separated by a preset interval value, that is, an interval of 10m, that is, the two parking fences obtained based on the two road segments are separated by 10m, which meets the set parking fence setting requirements.

[0074] Step S230: Segment the set road according to at least one second sampling point among the at least two sampling points to obtain each first road segment of the set road, wherein an index value of any second sampling point is less than or equal to an index value of any other sampling point among the at least two sampling points except the at least one second sampling point.

[0075] Specifically, different sampling points have different index values, that is, different parking demands at different sampling points. In this way, sampling points with higher index values ​​and sampling points with lower index values ​​can be distinguished from each sampling point of the vehicle.

[0076] Afterwards, the road can be cut according to the sampling points with smaller index values ​​to separate the different order heat areas, and then parking fences corresponding to each order heat area can be generated to meet the user's vehicle parking needs.

[0077] In this embodiment, the road is cut based on the sampling points with smaller index values. The order popularity of the resulting road segments is usually higher than the order popularity of the separation points, so that the corresponding parking fences generated based on the cut road segments can meet the user's vehicle parking needs.

[0078] In this embodiment, the road can be segmented based on one or more second sampling points at a time. When segmenting a road based on one second sampling point, two road segments can usually be segmented. When segmenting a road based on n (n≥2) second sampling points, n+1 road segments can usually be segmented.

[0079] Specifically, the number of second sampling points is not only related to the index values ​​of each sampling point, but also to the cutting effect. For example, it can be required that any cut road segment can generate at least one corresponding parking fence, that is, the length of the cut road segment cannot be too small.

[0080] Furthermore, considering that the number of second sampling points can be small, the cut road segment can be longer, making it inconvenient to directly generate a corresponding parking fence. To prevent the generated parking fence from not fully meeting the user's parking needs, the method of this embodiment can be executed again on the cut road segment to cut it again, i.e., performing a second cut on the set road. This cycle is repeated until the resulting road segment does not need to be cut again, and the corresponding parking fence can be generated based on the road segment.

[0081] Based on this, in one embodiment of the present disclosure, the above step S230 of cutting the set road according to at least one second sampling point among the at least two sampling points to obtain each first road segment of the set road may include the following steps S2301 to S2304:

[0082] Step S2301: performing segmentation processing on the set road according to at least one second sampling point among the at least two sampling points to obtain at least two second road segments.

[0083] For example, assuming that a second sampling point (denoted as second sampling point a1) is currently available, based on the second sampling point a1 and a set parking fence interval length (e.g., 10m), the road can be divided into two road segments, such as a road segment located on the first side of the second sampling point a1 (denoted as road segment L1) and a road segment located on the second side of the second sampling point a1 (denoted as road segment L2).

[0084] Step S2302: For each second road segment, determine whether the second road segment is a road segment that can be cut.

[0085] Preferably, the length of a parking fence may not exceed 50m.

[0086] Based on the above example, assuming that the road segment L2 is long and the road segment L1 is short and inconvenient to be cut again, the road segment L2 may be cut again, while the road segment L1 is not cut.

[0087] Step S2303: If the second road segment is a road segment that can be cut, use the second road segment as a new set road, and perform the step of obtaining at least two sampling points of the set road.

[0088] As described above, since the road segment L2 can be cut again, the road segment L2 can be used as a new road and the above step S210 can be performed again, so that the road segment L2 can be cut again, that is, the road is cut twice.

[0089] Assume that a second sampling point (denoted as second sampling point a2) is obtained during the secondary segmentation. Based on the second sampling point a2 and the set parking fence interval length (e.g., 10 m), the road segment L2 can be segmented into two road segments: a road segment located on the first side of the second sampling point a2 (denoted as road segment L3) and a road segment located on the second side of the second sampling point a2 (denoted as road segment L4). Neither of these two road segments needs to be segmented again.

[0090] Step S2304: If the second road segment is not a road segment that can be cut, use the second road segment as the first road segment.

[0091] As described above, since the road segment L1 does not need to be cut again, the parking fence corresponding to the road segment L1 can be directly generated.

[0092] From the above, we can see that the road can be cut into three road segments, so that three corresponding parking fences can be generated.

[0093] It can be seen that this embodiment can generate a parking fence with an appropriate fence length that meets the user's parking needs by cutting the road at least once, and the parking fence generation effect is good.

[0094] In this embodiment, the road can be segmented based on one or more second sampling points at a time. When segmenting a road based on one second sampling point, two road segments can usually be segmented. When segmenting a road based on n (n≥2) second sampling points, n+1 road segments can usually be segmented.

[0095] In the case of cutting the road according to a second sampling point, the index value of the second sampling point may generally be the minimum index value, and the index value of the second sampling point is less than or equal to the index value of any other sampling point.

[0096] Based on this, in one embodiment of the present disclosure, before performing the segmentation process on the set road based on at least one second sampling point among the at least two sampling points, the method may further include: determining a minimum index value among the index values ​​of the at least two sampling points. The second sampling point is the sampling point having the minimum index value.

[0097] Since this embodiment always performs road cutting based on the sampling point of the minimum index value, it can achieve a good effect of distinguishing different order heat areas, and the generated parking fence is more effective.

[0098] In this embodiment, the sampling point with the minimum index value is taken as the second sampling point. If there are multiple sampling points with the minimum index value, one of them can be selected as the second sampling point.

[0099] For example, if the index value of a sampling point adjacent to the second sampling point is larger, for example, if the index values ​​of the sampling points in the first half of the road are the same and the smallest, and the index values ​​of the sampling points in the second half of the road are larger, then the sampling point adjacent to the second half of the road can be selected as the second sampling point.

[0100] For example, the second sampling point is located in the middle of the road. For example, if the index values ​​of all sampling points on the road are the same and small, the sampling point in the middle can be used as the second sampling point. Although the order popularity of the parking area obtained in this way is not high, the parking area obtained is standardized, unified, and evenly distributed, and can provide support for the future use of the parking area.

[0101] In addition, the selection of the second sampling point may also meet other preset requirements, such as ensuring that the line segments at the beginning and end of the road leave a gap of a specified size in the direction of both ends of the road.

[0102] It can be seen that the parking fence generated in this embodiment not only meets the parking demand of the user, but also generates corresponding standardized, uniform and evenly distributed parking areas in the area where the current user parking demand is low, thereby ensuring the extensive and reasonable distribution of the parking areas in various locations in the city.

[0103] For the case of cutting the road according to at least two second sampling points, the index value of the second sampling point can be a smaller index value, and the index value of any second sampling point is less than or equal to the index value of any other sampling point that is not a second sampling point.

[0104] Based on this, an index value range can be set, and any positioning point with an index value falling within the range can be used as a second positioning point.

[0105] When there are multiple second positioning points, the road can be divided into multiple road segments in one road segmentation process, and the length of each road segment is relatively short, so that the number of loop executions of the road cutting operation can be reduced, and the road cutting efficiency can be improved.

[0106] In this embodiment, the sampling point with a smaller index value is used as the second sampling point. If there are multiple sampling points with smaller index values, multiple second sampling points can be selected from them.

[0107] For example, some second sampling points are sequentially and evenly distributed on the road, and / or the index value of a sampling point adjacent to some second sampling point is larger.

[0108] For example, if the index values of the sampling points in the first half of the road are all smaller, and the index values of the sampling points in the second half of the road are all larger, the multiple sampling points sequentially and evenly distributed in the first half of the road can be used as the second sampling points, and these second sampling points include the sampling points adjacent to the second half of the road.

[0109] For example, if the index values of the sampling points of the road are all smaller, the multiple sampling points sequentially and evenly distributed on the road can be used as the multiple second sampling points. Although the order heat corresponding to the parking area obtained in this way is not large, the parking area obtained in this way is standardized, uniform and evenly distributed, and can support the use of the parking area in the future.

[0110] It can be seen that the parking fence generated in this embodiment not only meets the parking demand of the user, but also generates corresponding standardized, uniform and evenly distributed parking areas in the area where the current user parking demand is low, thereby ensuring the extensive and reasonable distribution of the parking areas in various locations in the city.

[0111] Based on the above, in one embodiment of the present disclosure, when the number of the second sampling points is greater than or equal to 2, the distance between any two adjacent second sampling points on the set road is greater than or equal to a set interval threshold.

[0112] In this embodiment, by limiting the interval between adjacent second sampling points to be larger, it is applicable to the case where the order density of the road is relatively low. In this way, the parking fence of the road can also be obtained to avoid such roads without corresponding parking fences.

[0113] Step S240: Generate a parking fence corresponding to each of the first road segments.

[0114] For the cut road segments, corresponding parking fences can be generated. For example, the road width can be used to translate the road segment to the non-motorized vehicle lane area, and then the fence width is combined with the set fence length, and the length of the road segment is used as the fence length to generate the corresponding parking fence.

[0115] In this embodiment, the generated parking fences are standardized and uniform, and have high order and vehicle location coverage, meeting the user's parking needs.

[0116] In this embodiment, at least two sampling points are obtained for a given road; for each first sampling point of the at least two sampling points, an index value is obtained for the first sampling point, where the first sampling point is any one of the at least two sampling points, and the index value is a value used to reflect the parking demand of vehicles; the given road is segmented based on at least one second sampling point of the at least two sampling points to obtain each first road segment of the given road, where the index value of any second sampling point is less than or equal to the index value of each of the at least two sampling points except the at least one second sampling point; and a parking fence is generated corresponding to each first road segment. In this embodiment, the road is segmented based on sampling points with lower parking demand, thereby separating road segments corresponding to different areas with higher parking demand. Parking fences are then generated based on the segmented road segments. The parking fences generated in this manner meet user parking needs and provide better parking fence generation results.

[0117] Manually drawing parking fences is prone to problems such as a small number of generated fences, a relatively large area, high maintenance costs, insufficient coverage of orders and vehicle locations, low differentiation of operational actions, high labor investment, and low parking fence generation efficiency. However, the parking fence generation method provided in this embodiment not only automatically generates parking fences, but also achieves better results by cutting roads based on the index values ​​of sampling points, eliminating the aforementioned issues associated with manually drawing parking fences.

[0118] Regarding the implementation of aggregating parking fences from positioning points using a clustering algorithm, DBSCAN clustering can be used to set appropriate parameters, clustering the positioning points into clusters, obtaining the cluster boundaries, and reshaping to obtain the fences. However, considering the differences in vehicle location distribution and position drift between cities / regions, finding appropriate clustering parameters is usually very difficult, resulting in non-standard size, shape, and position of the fences formed by aggregating positioning points, and severe fragmentation. The parking fence generation method provided in this embodiment, however, generates parking fences by cutting the road based on the index values ​​of the sampling points. This allows for the generation of parking fences with similar sizes, small spans, and standardized shapes. Furthermore, the parking fences will not be located in the middle of the road, in parks, or inside buildings, thereby affecting the execution of scheduling work orders.

[0119] In summary, the parking fence generation method provided in this embodiment can produce a version of parking fences that are standardized and unified, have high order and vehicle location coverage, and support refined operations based on road network data.

[0120] In detail, the parking fences generated above may intersect, for example, the parking fence generated based on the main road may intersect with the parking fence generated based on the corresponding auxiliary road, and the parking fences generated based on the intersecting roads may intersect.

[0121] If two parking fences cover at least one of the same grid cells, the two fences can be considered to intersect. In the case of intersecting fences, duplicate removal of intersecting fences can be performed.

[0122] In one embodiment of the present disclosure, after generating a parking fence corresponding to each first road segment in step S240, the method may further include step S250:

[0123] Step S250: Acquire a fence set, where any parking fence in the fence set intersects with at least one other parking fence in the fence set.

[0124] Specifically, to group intersecting fences, we can construct an undirected graph at the city level, taking the road network fences as graph nodes and the fence intersection relationships as graph edges. By calculating the connected subgraphs, we can obtain the intersecting fence groups.

[0125] Among them, in a fence set obtained, any parking fence in the set intersects with at least one other fence in the set.

[0126] For example, there may be a fence set including two intersecting fences, where the roads corresponding to the two fences intersect.

[0127] For example, there may be another fence set, which includes six fences that intersect in sequence, namely fence a, fence b, fence c, fence d, fence e, and fence f, among which fence a, fence c, and fence e are parking fences generated based on the main road, and fence b, fence d, and fence f are parking fences generated based on the corresponding auxiliary roads.

[0128] Step S260: For two intersecting parking fences in the fence set, delete one of the two parking fences.

[0129] In this step, for two intersecting fences, one of them can be deleted to eliminate invalid or inefficient duplicate fences, reduce the total number of fences, and facilitate operations such as fence maintenance.

[0130] Among them, when the same distance is offset for any road segment to obtain the corresponding parking fence, since the parking fence obtained from the main road is more likely to occupy part of the motor vehicle lane area, if the two intersecting parking fences are obtained from the main road and the auxiliary road respectively, the parking fence obtained from the main road can be deleted.

[0131] Among them, for two intersecting areas obtained by intersecting roads, any one of them can be deleted. If possible, there can be more than one deletion method.

[0132] For example, the constraints for deleting intersecting fences can be as follows:

[0133] If the fence x i with x j intersect;

[0134] If x i It is an auxiliary road, x j is the main road, then x j =0;

[0135] If x j It is an auxiliary road, x i is the main road, then x i =0;

[0136] Otherwise x i +x j <2.

[0137] Based on this, in one embodiment of the present disclosure, the step S260 of deleting one of the two intersecting parking fences in the fence set may include the following steps S2601 to S2602:

[0138] Step S2601: For two intersecting parking fences in the fence set, determine whether the first road segments corresponding to the two parking fences are a main road segment and a secondary road segment, respectively.

[0139] Regarding the deletion of intersecting fences, in order to maximize the number of orders covered by the fence set while satisfying the constraints of mutual non-intersection and related rules (deleting the parking fences corresponding to the intersecting main roads), the corresponding intersecting fences of the main and auxiliary roads can be deleted first.

[0140] Possibly, linktype i The function type attribute "linktype" for the fence corresponding to the road i =6 is auxiliary road, linktype i =1 or 2 indicates the main road, i is the subscript variable of the fence, the value range is [0,n-1], and n is the number of fences.

[0141] Step S2602: When the first road segments corresponding to the two parking fences are a main road segment and a secondary road segment respectively, the parking fence corresponding to the main road segment of the two parking fences is deleted.

[0142] As mentioned above, if there are two intersecting fences corresponding to the main and auxiliary roads, the parking fence corresponding to the main road will be deleted. If not, no corresponding deletion will be performed.

[0143] After completing the above steps, there may be other intersecting parking fences in the fence set, and these intersecting fences may be in various ways.

[0144] For example, a fence set includes four parking fences: Fence 1, Fence 2, Fence 3, and Fence 4. These four fences intersect with each other, and none of them intersect with the corresponding main or auxiliary roads. Therefore, you can delete Fence 1 and Fence 3, or Fence 2 and Fence 4, and both resolve the fence intersection issue.

[0145] In order to maximize the number of orders covered by the fence set, the vehicle parking demand for various deletion methods can be calculated separately, and the intersecting fences can be deleted using the deletion method corresponding to the maximum vehicle parking demand.

[0146] Based on this, in one embodiment of the present disclosure, after determining whether the first road segments corresponding to the two parking fences are a main road segment and a secondary road segment, respectively, the method may further include the following steps S2603 to S2606:

[0147] Step S2603, it is determined whether there are at least two deletion manners, wherein the deletion manners are used to indicate deleting part of the parking fences in the fence set, so that any two parking fences remaining in the fence set are disjointed.

[0148] For any deletion manner, after the intersection fence deletion processing is performed according to the deletion manner, the problem of fence intersection can be solved.

[0149] Step S2604, in the case that there are at least two deletion manners, the vehicle parking demand quantity corresponding to each of the deletion manners is determined to obtain at least two vehicle parking demand quantities.

[0150] In detail, the vehicle parking demand quantity corresponding to the deletion manner can be calculated according to the following content.

[0151]

[0152] Wherein, ∑ i c i *x i is the vehicle parking demand quantity corresponding to the deletion manner, i is a fence subscript variable, the value range is [0, n-1], n is the number of fences, x i represents whether the corresponding fence is retained, x i = 0 indicates that the corresponding fence is deleted, x i = 1 indicates that the corresponding fence is retained, c i is the daily average order quantity covered by the fence,

[0153] Step S2605, the maximum vehicle parking demand quantity in the at least two vehicle parking demand quantities is determined.

[0154] In this step, the optimal deletion manner can be determined based on the size of the vehicle parking demand quantity.

[0155] Step S2606, according to the deletion manner corresponding to the maximum vehicle parking demand quantity, the parking fence deletion processing is performed on the fence set.

[0156] In this step, the intersection fence deletion processing is performed based on the optimal deletion manner, which not only can solve the problem of fence intersection, but also can maximize the order quantity covered by the fence set.

[0157] The parking fence generated in this embodiment is not only standardized, uniform, evenly distributed and arranged along the road, but also can meet the user's parking demand, so the generation effect of the parking fence is good.

[0158] <Example>

[0159] Figure 3 The flowchart of the parking fence generation method according to an embodiment is given. As shown in FIG. 2, the method comprises the following steps. Figure 3 As shown, the method of this embodiment may include the following steps S301 to S319:

[0160] Step S301: Divide a set map including set roads into grids.

[0161] Step S302 : determining an index value of each of the grids according to the historical parking positions of the vehicle on the set map, wherein the index value is a value used to reflect the parking demand of the vehicle.

[0162] Step S303: Acquire at least two sampling points of the set road.

[0163] Step S304 : For each first sampling point among the at least two sampling points, determine a first grid including the first sampling point, wherein the first sampling point is any sampling point among the at least two sampling points.

[0164] Step S305 : Acquire a sampling point set including the first sampling point, wherein the sampling point set starts with the first sampling point and is arranged adjacent to each other in sequence along the driving direction of the set road.

[0165] Step S306 : taking the average of the index values ​​of the grids where the sampling points in the sampling point set are located as the index value of the first sampling point.

[0166] Step S307: determining the minimum index value among the index values ​​of the at least two sampling points.

[0167] Step S308 : Cutting the set road according to at least one second sampling point among the at least two sampling points to obtain at least two second road segments, wherein the second sampling point is a sampling point having the minimum index value.

[0168] Step S309 : For each second road segment, determine whether the second road segment is a road segment that can be cut, and execute step S310 or step S311 .

[0169] Step S310 : If the second road segment is a road segment that can be cut, use the second road segment as a new set road, and perform the step of obtaining at least two sampling points of the set road.

[0170] Step S311 : If the second road segment is not a road segment that can be cut, use the second road segment as the first road segment.

[0171] Step S312: Generate a parking fence corresponding to each of the first road segments.

[0172] Step S313: Acquire a fence set, where any parking fence in the fence set intersects with at least one other parking fence in the fence set.

[0173] Step S314 : For two intersecting parking fences in the fence set, determining whether the first road segments corresponding to the two parking fences are a main road segment and a secondary road segment, respectively.

[0174] Step S315 : When the first road segments corresponding to the two parking fences are a main road segment and a secondary road segment respectively, the parking fence corresponding to the main road segment among the two parking fences is deleted.

[0175] Step S316: Determine whether there are at least two deletion methods, wherein the deletion method is used to indicate deletion of some parking fences in the fence set so that any two remaining parking fences in the fence set do not intersect.

[0176] Step S317 : in the case where there are at least two deletion methods, determining the vehicle parking demand corresponding to each of the deletion methods to obtain at least two vehicle parking demand quantities.

[0177] Step S318: determining the maximum parking demand of the at least two parking demands.

[0178] Step S319: performing parking fence deletion processing on the fence set according to the deletion method corresponding to the maximum vehicle parking demand.

[0179] <Equipment Example>

[0180] Figure 4 FIG. 4 is a block diagram of a parking fence generating device 400 according to an embodiment. Figure 4 As shown, the parking fence generating device 400 may include a first acquiring module 410 , a second acquiring module 420 , a processing module 430 and a generating module 440 .

[0181] The parking fence generating device 400 may be Figure 1 The electronic device 1000 is shown.

[0182] The first acquisition module 410 is configured to acquire at least two sampling points of a predetermined road. The second acquisition module 420 is configured to acquire, for each first sampling point of the at least two sampling points, an index value of the first sampling point, wherein the first sampling point is any sampling point of the at least two sampling points, and the index value is a value reflecting the parking demand of vehicles. The processing module 430 is configured to segment the predetermined road based on at least one second sampling point of the at least two sampling points to obtain each first road segment of the predetermined road, wherein the index value of any second sampling point is less than or equal to the index value of any other sampling point of the at least two sampling points except the at least one second sampling point. The generation module 440 is configured to generate a parking fence corresponding to each first road segment.

[0183] From the above, it can be seen that this embodiment cuts the road according to the sampling points where the demand for vehicle parking is relatively small, so as to cut out the road segments corresponding to different areas with relatively large demand for vehicle parking, and then generate corresponding parking fences based on the cut road segments. The parking fences generated in this way meet the parking needs of users, and the generation effect of parking fences is better.

[0184] In one embodiment of the present disclosure, the processing module 430 is configured to perform segmentation processing on the set road based on at least one second sampling point among the at least two sampling points to obtain at least two second road segments; for each second road segment, determine whether the second road segment is a road segment that can be segmented; if the second road segment is a road segment that can be segmented, use the second road segment as a new set road and execute the step of obtaining at least two sampling points of the set road; if the second road segment is not a road segment that can be segmented, use the second road segment as the first road segment.

[0185] In one embodiment of the present disclosure, the processing module 430 is configured to determine a minimum index value among the index values ​​of the at least two sampling points; wherein the second sampling point is the sampling point having the minimum index value.

[0186] In one embodiment of the present disclosure, when the number of the second sampling points is greater than or equal to 2, the distance between any two adjacent second sampling points on the set road is greater than or equal to a set interval threshold.

[0187] In one embodiment of the present disclosure, the parking fence generating device 400 further includes: a module for dividing a set map including the set road into grids; a module for determining an index value of each of the grids based on a historical parking position of the vehicle on the set map; the second acquisition module 420 is used to determine a first grid including the first sampling point; and obtain the index value of the first sampling point based on the index value of the first grid.

[0188] In one embodiment of the present disclosure, the second acquisition module 420 is configured to use the index value of the first grid as the index value of the first sampling point; or to acquire a sampling point set including the first sampling point, wherein the sampling point set starts with the first sampling point and is arranged adjacently in sequence along the driving direction of the set road; and to use the average of the index values ​​of the grids in which the sampling points in the sampling point set are located as the index value of the first sampling point.

[0189] In one embodiment of the present disclosure, the parking fence generation device 400 also includes: a module for obtaining a fence set, any parking fence in the fence set intersects with at least one other parking fence in the fence set; and a module for deleting one of the two parking fences that intersect in the fence set.

[0190] In one embodiment of the present disclosure, the parking fence generation device 400 also includes: a module for determining, for two intersecting parking fences in the fence set, whether the first road segments corresponding to the two parking fences are respectively a main road segment and a secondary road segment; and a module for deleting the parking fence corresponding to the main road segment in the two parking fences when the first road segments corresponding to the two parking fences are respectively a main road segment and a secondary road segment.

[0191] In one embodiment of the present disclosure, the parking fence generating device 400 also includes: a module for determining whether there are at least two deletion methods, wherein the deletion method is used to indicate the deletion of part of the parking fences in the fence set so that any two remaining parking fences in the fence set do not intersect; a module for determining the vehicle parking demand corresponding to each deletion method in the presence of the at least two deletion methods to obtain at least two vehicle parking demand quantities; a module for determining the maximum vehicle parking demand quantity among the at least two vehicle parking demand quantities; and a module for performing parking fence deletion processing on the fence set according to the deletion method corresponding to the maximum vehicle parking demand quantity.

[0192] Figure 5 3 is a schematic diagram of the hardware structure of a parking fence generating device 500 according to another embodiment.

[0193] like Figure 5 As shown, the parking fence generating device 500 includes a processor 510 and a memory 520, wherein the memory 520 is used to store an executable computer program, and the processor 510 is used to execute a method such as any of the above method embodiments under the control of the computer program.

[0194] The parking fence generating device 500 may be Figure 1 The electronic device 1000 is shown.

[0195] Each module of the above parking fence generating device 500 can be implemented by the processor 510 in this embodiment executing a computer program stored in the memory 520, or can be implemented by other circuit structures, which is not limited here.

[0196] The present invention may be a system, a method and / or a computer program product. The computer program product may include a computer-readable storage medium carrying computer-readable program instructions for causing a processor to implement various aspects of the present invention.

[0197] A computer-readable storage medium can be a tangible device that can hold and store instructions for use by an instruction execution device. A computer-readable storage medium can be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination thereof. More specific examples (a non-exhaustive list) of computer-readable storage media include: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, such as a punch card or a raised structure in a groove on which instructions are stored, and any suitable combination thereof. As used herein, a computer-readable storage medium is not to be construed as a transient signal per se, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (e.g., a light pulse through a fiber optic cable), or an electrical signal transmitted through an electrical wire.

[0198] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to each computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions to be stored in the computer-readable storage medium in each computing / processing device.

[0199] The computer program instructions for performing the operation of the present invention can be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Smalltalk, C++, and conventional procedural programming languages ​​such as "C" language or similar programming languages. The computer readable program instructions can be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer, partially on a remote computer, or completely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., using an Internet service provider to connect via the Internet). In some embodiments, an electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), is personalized by utilizing the state information of the computer readable program instructions, and the electronic circuit can execute the computer readable program instructions, thereby realizing various aspects of the present invention.

[0200] Various aspects of the present invention are described herein with reference to flowcharts and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present invention. It should be understood that each block of the flowcharts and / or block diagrams, and combinations of blocks in the flowcharts and / or block diagrams, can be implemented by computer-readable program instructions.

[0201] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine, so that when these instructions are executed by the processor of the computer or other programmable data processing device, a device is generated that implements the functions / actions specified in one or more blocks in the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium, where these instructions cause the computer, programmable data processing device, and / or other device to operate in a specific manner. Thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing various aspects of the functions / actions specified in one or more blocks in the flowchart and / or block diagram.

[0202] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operational steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to implement the functions / actions specified in one or more blocks in the flowchart and / or block diagram.

[0203] The flowcharts and block diagrams in the accompanying drawings show the possible implementation architecture, functions and operations of the systems, methods and computer program products according to multiple embodiments of the present invention. In this regard, each box in the flowchart or block diagram can represent a module, program segment or part of an instruction, and the module, program segment or part of the instruction contains one or more executable instructions for implementing the specified logical function. In some alternative implementations, the functions marked in the box can also occur in an order different from that marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system that performs the specified function or action, or can be implemented by a combination of dedicated hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, implementation by software, and implementation by a combination of software and hardware are all equivalent.

[0204] While various embodiments of the present invention have been described above, the foregoing description is intended to be illustrative, non-exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is selected to best explain the principles of the embodiments, their practical applications, or technological improvements in the marketplace, or to enable others skilled in the art to understand the embodiments disclosed herein. The scope of the present invention is defined by the appended claims.

Claims

1. A parking fence generation method, characterized in that: include: Obtain at least two sampling points of a set road; For each first sampling point among the at least two sampling points, obtaining an index value of the first sampling point, wherein the first sampling point is any sampling point among the at least two sampling points, and the index value is a value used to reflect the parking demand of the vehicle; performing segmentation processing on the set road according to at least one second sampling point among the at least two sampling points to obtain each first road segment of the set road, wherein an index value of any second sampling point is less than or equal to an index value of any other sampling point among the at least two sampling points except the at least one second sampling point; generating a parking fence corresponding to each of the first road segments; The method further includes: dividing a set map including the set road into grids; determining an index value for each of the grids based on a historical parking position of the vehicle on the set map; and obtaining the index value of the first sampling point includes: determining a first grid including the first sampling point; and obtaining the index value of the first sampling point based on the index value of the first grid; Obtaining the index value of the first sampling point based on the index value of the first grid includes: using the index value of the first grid as the index value of the first sampling point; or obtaining a sampling point set including the first sampling point, wherein the sampling point set starts with the first sampling point and is arranged adjacently in sequence along the driving direction of the set road; and using an average of the index values ​​of the grids where the sampling points in the sampling point set are located as the index value of the first sampling point; After generating the parking fence corresponding to each of the first road segments, the method further includes: obtaining a fence set, any parking fence in the fence set intersecting with at least one other parking fence in the fence set; for two intersecting parking fences in the fence set, deleting one of the two parking fences.

2. The method according to claim 1, characterized in that The step of performing a segmentation process on the set road according to at least one second sampling point among the at least two sampling points to obtain each first road segment of the set road includes: According to at least one second sampling point among the at least two sampling points, the set road is segmented to obtain at least two second road segments; For each of the second road segments, determining whether the second road segment is a road segment that can be cut; If the second road segment is a road segment that can be cut, use the second road segment as a new set road, and perform the step of obtaining at least two sampling points of the set road; If the second road segment is not a road segment that can be cut, the second road segment is used as the first road segment.

3. The method according to claim 1, characterized in that Before performing the cutting process on the set road according to at least one second sampling point among the at least two sampling points, the method further includes: Determining a minimum index value among the index values ​​of each sampling point in the at least two sampling points; The second sampling point is a sampling point having the minimum index value.

4. The method according to claim 1, wherein When the number of the second sampling points is greater than or equal to 2, the distance between any two adjacent second sampling points on the set road is greater than or equal to a set interval threshold.

5. The method according to claim 1, wherein The step of deleting one of the two intersecting parking fences in the fence set includes: For two intersecting parking fences in the fence set, determining whether first road segments corresponding to the two parking fences are a main road segment and a secondary road segment, respectively; In a case where the first road segments corresponding to the two parking fences are a main road segment and a secondary road segment respectively, the parking fence corresponding to the main road segment among the two parking fences is deleted.

6. The method according to claim 5, characterized in that After determining whether the first road segments corresponding to the two parking fences are a main road segment and a secondary road segment, respectively, the method further includes: determining whether there are at least two deletion methods, wherein the deletion methods are used to instruct deletion of some parking fences in the fence set so that any two remaining parking fences in the fence set do not intersect; In the case where there are at least two deletion methods, determining the vehicle parking demand corresponding to each of the deletion methods to obtain at least two vehicle parking demand quantities; determining a maximum vehicle parking demand of the at least two vehicle parking demands; The parking fence deletion process is performed on the fence set according to the deletion method corresponding to the maximum vehicle parking demand.

7. A parking fence generation device, characterized in that: include: A first acquisition module is used to acquire at least two sampling points of a set road; a second acquisition module configured to acquire, for each first sampling point among the at least two sampling points, an index value of the first sampling point, wherein the first sampling point is any sampling point among the at least two sampling points, and the index value is a value used to reflect the parking demand of the vehicle; a processing module configured to segment the set road based on at least one second sampling point among the at least two sampling points to obtain each first road segment of the set road, wherein an index value of any second sampling point is less than or equal to an index value of any other sampling point among the at least two sampling points except the at least one second sampling point; and a generating module configured to generate a parking fence corresponding to each first road segment; The apparatus further includes: dividing a set map including the set road into grids; determining an index value for each of the grids based on a historical parking position of the vehicle on the set map; and obtaining the index value of the first sampling point includes: determining a first grid including the first sampling point; and obtaining the index value of the first sampling point based on the index value of the first grid; Obtaining the index value of the first sampling point based on the index value of the first grid includes: using the index value of the first grid as the index value of the first sampling point; or obtaining a sampling point set including the first sampling point, wherein the sampling point set starts with the first sampling point and is arranged adjacently in sequence along the driving direction of the set road; and using an average of the index values ​​of the grids where the sampling points in the sampling point set are located as the index value of the first sampling point; After generating the parking fence corresponding to each of the first road segments, the device further includes: obtaining a fence set, any parking fence in the fence set intersecting with at least one other parking fence in the fence set; for two intersecting parking fences in the fence set, deleting one of the two parking fences.

8. A parking fence generation device, comprising a memory and a processor, wherein the memory is configured to store a computer program; The processor is configured to execute the computer program to implement the method according to any one of claims 1 to 6.

9. A computer-readable storage medium storing a computer program, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program implements the method according to any one of claims 1 to 6.

Images