CN117853714A - Parking area generation method, device, computer equipment and storage medium - Google Patents
Parking area generation method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN117853714A CN117853714A CN202410252651.3A CN202410252651A CN117853714A CN 117853714 A CN117853714 A CN 117853714A CN 202410252651 A CN202410252651 A CN 202410252651A CN 117853714 A CN117853714 A CN 117853714A
- Authority
- CN
- China
- Prior art keywords
- road
- target
- area
- parking
- parking area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 69
- 238000004891 communication Methods 0.000 claims description 27
- 238000004590 computer program Methods 0.000 claims description 21
- 238000010276 construction Methods 0.000 claims description 11
- 238000012216 screening Methods 0.000 claims description 8
- 238000013507 mapping Methods 0.000 claims description 7
- 230000008569 process Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 239000000523 sample Substances 0.000 description 3
- 230000003068 static effect Effects 0.000 description 2
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 229910021389 graphene Inorganic materials 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000000691 measurement method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Abstract
The application relates to a parking area generation method, a device, computer equipment and a storage medium. The method comprises the following steps: constructing a target road network of a target area based on the starting point position and the end point position of each road; the target road network comprises road lines of target roads in each road; determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area; aiming at each intersection cluster, taking a minimum circumscribed polygon from an expansion area corresponding to each target road in the intersection cluster to obtain a target sub-parking area of the intersection cluster; updating an initial parking area based on target sub-parking areas of each intersection cluster; and taking the area which is jointly contained by the preset service area of the target area and the updated initial parking area as a target parking area of the target area. By adopting the method, the efficiency of generating the parking area can be improved.
Description
Technical Field
The present application relates to the field of artificial intelligence, and in particular, to a parking area generating method, apparatus, computer device, storage medium, and computer program product.
Background
As sharing economies develop, sharing vehicles are entering more and more cities. The importance of the management of the shared vehicles in the process of operating the shared vehicles is self-evident. In order to avoid the user from being parked in disorder, and to facilitate the management of the shared vehicles, a parking area is generally defined. Only if the shared vehicle is parked to the parking area, the user can return the vehicle successfully.
However, in the conventional parking area generation method, the position and the range of the parking area are manually determined mainly by the personal experience of the staff. Therefore, the conventional parking area generation method requires a lot of time and is inefficient.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a parking area generating method, apparatus, computer device, computer-readable storage medium, and computer program product that can improve efficiency.
In a first aspect, the present application provides a parking area generating method, including:
obtaining road network data of a target area; the road network data comprises a starting point position, an ending point position and a road grade of each road;
constructing a target road network of the target area based on the starting point position and the end point position of each road; the target road network comprises road lines of target roads in the roads;
Determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area;
clustering the road lines of each target road in the target road network by adopting a preset first clustering algorithm to obtain an intersection cluster of the target area;
aiming at each intersection cluster, taking a minimum circumscribed polygon from an expansion area corresponding to each target road in the intersection cluster to obtain a target sub-parking area of the intersection cluster;
updating the initial parking area based on the target sub-parking areas of each intersection cluster;
and taking the area which is jointly contained by the preset service area of the target area and the updated initial parking area as a target parking area of the target area.
In one embodiment, the constructing the target road network of the target area based on the start point position and the end point position of each road includes:
constructing a road line of each alternative road of the target area according to the starting point position and the ending point position of each road;
and determining a target road network of the target area based on the road links of the candidate roads.
In one embodiment, the constructing the road route of each candidate road of the target area according to the starting point position and the end point position of each road includes:
determining a road with road grade meeting preset screening conditions as an alternative road;
and connecting the starting point position and the end point position of each alternative road to obtain a road line of each alternative road.
In one embodiment, the determining the target road network of the target area based on the road links of the candidate roads includes:
determining a non-communication link in the link of each candidate link based on the start position, the end position and the link of each candidate link;
and determining a target road network of the target area according to the road links of the candidate roads except for the non-communication link.
In one embodiment, the method further comprises:
inquiring a forbidden influence range corresponding to each interest point in a mapping relation between the preset interest point and the forbidden influence range;
determining a forbidden sub-region corresponding to the interest point based on the position of the interest point and the forbidden influence range corresponding to the interest point;
And taking the areas except the forbidden sub-areas corresponding to the interest points in the target parking area as updated target parking areas.
In one embodiment, the method further comprises:
obtaining information of the illegal stop order in a preset historical time period; the illicit order information includes a illicit location;
clustering each illegal location by adopting a preset second clustering algorithm to obtain a plurality of illegal location sets;
aiming at each illegal position set, taking the minimum circumscribed polygon of the illegal position set as an illegal subarea corresponding to the illegal position set;
updating the target parking area of the target area based on the corresponding parking violation subareas of each parking violation position set.
In one embodiment, the method further comprises:
acquiring target event information; the target event information comprises event identification and event time;
determining a temporary forbidden region corresponding to the target event information based on the event identification;
and updating the target parking area of the target area based on the temporary forbidden parking area at the event time.
In a second aspect, the present application further provides a parking area generating device, including:
The first acquisition module is used for acquiring road network data of the target area; the road network data comprises a starting point position, an ending point position and a road grade of each road;
the construction module is used for constructing a target road network of the target area based on the starting point position and the end point position of each road; the target road network comprises road lines of target roads in the roads;
the first determining module is used for determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area;
the first clustering module is used for clustering the road lines of each target road in the target road network by adopting a preset first clustering algorithm to obtain an intersection cluster of the target area;
the second determining module is used for taking a minimum external polygon from the expansion area corresponding to each target road in each intersection cluster to obtain a target sub-parking area of the intersection cluster;
the first updating module is used for updating the initial parking areas based on the target sub-parking areas of the intersection cluster;
And the third determining module is used for taking the area which is jointly contained by the preset service area of the target area and the updated initial parking area as a target parking area of the target area.
In one embodiment, the construction module is specifically configured to:
constructing a road line of each alternative road of the target area according to the starting point position and the ending point position of each road;
and determining a target road network of the target area based on the road links of the candidate roads.
In one embodiment, the construction module is specifically configured to:
determining a road with road grade meeting preset screening conditions as an alternative road;
and connecting the starting point position and the end point position of each alternative road to obtain a road line of each alternative road.
In one embodiment, the construction module is specifically configured to:
determining a non-communication link in the link of each candidate link based on the start position, the end position and the link of each candidate link;
and determining a target road network of the target area according to the road links of the candidate roads except for the non-communication link.
In one embodiment, the apparatus further comprises:
the query module is used for querying a forbidden influence range corresponding to each interest point in a mapping relation between the preset interest point and the forbidden influence range;
a fourth determining module, configured to determine a forbidden sub-area corresponding to the interest point based on the position of the interest point and a forbidden influence range corresponding to the interest point;
and the second updating module is used for taking the areas except the forbidden sub-areas corresponding to the interest points in the target parking area as updated target parking areas.
In one embodiment, the apparatus further comprises:
the second acquisition module is used for acquiring the information of the illegal stop order in the preset historical time period; the illicit order information includes a illicit location;
the second clustering module is used for clustering the illegal positions by adopting a preset second clustering algorithm to obtain a plurality of illegal position sets;
a fifth determining module, configured to, for each of the stopping position sets, use a minimum circumscribing polygon of the stopping position set as a stopping sub-area corresponding to the stopping position set;
and the third updating module is used for updating the target parking area of the target area based on the corresponding parking violation subareas of each parking violation position set.
In one embodiment, the apparatus further comprises:
the third acquisition module is used for acquiring the target event information; the target event information comprises event identification and event time;
a sixth determining module, configured to determine a temporary forbidden stop zone corresponding to the target event information based on the event identifier;
and a fourth updating module, configured to update, at the event time, a target parking area of the target area based on the temporary forbidden parking area.
In a third aspect, the present application also provides a computer device comprising a memory storing a computer program and a processor implementing the steps of the first aspect described above when the processor executes the computer program.
In a fourth aspect, the present application also provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the first aspect described above.
In a fifth aspect, the present application also provides a computer program product comprising a computer program which, when executed by a processor, implements the steps of the first aspect described above.
The parking area generation method, the device, the computer equipment, the storage medium and the computer program product acquire road network data of a target area; the road network data comprises a starting point position, an ending point position and a road grade of each road; constructing a target road network of the target area based on the starting point position and the end point position of each road; the target road network comprises road lines of target roads in the roads; determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area; clustering the road lines of each target road in the target road network by adopting a preset first clustering algorithm to obtain an intersection cluster of the target area; aiming at each intersection cluster, taking a minimum circumscribed polygon from an expansion area corresponding to each target road in the intersection cluster to obtain a target sub-parking area of the intersection cluster; updating the initial parking area based on the target sub-parking areas of each intersection cluster; and taking the area which is jointly contained by the preset service area of the target area and the updated initial parking area as a target parking area of the target area. Thus, a target road network composed of road lines of a target road is constructed based on road network data of the target region, then the road lines are expanded based on road grades, the expansion region corresponding to each target road is determined, the minimum circumscribed polygon of the expansion region corresponding to the intersection cluster is used for replacing part of the expansion region, and then the region commonly contained by the preset service region and the updated expansion region is used as a target parking region to automatically determine the target parking region of the target region, so that the method does not need to rely on manpower, consumes short time and can improve the efficiency of generating the parking region.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the related art, the drawings that are required to be used in the embodiments or the related technical descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to the drawings without inventive effort for a person having ordinary skill in the art.
FIG. 1 is a flow chart of a method of generating a parking area in one embodiment;
FIG. 2 is a schematic diagram of a target sub-parking area of a road-junction cluster in one embodiment;
FIG. 3 is a flowchart of a step of constructing a target road network for a target area based on a start position and an end position of each road in one embodiment;
FIG. 4 is a flow chart of the road link steps of constructing each alternative road of the target area in one embodiment;
FIG. 5 is a flowchart illustrating steps for determining a target road network for a target area based on road links of candidate roads in one embodiment;
FIG. 6 is a schematic diagram of a non-link and target road network in one embodiment;
FIG. 7 is a flow chart of a method of generating a parking area according to another embodiment;
FIG. 8 is a flow chart of a method of generating a parking area according to another embodiment;
FIG. 9 is a flow chart of a method of generating a parking area according to another embodiment;
FIG. 10 is a block diagram showing the construction of a parking area generating apparatus in one embodiment;
FIG. 11 is an internal block diagram of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
In one embodiment, as shown in fig. 1, a parking area generating method is provided, where the method is applied to a terminal to illustrate the method, it is understood that the method may also be applied to a server, and may also be applied to a system including the terminal and the server, and implemented through interaction between the terminal and the server. The terminal can be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, internet of things equipment and portable wearable equipment, and the internet of things equipment can be smart speakers, smart televisions, smart air conditioners, smart vehicle-mounted equipment and the like. The portable wearable device may be a smart watch, smart bracelet, headset, or the like. The server may be implemented as a stand-alone server or as a server cluster composed of a plurality of servers. In this embodiment, the method includes the steps of:
Step 101, road network data of a target area is obtained.
The road network data comprises a starting point position, an end point position and a road grade of each road.
In the embodiment of the present application, the target area is an area where a parking area is to be generated, and is a launch area of the shared vehicle. The target area may be a city, may be a city service area, or may be an area where other forms of shared vehicles are launched. The shared vehicle is a vehicle sharing economy, and can be a shared bicycle, a shared electric bicycle and a shared automobile. The road network data is data of all roads of the target area, and may further include one or more of a road identifier and a road length of each road. Road grades are used to distinguish express ways, arterial roads, secondary arterial roads, branches, minor roads, and other types of roads. The road identification may be a road name. The start position and the end position may be expressed in terms of longitude and latitude. The road network data may include a start position and an end position of a plurality of sub-links of each road, i.e., a road is composed of a plurality of sub-links, and the road network data includes a start position and an end position of each sub-link of the road. Therefore, the road is stored and represented by a plurality of line segments, the actual situation that the actual road is not horizontal and vertical is more met, the accuracy of road network data can be improved, and the accuracy of parking area generation is further improved.
Step 102, constructing a target road network of the target area based on the starting point position and the end point position of each road.
The target road network comprises road lines of target roads in all roads.
In the embodiment of the application, the target road is a road capable of stopping or returning a vehicle without considering factors such as actual operation conditions. The road route of the target road may be a line segment or a route formed by a plurality of line segments.
And step 103, determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area.
In the embodiment of the application, for each target road, the terminal determines an extended area corresponding to the target road based on the road grade of the target road and an area extension algorithm corresponding to the road grade. Then, the terminal constructs the expansion area corresponding to each target road into an initial parking area of the target area. The initial parking area is a parking area or a vehicle returning area which is preliminarily determined or generated.
Specifically, for each target road, the terminal queries the first expansion width corresponding to the road grade of the target road in a preset mapping relationship between the road grade and the first expansion width. Then, the terminal adds the preset second expansion width and the first expansion width corresponding to the target road to obtain the target expansion width of the target road. Then, the terminal determines an expansion area corresponding to the target road based on the road course and the target expansion width of the target road. The extended area corresponding to one target road may be a rectangle or a polygon formed by a plurality of rectangles. The first extended width may be a road width and the second extended width may be a buffer width. Thus, the second expansion width of the road side is used as the buffer width, and the buffer parking area positioned at the road side is arranged for the parking area, so that the user can be prevented from stopping the shared vehicle on the road to obstruct traffic. The second expansion widths of the different roads may be different or the same, for example, the second expansion widths of the different roads may be 10m each. The first extended width may be a road minimum standard width of a country in which the target area is located. For example, the minimum standard width of the road of the expressway is more than 50m, the minimum standard width of the road of the main road is 30-40m, the minimum standard width of the road of the secondary main road is 20-24m, and the minimum standard width of the road of the branch road is 14-18 m. Therefore, under the condition that the road width cannot be accurately obtained in practice, the method still can reasonably determine the first expansion width of the target road, generate a reasonable initial parking area and further improve the accuracy of parking area generation.
And 104, clustering the road lines of all the target roads in the target road network by adopting a preset first clustering algorithm to obtain an intersection cluster of the target area.
In the embodiment of the application, the first clustering algorithm may be a Density clustering algorithm, for example, may be a Density-based spatial clustering algorithm (Density-Based Spatial Clustering of Applications with Noise, DBSCAN) robust to noise. The first clustering algorithm has the following three parameters: (1) eps: the cluster radius, i.e. the maximum distance between the road points considered in the clustering, is specified. If the distance between two points is less than eps, they are considered to belong to the same cluster. Larger eps will produce larger clusters, while smaller eps will produce smaller clusters. Thus, the eps parameter is an important super parameter that needs to be adjusted according to the characteristics of the dataset, which may be 26 meters, for example. (2) min_samples: the minimum number of samples required to form a cluster is specified. If the number of samples in a region is less than min_samples, the region is considered noise instead of clusters. Increasing min_samples will result in fewer but more compact clusters being generated, while decreasing min_samples will result in more but more loose clusters being generated. The minimum sample point parameter may be 2. (3) Metric: a metric method for calculating the distance is specified. A seminormal (haverine) formula is used as a distance measurement method, which is typically used to calculate the distance between two latitude and longitude points on the earth's surface, with the return distance in meters. The intersection cluster is a short road set with concentrated intersection areas, and can contain longitude and latitude coordinate information of roads in the set.
Step 105, for each intersection cluster, taking the minimum circumscribed polygon for the expansion area corresponding to each target road in the intersection cluster, and obtaining the target sub-parking area of the intersection cluster.
In one embodiment, the target sub-parking area of the intersection cluster is shown as the smallest circumscribed polygon in fig. 2.
And 106, updating the initial parking area based on the target sub-parking areas of the intersection clusters.
In the embodiment of the application, for each intersection cluster, the terminal updates the expansion area corresponding to each target road in the intersection cluster in the initial parking area to the target sub-parking area of the intersection cluster.
And 107, taking the area which is contained in the preset service area of the target area and the updated initial parking area as a target parking area of the target area.
In one embodiment, the terminal uses an area except the target parking area in the preset service area of the target area as a forbidden parking area of the target area. Or the terminal takes the area except the target parking area in the target area as a forbidden parking area of the target area.
In the parking area generation method, road network data of a target area are acquired; the road network data comprises a starting point position, an end point position and a road grade of each road; constructing a target road network of a target area based on the starting point position and the end point position of each road; the target road network comprises road lines of target roads in each road; determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area; clustering the road lines of all target roads in a target road network by adopting a preset first clustering algorithm to obtain an intersection cluster of a target area; aiming at each intersection cluster, taking a minimum circumscribed polygon from an expansion area corresponding to each target road in the intersection cluster to obtain a target sub-parking area of the intersection cluster; updating an initial parking area based on target sub-parking areas of each intersection cluster; and taking the area which is jointly contained by the preset service area of the target area and the updated initial parking area as a target parking area of the target area. Thus, a target road network formed by road lines of a target road is constructed based on road network data of the target region, then the road lines are expanded based on road grades, the expansion region corresponding to each target road is determined, the minimum circumscribed polygon of the expansion region corresponding to the intersection cluster is used for replacing part of the expansion region, the region which is contained by the preset service region and the updated expansion region together is used as a target parking region, the target parking region of the target region is automatically determined, labor is not required, the consumption time is short, and the efficiency of generating the parking region can be improved. In addition, the parking area generated by the method is generated along the main road in the target area, comprises most of positions beside the main road, is more convenient for managing and sharing vehicles, can avoid excessive walking caused by a user for returning vehicles, improves user experience, and can improve the rationality of the generation of the parking area compared with a single and excessively dispersed parking area which is manually divided. In addition, the method expands the parkable area corresponding to the concentrated short-and-small road set at the intersection area into the minimum circumscribed polygon, and takes the forbidden parking area among the original short-and-small roads as the parking area, so that the method is more in line with the actual situation of parking shared vehicles or returning vehicles at the intersection, can avoid failure of returning vehicles, which is easily caused by a plurality of small forbidden parking areas among the short-and-small roads at the intersection, improves user experience, and can improve the accuracy and rationality of the generation of the parking area.
In one embodiment, as shown in fig. 3, the specific process of constructing the target road network of the target area based on the start point position and the end point position of each road includes the steps of:
step 301, constructing a road route of each candidate road of the target area according to the starting point position and the end point position of each road.
In the embodiment of the application, the terminal screens the candidate roads in each road based on the preset screening conditions. Then, the terminal will construct the road course of each candidate road of the target area based on the start point position and the end point position of each candidate road.
In one example, the terminal takes each link as an alternative link.
Step 302, determining a target road network of a target area based on the road links of the candidate roads.
In the embodiment of the application, the terminal may configure the road route of each candidate road into the target road network of the target area.
In the parking area generation method, road lines of alternative roads of the target area are constructed according to the starting point position and the end point position of each road; a target road network of the target area is determined based on the road links of the candidate roads. In this way, the road routes in the target area are screened a plurality of times to obtain the road route of the target road for generating the parking area, and it is possible to avoid using the road area unsuitable for parking the shared vehicle as a part of the parking area, and also to avoid redundancy of the generated parking area, and to improve the accuracy of the parking area generation.
In one embodiment, as shown in fig. 4, the specific process of constructing the road course of each candidate road of the target area according to the start point position and the end point position of each road includes the steps of:
in step 401, a road whose road class satisfies a preset screening condition is determined as an alternative road.
In the embodiment of the application, under the condition that the road is more important as the road grade is higher, the terminal takes the road with the road grade being greater than or equal to the preset grade threshold as the candidate road. On the contrary, in the case that the lower the road grade is, the more important the road is, the terminal takes the road with the road grade less than or equal to the preset grade threshold as the candidate road. For example, the terminal takes a road with road class corresponding to expressways, arterial roads, secondary arterial roads and branches as an alternative road.
Step 402, for each candidate road, connecting the starting point position and the end point position of the candidate road, and obtaining the road line of the candidate road.
In the embodiment of the application, for each candidate road, in the case that the candidate road includes a plurality of sub-road segments, the terminal is sequentially connected to the start position and the end position of each sub-road segment of the candidate road, so as to obtain the road line of the candidate road. In the case that the candidate road includes one sub-link, the terminal connects the start position and the end position of the candidate road to obtain the road link of the candidate road.
In the parking area generation method, a road with road grade meeting preset screening conditions is determined as an alternative road; and connecting the starting point position and the end point position of each alternative road for each alternative road to obtain the road line of the alternative road. Like this, filter the road circuit of the non-expressway of road class, arterial road, secondary arterial road, branch road, can avoid too complicated little road in the city and the inside road of many districts of well also regard as the parking district as part, can avoid the user to park the shared vehicle to only oneself convenient or only oneself found place for the convenience of oneself, can improve the rate of utilization of shared vehicle, convenient management, also can improve the accuracy and the rationality that the parking district generated.
In one embodiment, as shown in fig. 5, the specific process of determining the target road network of the target area based on the road links of the candidate roads includes the steps of:
in step 501, a non-communication link is determined in the link of each candidate link based on the start position, the end position, and the link of each candidate link.
In the embodiment of the present application, the non-communication link is a link that is not in communication with other links.
For each candidate road, the terminal may calculate the distance from the start position of the candidate road to each other road link and the distance from the end position of the candidate road to each other road link, respectively. Then, the terminal determines a non-communication link among the links of each candidate road based on the distance from the start position of the candidate road to each other link and the distance from the end position of the candidate road to each other link.
In one example, the terminal takes the minimum value of the distance from the start position of the candidate road to each other road link and the distance from the end position of the candidate road to each other road link as the minimum distance from the candidate road to each other road link. And if the minimum distance from the alternative road to other roads is greater than the preset distance threshold, the terminal takes the road line of the alternative road as a non-communication line.
In one example, for each other road, the terminal takes, as the minimum distance of the candidate road to the other road, the minimum value of the distance of the start position of the candidate road to the other road route and the distance of the end position of the candidate road to the other road route. If the minimum distance from the alternative road to the other roads is greater than the preset distance threshold, the terminal increases the non-communication count of the alternative road by 1. If the non-communication count of the alternative road is larger than a preset non-communication count threshold, the terminal takes the road line of the alternative road as a non-communication line.
Step 502, determining a target road network of the target area according to the road links of the candidate roads except the non-communication link.
In the embodiment of the application, the terminal forms a target road network of the target area by the road links of the candidate roads except the non-communication link.
It will be appreciated that the specific process of steps 401 and 501 may be implemented by road identification. For example, the specific process of step 401 may be: and the terminal takes the road mark with the road grade meeting the preset screening condition as an alternative road mark. Then, the terminal uses the road corresponding to the candidate road identifier as a candidate road. The specific procedure implemented by the road identification of step 501 is similar to the specific procedure implemented by the road identification of this step 401.
In one embodiment, the non-communication link is shown as a link within a rectangular box in fig. 6, and the target road network is shown as a link other than the link within the rectangular box in fig. 6.
In the parking area generation method, determining a non-communication route in a road route of each candidate road based on a start position, an end position and the road route of each candidate road; and determining a target road network of the target area according to the road links of the candidate roads except the non-communication link. Therefore, the roads which cannot be communicated with other roads of the target area are removed, isolated parking of the shared vehicle can be avoided, the shared vehicle is prevented from being parked to a place which is convenient only or found only by the user for the convenience of the user, the utilization rate of the shared vehicle can be improved, the management is convenient, and the accuracy and the rationality of the generation of the parking area can be improved.
In one embodiment, as shown in fig. 7, the method further comprises the steps of:
in step 701, for each interest point, in a mapping relationship between a preset interest point and a forbidden influence range, the forbidden influence range corresponding to the interest point is queried.
Step 702, determining a forbidden sub-area corresponding to the interest point based on the position of the interest point and the forbidden influence range corresponding to the interest point.
And step 703, taking the area except the forbidden sub-area corresponding to each interest point in the target parking area as the updated target parking area.
In embodiments of the present application, points of interest (Point Of Interest, POI) include hospitals, schools, government institutions, parks, and business centers. Therefore, the forbidden sub-area corresponding to the interest point is determined according to the interest point, the target parking area is adjusted, the actual situation is more met, and the accuracy and the rationality of the generation of the parking area can be improved.
In one embodiment, as shown in fig. 8, the parking area generating method further includes the steps of:
step 801, obtaining information of a parking violation order within a preset historical time period.
Wherein the offending order information includes an offending location.
In the embodiment of the present application, the historical time period may be the latest time period, for example, the latest month, that is, the start time and the end time of the historical time period are changed with the change of the current time.
Step 802, clustering each illegal location by adopting a preset second clustering algorithm to obtain a plurality of illegal location sets.
In the embodiment of the present application, the second clustering algorithm may be the same as or different from the first clustering algorithm.
Step 803, regarding each illegal location set, using the minimum circumscribed polygon of the illegal location set as the illegal sub-area corresponding to the illegal location set.
Step 804, updating the target parking area of the target area based on the parking violation sub-areas corresponding to the respective parking violation position sets.
In the embodiment of the application, the terminal uses the areas except the corresponding parking violation subareas of the parking violation position sets in the target parking area as the updated target parking area of the target area.
In one example, a terminal obtains breach indicative information corresponding to each breach sub-area. The parking violation indication information is used for indicating whether a certain area is allowed to prohibit parking of the shared vehicle. If the parking violation indication information corresponding to the parking violation sub-area indicates that the parking violation sub-area clearly prohibits the shared vehicle from being parked, the terminal takes the parking violation sub-area as a target parking violation sub-area. The terminal takes the areas except for each target parking violation subarea in the target parking area as the updated target parking area of the target area.
In the parking area generation method, obtaining information of the illegal parking order in a preset historical time period; clustering each illegal location by adopting a preset second clustering algorithm to obtain a plurality of illegal location sets; aiming at each illegal position set, taking the minimum circumscribed polygon of the illegal position set as an illegal subarea corresponding to the illegal position set; and updating the target parking area of the target area based on the corresponding parking violation subareas of each parking violation position set. Therefore, according to the latest historical illegal parking data and by combining with actual conditions, the target parking area is regulated periodically and dynamically, and the real-time accuracy and rationality of the generation of the parking area can be improved.
In one embodiment, as shown in fig. 9, the parking area generating method further includes the steps of:
step 901, obtaining target event information.
Wherein the target event information includes event identification and event time.
In the embodiment of the present application, the target event information is event information of a target event having an influence on the parking area. Target events include special events, emergency events, and city management events. Event identification is used to distinguish what type of target event is. Event time is the time range in which an event occurs or an event has an effect on the parking area.
Step 902, determining a temporary forbidden area corresponding to the target event information based on the event identification.
In the embodiment of the present application, the terminal may query the temporary forbidden region corresponding to the event identifier of the target event information in the mapping relationship between the preset event identifier and the temporary forbidden region. The temporary forbidden parking area is an area for temporarily forbidden parking the shared vehicle or returning the vehicle, and is a temporary management and control area.
In step 903, the target parking area of the target area is updated based on the temporary stop-free area at the event time.
In the embodiment of the application, the terminal uses the area of the target parking area except the temporary forbidden parking area as the updated target parking area of the target area at the event time.
In the parking area generation method, target event information is acquired; determining a temporary forbidden region corresponding to the target event information based on the event identification; and updating the target parking area of the target area based on the temporary forbidden area at the event time. Therefore, according to the real-time target event information affecting the parking area, the temporary forbidden parking area is set during the event time when the target event affects the parking area, the temporary forbidden parking area in the target parking area is partially removed, the real-time updating of the parking area is realized, the real-time updating method is more in line with the actual situation, and the real-time accuracy and rationality of the generation of the parking area can be improved.
It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides a parking area generating device for realizing the above related parking area generating method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation in the embodiments of the device for generating a parking area provided below may refer to the limitation of the method for generating a parking area hereinabove, and will not be described herein.
In an exemplary embodiment, as shown in fig. 10, there is provided a parking area generating apparatus 1000 including: a first acquisition module 1010, a construction module 1020, a first determination module 1030, a first clustering module 1040, a second determination module 1050, a first update module 1060, and a third determination module 1070, wherein:
a first obtaining module 1010, configured to obtain road network data of a target area; the road network data comprises a starting point position, an ending point position and a road grade of each road;
a construction module 1020, configured to construct a target road network of the target area based on the start position and the end position of each road; the target road network comprises road lines of target roads in the roads;
a first determining module 1030, configured to determine an extended area corresponding to each target road based on a road class of each target road and an area extension algorithm corresponding to the road class, so as to obtain an initial parking area of the target area;
the first clustering module 1040 is configured to cluster, by using a preset first clustering algorithm, road lines of each target road in the target road network, so as to obtain an intersection cluster of the target area;
The second determining module 1050 is configured to, for each intersection cluster, obtain a target sub-parking area of the intersection cluster by taking a minimum circumscribing polygon for an extended area corresponding to each target road in the intersection cluster;
a first updating module 1060, configured to update the initial parking area based on the target sub-parking areas of each of the intersection clusters;
the third determining module 1070 is configured to use, as the target parking area of the target area, an area that is included in the preset service area of the target area and the updated initial parking area together.
Optionally, the construction module 1020 is specifically configured to:
constructing a road line of each alternative road of the target area according to the starting point position and the ending point position of each road;
and determining a target road network of the target area based on the road links of the candidate roads.
Optionally, the construction module 1020 is specifically configured to:
determining a road with road grade meeting preset screening conditions as an alternative road;
and connecting the starting point position and the end point position of each alternative road to obtain a road line of each alternative road.
Optionally, the construction module 1020 is specifically configured to:
Determining a non-communication link in the link of each candidate link based on the start position, the end position and the link of each candidate link;
and determining a target road network of the target area according to the road links of the candidate roads except for the non-communication link.
Optionally, the apparatus 1000 further includes:
the query module is used for querying a forbidden influence range corresponding to each interest point in a mapping relation between the preset interest point and the forbidden influence range;
a fourth determining module, configured to determine a forbidden sub-area corresponding to the interest point based on the position of the interest point and a forbidden influence range corresponding to the interest point;
and the second updating module is used for taking the areas except the forbidden sub-areas corresponding to the interest points in the target parking area as updated target parking areas.
Optionally, the apparatus 1000 further includes:
the second acquisition module is used for acquiring the information of the illegal stop order in the preset historical time period; the illicit order information includes a illicit location;
the second clustering module is used for clustering the illegal positions by adopting a preset second clustering algorithm to obtain a plurality of illegal position sets;
A fifth determining module, configured to, for each of the stopping position sets, use a minimum circumscribing polygon of the stopping position set as a stopping sub-area corresponding to the stopping position set;
and the third updating module is used for updating the target parking area of the target area based on the corresponding parking violation subareas of each parking violation position set.
Optionally, the apparatus 1000 further includes:
the third acquisition module is used for acquiring the target event information; the target event information comprises event identification and event time;
a sixth determining module, configured to determine a temporary forbidden stop zone corresponding to the target event information based on the event identifier;
and a fourth updating module, configured to update, at the event time, a target parking area of the target area based on the temporary forbidden parking area.
The respective modules in the above parking area generating device may be implemented in whole or in part by software, hardware, and a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In an exemplary embodiment, a computer device, which may be a terminal, is provided, and an internal structure thereof may be as shown in fig. 11. The computer device includes a processor, a memory, an input/output interface, a communication interface, a display unit, and an input means. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a parking area generating method. The display unit of the computer device is used for forming a visual picture, and can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be a key, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the structure shown in fig. 11 is merely a block diagram of a portion of the structure associated with the present application and is not limiting of the computer device to which the present application applies, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.
In an exemplary embodiment, a computer device is provided, comprising a memory and a processor, the memory having stored therein a computer program, the processor performing the steps of the method embodiments described above when the computer program is executed.
In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, implements the steps of the method embodiments described above.
In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.
It should be noted that, the user information (including, but not limited to, user equipment information, user personal information, etc.) and the data (including, but not limited to, data for analysis, stored data, presented data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party, and the collection, use, and processing of the related data are required to meet the related regulations.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the various embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the various embodiments provided herein may include at least one of relational databases and non-relational databases. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic units, quantum computing-based data processing logic units, etc., without being limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples only represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the present application. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application shall be subject to the appended claims.
Claims (10)
1. A method of generating a parking area, the method comprising:
obtaining road network data of a target area; the road network data comprises a starting point position, an ending point position and a road grade of each road;
constructing a target road network of the target area based on the starting point position and the end point position of each road; the target road network comprises road lines of target roads in the roads;
Determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area;
clustering the road lines of each target road in the target road network by adopting a preset first clustering algorithm to obtain an intersection cluster of the target area;
aiming at each intersection cluster, taking a minimum circumscribed polygon from an expansion area corresponding to each target road in the intersection cluster to obtain a target sub-parking area of the intersection cluster;
updating the initial parking area based on the target sub-parking areas of each intersection cluster;
and taking the area which is jointly contained by the preset service area of the target area and the updated initial parking area as a target parking area of the target area.
2. The method according to claim 1, wherein constructing the target road network of the target area based on the start point position and the end point position of each road comprises:
constructing a road line of each alternative road of the target area according to the starting point position and the ending point position of each road;
And determining a target road network of the target area based on the road links of the candidate roads.
3. The method according to claim 2, wherein constructing the road course of each candidate road of the target area according to the start point position and the end point position of each road comprises:
determining a road with road grade meeting preset screening conditions as an alternative road;
and connecting the starting point position and the end point position of each alternative road to obtain a road line of each alternative road.
4. The method of claim 2, wherein the determining the target road network for the target area based on the road course of the candidate roads comprises:
determining a non-communication link in the link of each candidate link based on the start position, the end position and the link of each candidate link;
and determining a target road network of the target area according to the road links of the candidate roads except for the non-communication link.
5. The method according to claim 1, wherein the method further comprises:
inquiring a forbidden influence range corresponding to each interest point in a mapping relation between the preset interest point and the forbidden influence range;
Determining a forbidden sub-region corresponding to the interest point based on the position of the interest point and the forbidden influence range corresponding to the interest point;
and taking the areas except the forbidden sub-areas corresponding to the interest points in the target parking area as updated target parking areas.
6. The method according to claim 1, wherein the method further comprises:
obtaining information of the illegal stop order in a preset historical time period; the illicit order information includes a illicit location;
clustering each illegal location by adopting a preset second clustering algorithm to obtain a plurality of illegal location sets;
aiming at each illegal position set, taking the minimum circumscribed polygon of the illegal position set as an illegal subarea corresponding to the illegal position set;
updating the target parking area of the target area based on the corresponding parking violation subareas of each parking violation position set.
7. The method according to claim 1, wherein the method further comprises:
acquiring target event information; the target event information comprises event identification and event time;
determining a temporary forbidden region corresponding to the target event information based on the event identification;
And updating the target parking area of the target area based on the temporary forbidden parking area at the event time.
8. A parking area generating apparatus, characterized in that the apparatus comprises:
the first acquisition module is used for acquiring road network data of the target area; the road network data comprises a starting point position, an ending point position and a road grade of each road;
the construction module is used for constructing a target road network of the target area based on the starting point position and the end point position of each road; the target road network comprises road lines of target roads in the roads;
the first determining module is used for determining an expansion area corresponding to each target road based on the road grade of each target road and an area expansion algorithm corresponding to the road grade, and obtaining an initial parking area of the target area;
the first clustering module is used for clustering the road lines of each target road in the target road network by adopting a preset first clustering algorithm to obtain an intersection cluster of the target area;
the second determining module is used for taking a minimum external polygon from the expansion area corresponding to each target road in each intersection cluster to obtain a target sub-parking area of the intersection cluster;
The first updating module is used for updating the initial parking areas based on the target sub-parking areas of the intersection cluster;
and the third determining module is used for taking the area which is jointly contained by the preset service area of the target area and the updated initial parking area as a target parking area of the target area.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 7 when the computer program is executed.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410252651.3A CN117853714A (en) | 2024-03-06 | 2024-03-06 | Parking area generation method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410252651.3A CN117853714A (en) | 2024-03-06 | 2024-03-06 | Parking area generation method, device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117853714A true CN117853714A (en) | 2024-04-09 |
Family
ID=90536531
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410252651.3A Pending CN117853714A (en) | 2024-03-06 | 2024-03-06 | Parking area generation method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117853714A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101493336A (en) * | 2008-01-25 | 2009-07-29 | 株式会社电装 | Apparatus and method for map data management |
| US20170026786A1 (en) * | 2015-07-21 | 2017-01-26 | International Business Machines Corporation | Geo-fence management using a cluster analysis technique |
| CN109819403A (en) * | 2019-01-28 | 2019-05-28 | 北京摩拜科技有限公司 | Generate the method, apparatus and electronic equipment of fence |
| CN109949692A (en) * | 2019-03-27 | 2019-06-28 | 腾讯大地通途（北京）科技有限公司 | Road network method, apparatus, computer equipment and storage medium |
| CN110765219A (en) * | 2019-08-05 | 2020-02-07 | 上海晶赞融宣科技有限公司 | Geo-fence generation method and device, computer equipment and storage medium |
| CN111881939A (en) * | 2020-06-24 | 2020-11-03 | 东南大学 | Shared single-vehicle parking area layout method based on clustering algorithm |
| CN113095406A (en) * | 2021-04-14 | 2021-07-09 | 国能智慧科技发展(江苏)有限公司 | Electronic fence effective time period management and control method based on intelligent Internet of things |
| CN116580545A (en) * | 2023-04-10 | 2023-08-11 | 广州交信投科技股份有限公司 | Standard parking method and system for sharing bicycle based on electronic fence |
-
2024
- 2024-03-06 CN CN202410252651.3A patent/CN117853714A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101493336A (en) * | 2008-01-25 | 2009-07-29 | 株式会社电装 | Apparatus and method for map data management |
| US20170026786A1 (en) * | 2015-07-21 | 2017-01-26 | International Business Machines Corporation | Geo-fence management using a cluster analysis technique |
| CN109819403A (en) * | 2019-01-28 | 2019-05-28 | 北京摩拜科技有限公司 | Generate the method, apparatus and electronic equipment of fence |
| CN109949692A (en) * | 2019-03-27 | 2019-06-28 | 腾讯大地通途（北京）科技有限公司 | Road network method, apparatus, computer equipment and storage medium |
| CN110765219A (en) * | 2019-08-05 | 2020-02-07 | 上海晶赞融宣科技有限公司 | Geo-fence generation method and device, computer equipment and storage medium |
| CN111881939A (en) * | 2020-06-24 | 2020-11-03 | 东南大学 | Shared single-vehicle parking area layout method based on clustering algorithm |
| CN113095406A (en) * | 2021-04-14 | 2021-07-09 | 国能智慧科技发展(江苏)有限公司 | Electronic fence effective time period management and control method based on intelligent Internet of things |
| CN116580545A (en) * | 2023-04-10 | 2023-08-11 | 广州交信投科技股份有限公司 | Standard parking method and system for sharing bicycle based on electronic fence |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9671237B1 (en) | Optimized generation of navigation instructions based on computed parking probability values | |
| US7953548B2 (en) | Location-based information determination | |
| US10502579B2 (en) | Method and apparatus for determining modal routes between an origin area and a destination area | |
| CN106595682B (en) | Differential updating method and system for map data and server | |
| Wei et al. | Multiscale identification of urban functional polycentricity for planning implications: An integrated approach using geo-big transport data and complex network modeling | |
| CN112100196B (en) | Real-time traffic information processing method and system and electronic equipment | |
| US11282394B2 (en) | Methods and systems for spatial clustering based on mobility data | |
| US20160093206A1 (en) | Method and apparatus for providing smaller incremental updates to a navigational database | |
| CN106595681B (en) | Differential updating method and system for path data and server | |
| Zhao et al. | A network distance and graph-partitioning-based clustering method for improving the accuracy of urban hotspot detection | |
| JP6098302B2 (en) | Navigation system, navigation method, and navigation program | |
| JP2016143232A (en) | Position information management device and position information management method | |
| CN110895543A (en) | Population migration tracking display method and device and storage medium | |
| CN110046210B (en) | Map information updating method and device, electronic equipment and storage medium | |
| CN117853714A (en) | Parking area generation method, device, computer equipment and storage medium | |
| CN111859187A (en) | POI query method, device, equipment and medium based on distributed graph database | |
| CN112084273A (en) | Map display method, device and system and computer readable storage medium | |
| Yap et al. | A Global Feature-Rich Network Dataset of Cities and Dashboard for Comprehensive Urban Analyses | |
| US20230206753A1 (en) | Method, apparatus, and system for traffic prediction based on road segment travel time reliability | |
| US11423062B2 (en) | Apparatus and methods for generating update data for a map database | |
| JP4037167B2 (en) | Map data processor | |
| Barman et al. | An approach to GIS-based traffic information system using Spatial Oracle | |
| Antonini et al. | Topology-aware indexing system for urban knowledge | |
| US20230345205A1 (en) | Home location based normalization | |
| US20220180741A1 (en) | Method, apparatus and computer program product for detecting a lane closure using probe data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination |