A method and system for planning vehicle driving guidance for parking spaces and paths

Abstract

The present invention discloses a method and a system for planning vehicle driving guidance for parking spaces and paths. According to the parking habits obtained by clustering historical parking data, parking spaces are preliminarily planned for the incoming vehicles, and the estimated departure time is calculated. On the basis of the preliminarily planned parking spaces, correction is performed on the principle that the congestion value of the channel where the planned parking space is located meets the predetermined requirements at the estimated departure time. The congestion thresholds of each channel are adaptively adjusted according to the vehicle flow at the parking lot exit. According to the finally planned parking spaces, the driving path is planned on the principle of the shortest incoming and outgoing time and / or the shortest distance. The actual parking space of the vehicle is monitored, and according to the estimated departure time of the vehicle, the congestion value of the channel at this time is updated in a timely manner. The present invention can match the frequently used parking spaces and plan a path with less incoming and outgoing time for the vehicle owner. As long as some vehicle owners follow the planned scheme, the congestion situation of each channel in the field can be effectively reduced, and the parking lot can operate efficiently as a whole.

Description

Technical Field

[0001] The present invention relates to the field of parking lot management, and in particular to a method and system for planning vehicle driving guidance for parking spaces and paths. Background Art

[0002] For enclosed parking lots such as buildings, shopping malls, and comprehensive squares, due to different parking lot layouts or different purposes of car owners, the best parking spaces recommended for car owners should be differentiated. The conventional recommendation method is to only recommend vacant parking spaces for car owners, or better yet, recommend the parking spaces closest to the entrance / exit / elevator. This method is mechanical and does not consider the parking needs of users. Moreover, all users are recommended with the same scheme, which is determined based on the vacancy of parking spaces at the time of recommendation. Multiple vehicles entering the lot simultaneously may be recommended the same parking space. Also, since all vehicles are guided to the same area, it is easy to cause congestion in the passageways.

[0003] Regarding the vehicle flow within the lot, there is a solution to understand the real-time vehicle flow within the lot by adding channel monitoring cameras. However, this solution is only used to understand the situation within the lot, facilitate guiding the staff to the scene for guidance, or display the congestion situation of each channel on a public screen, and is not effectively incorporated into the path planning. For example, the method and parking guidance system for operating a parking guidance system disclosed in CN 109416880A.

[0004] In addition, the conventional parking space guidance method is based on the current time for parking space recommendation and guidance, and does not consider the congestion situation of the lanes at the future departure time. Then, without considering whether the passageways are congested when entering the lot, the vehicles are very likely to encounter congestion in the passageways when leaving the lot.

[0005] That is, the conventional in-lot parking space planning method can only recommend vacant parking spaces for car owners, and cannot ensure that car owners can quickly reach the parking spaces or leave the parking lot. Summary of the Invention

[0006] The object of the present invention is to: in view of the above problems, provide a method for planning vehicle driving guidance for parking spaces and paths, so as to intelligently match reasonable parking spaces for each vehicle and effectively reduce the congestion situation in the parking lot when vehicles enter and leave.

[0007] The technical solution adopted by the present invention is as follows:

[0008] A method for planning vehicle driving guidance for parking spaces and paths, the method includes:

[0009] Based on the parking habits obtained by clustering historical parking data, initially plan parking spaces for the vehicles entering the lot and calculate the estimated departure time;

[0010] Based on the initially planned parking spaces, correction is carried out on the principle that the congestion value of the lane where the planned parking spaces are located at the expected departure time meets the predetermined requirements, and the predetermined requirements include comparing the size relationship between the congestion value and the congestion threshold; the congestion threshold is adaptively adjusted on the principle of being inversely correlated with the traffic flow at the parking lot exit.

[0011] According to the finally planned parking spaces, the driving route is planned on the principle of the shortest in-and-out time and / or the shortest distance.

[0012] Preferably, the parking habits obtained by clustering the historical parking data include the parking habits of a single vehicle and the parking habits of all vehicles, where:

[0013] The parking habit of the single vehicle is: the parking space and the expected parking duration after a single vehicle enters the lot on any Sunday and at any time period.

[0014] The parking habit of all vehicles is: the gathering area of the parking spaces and the average parking duration after all vehicles enter the lot on any Sunday and at any time period.

[0015] Preferably, based on the parking habits obtained by clustering the historical parking data, the parking spaces are initially planned for the entering vehicles, and the expected departure time is calculated, including:

[0016] According to the Sunday and the entering time of the vehicle, the parking space in the parking habit of the single vehicle or the parking space in the gathering area of the parking habits of all vehicles is planned for the vehicle; and

[0017] According to the entering time and the expected parking duration in the parking habit of the single vehicle, or the average parking duration in the parking habit of all vehicles, the expected departure time is calculated.

[0018] Preferably, the correction on the principle that the congestion value of the lane where the initially planned parking spaces are located at the expected departure time meets the predetermined requirements includes:

[0019] Taking the expected number of vehicles to leave the lot for the remaining vehicles in the lane where the planned parking spaces are located at the expected departure time as the congestion value of this lane at this departure time; each lane is preset with a congestion threshold;

[0020] The congestion value of the lane where the initially planned parking spaces are located at the expected departure time is compared with the corresponding congestion threshold. When the congestion value is lower than the congestion threshold, the initially planned parking spaces are retained. Otherwise, adjacent lanes are matched one by one until the congestion value of the matched lane is lower than the congestion threshold of this lane, and then the parking spaces of the matched lane are planned. Or, when the congestion values of all lanes reach the corresponding congestion thresholds, the parking spaces of the lane with the lowest congestion value are planned.

[0021] Preferably, the congestion threshold is adaptively adjusted according to the principle of being inversely correlated with the traffic flow at the parking lot exit, including:

[0022] If the traffic flow at the exit is higher than the first threshold, the congestion threshold is reduced to the first congestion threshold; if the traffic flow at the exit continues to increase and is higher than the second threshold, the congestion threshold is further reduced to the second congestion threshold, and so on, until the congestion threshold is reduced to the lowest congestion threshold.

[0023] Preferably, the driving path is planned according to the finally planned parking spaces based on the principle of the shortest in-and-out time and / or the shortest distance, including:

[0024] Driving path for vehicle entry: When the vehicle enters from the entrance, within the time of "current time + standard departure time required at the entrance", among all the paths between the entrance and the finally planned parking space, the path with the minimum sum of congestion values of all channels is taken as the driving path for entry. If there are multiple paths, the one with the shortest distance is selected; the standard departure time required at the entrance is the time it takes for the vehicle to travel from the entrance at the time of entry to the exit with the longest travel time when there are no other vehicles in the parking lot.

[0025] Preferably, the driving path is planned according to the finally planned parking spaces based on the principle of the shortest in-and-out time and / or the shortest distance, including:

[0026] Driving path for vehicle exit: When the vehicle exits from the parking space, within the time of "current time + standard departure time required at the entrance", among all the paths between the parking space and the exit to be left, the path with the minimum sum of congestion values of all channels is taken as the driving path for exit. If there are multiple paths, the one with the shortest distance is selected; the standard departure time required at the entrance is the time it takes for the vehicle to travel from the entrance at the time of entry to the exit with the longest travel time when there are no other vehicles in the parking lot.

[0027] Preferably, the method further includes:

[0028] Monitoring whether the vehicle entering the parking lot is parked in the planned parking space. When the vehicle is not parked in the planned parking space, according to the actual parking space where the vehicle is parked and the expected exit time of the vehicle, the congestion value of the channel at the expected exit time is corrected.

[0029] To solve the above problems, the present invention also provides a system for planning parking spaces and paths for vehicle guidance, which includes a processor configured to: execute the method for planning parking spaces and paths for vehicle guidance as described above.

[0030] In summary, due to the adoption of the above technical solutions, the beneficial effects of the present invention are:

[0031] 1. The present invention can, according to the historical parking habits of a vehicle, preferentially plan a parking space for it in its habitual parking position, which is more in line with the parking habits and needs of the vehicle owner.

[0032] 2. When the present invention recommends a parking space to the vehicle owner, it fully considers the future congestion situation of the in-park passages, so that the vehicle owner can enter and exit quickly. In addition, it also alleviates the congestion in the parking lot, making the operation of the parking lot tend to be efficient as a whole.

[0033] 3. While fully considering the congestion situation of each passage in the future time, the present invention can disperse and recommend vehicles to reasonable parking spaces according to the expected departure time, taking into account both the utilization rate of the parking spaces and the congestion situation of the parking lot.

[0034] 4. The present invention monitors the usage situation of the in-park parking spaces in real time. As long as some vehicle owners choose the planned parking spaces, the congestion in the parking lot can be alleviated. Moreover, even if some vehicle owners do not choose the planned parking spaces, it can also timely adjust the estimation of the future congestion situation of each passage to ensure the rationality of the subsequent recommended parking spaces. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] The present invention will be described by way of examples with reference to the accompanying drawings, wherein:

[0036] Figure 1 is a flowchart of a method for planning vehicle driving guidance parking spaces and paths. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0037] All features disclosed in this specification, or all steps in the disclosed methods or processes, except for mutually exclusive features and / or steps, can be combined in any way.

[0038] Any feature disclosed in this specification (including any additional claims, abstract) can be replaced by other equivalent or similar-purpose alternative features, unless specifically stated otherwise. That is, unless specifically stated otherwise, each feature is only an example of a series of equivalent or similar features.

[0039] The orientations such as "front", "rear", "left", "right", "up", "down", etc. mentioned in this specification, and the serial numbers such as "first", "second", etc., are only descriptions based on the specific embodiments of the specification. If the corresponding objects are adjusted, the corresponding orientations and serial numbers need to be adjusted accordingly.

[0040] Embodiment 1

[0041] A method for planning vehicle driving guidance parking spaces and paths, as Figure 1 shown, includes the following steps:

[0042] A. Create a data set according to historical parking data.

[0043] Obtain each parking data entry after a certain time point. Each parking data entry can include the license plate number, date (day of the week), entry time, parking space, and parking duration (or exit time). For example, a parking data entry may include license plate A, entry between 2:00 PM and 3:00 PM on a Thursday, parking space 101, and parking for 2.5 hours. This is how we obtain the dataset.

[0044] B. Cluster the data set to obtain the parking habits of a single vehicle and the parking habits of all vehicles.

[0045] In step A, we obtained a parking data set and clustered it to obtain the following:

[0046] 1) Parking habits of a single vehicle: the parking space occupied by a single vehicle (with a specific license plate number) on any given day of the week and at any given time period, as well as the estimated parking duration.

[0047] 2) Parking habits of all vehicles: the parking concentration areas and average parking duration of all vehicles entering the parking lot on any day of the week and at any time.

[0048] The above steps A and B have been completed when planning parking spaces for incoming vehicles, that is, the subsequent steps are performed after the vehicle enters the parking lot. The above steps A and B can even be directly imported into the parking lot management system after being completed in other systems. When planning and guiding vehicles, it is possible to start directly from step C under the assumption that the results of steps A and B are already available.

[0049] C. Based on the parking habits obtained by clustering, preliminarily plan parking spaces for incoming vehicles and calculate the expected exit time.

[0050] When a new vehicle enters the parking lot, a parking space is assigned to it based on its clustered parking habits, according to the day of the week and time of entry. For example, if license plate A frequently parks at the parking lot, it must be clustered with a "single vehicle parking habit," and a parking space based on that parking habit will be allocated. If there are no long-term parking spaces, such as if the new vehicle has never entered the parking lot before, a parking space based on the "all vehicles parking habit" will be allocated.

[0051] After planning a parking space, the estimated exit time is calculated based on the entry time and corresponding parking habits. For example, if license plate A's parking habits have an estimated parking duration, the estimated exit time is calculated based on the entry time and this estimated parking duration. Alternatively, the estimated exit time is calculated based on the entry time and the average parking duration under "Parking habits of all vehicles."

[0052] D. On the basis of the initially planned parking spaces, correction is carried out according to the principle that the congestion value of the passage where the planned parking space is located meets the predetermined requirements at the expected departure time. The so-called predetermined requirements include comparing the magnitude relationship between the congestion value and the congestion threshold.

[0053] After planning a parking space for an incoming vehicle, it is necessary to consider the impact of the vehicle parked in this parking space on the internal passages of the venue.

[0054] Match all the vehicles on the internal passage where the planned parking space is located. According to the expected departure time, calculate the expected number of departing vehicles of the other vehicles on this passage at this time, and use this number as the congestion value of this passage at this departure time. For example, within a certain time period (such as the current hour), for a certain passage in the venue, the total number of vehicles that will depart from all the parking spaces on both sides of this passage is used as the congestion value of this passage within this time period. Suppose there are 10 parking spaces in Passage A, and between 13:00 and 14:00, 1 vehicle departs, then between 13:00 and 14:00, the congestion value of Passage A is 1.

[0055] For the case of smooth passage of the passage, there is a preset congestion threshold. When the congestion value of the passage is lower than this congestion threshold, it is defined as smooth passage; otherwise, it is defined as congestion. For example, the congestion threshold is set as the integer obtained by dividing the total number of parking spaces in this passage by 5. That is, in the same time period, on average, when there are 4 other vehicles parked and 1 vehicle departs, and more than 1 vehicle departs, it belongs to the congestion situation.

[0056] After planning a parking space for an incoming vehicle and calculating the congestion value at the expected departure time, compare it with the congestion threshold of the passage where this parking space is located. If it is lower than this congestion threshold, it means that this parking space is feasible. If the calculated congestion value reaches the congestion threshold of this passage, match the adjacent passages one by one until the congestion value of the matched passage (at the expected departure time) is lower than the congestion threshold of this passage, and then plan the parking space of the matched passage. If there are really too many vehicles in the venue, resulting in the failure to find a suitable parking space after matching all the passages (that is, the congestion values of all the passages are higher than the congestion threshold), then plan the parking space of the passage with the smallest congestion value for the incoming vehicle to complete the correction of the parking space.

[0057] E. Make an adaptive adjustment of the congestion threshold according to the traffic flow at the vehicle exit of the parking lot.

[0058] As mentioned above, each channel in the venue is preset with an initial congestion threshold for verifying the feasibility of the initially planned parking spaces. To match the actual parking situation in the venue, the present invention also designs an adaptive adjustment process for the congestion threshold, and performs self-feedback adjustment of the congestion threshold according to the outbound traffic flow. Specifically, the greater the outbound traffic flow at the exit, the smaller the congestion threshold of each channel, that is, the congestion threshold is inversely correlated with the outbound traffic flow at the exit. In this embodiment, the congestion threshold is adaptively adjusted in a step-by-step manner. When the outbound traffic flow at the exit is large during the current period (i.e., higher than the set first threshold), the congestion threshold of each channel is reduced to the first congestion threshold. For example, the original congestion threshold is the integer obtained by dividing the total number of parking spaces in the channel by 5. Based on the current outbound traffic flow, it is adjusted to the integer obtained by dividing the total number of parking spaces in the channel by 6. If the outbound traffic flow at the exit continues to increase and is higher than the second threshold, the congestion threshold of each channel is further reduced to the second congestion threshold (for example, the integer obtained by dividing the total number of parking spaces in the channel by 7). Obviously, the second threshold is higher than the first threshold, the initial congestion threshold is higher than the first congestion threshold, and the first congestion threshold is higher than the second congestion threshold. And so on, until it is reduced to the lowest congestion threshold. If the outbound traffic flow decreases at this time (after the congestion threshold is reduced), the congestion threshold is adjusted adaptively in the reverse direction. If the congestion threshold is still the initial congestion threshold, no adjustment is made even if the outbound traffic flow decreases.

[0059] Reducing the congestion threshold can reduce the number of outbound vehicles in the same channel later, thereby alleviating the outbound congestion. Generally speaking, when the congestion threshold is reduced to a certain extent, the outbound congestion degree can be effectively alleviated.

[0060] F. According to the finally planned parking spaces, plan the driving route based on the principle of the shortest in-and-out time and / or the shortest distance.

[0061] Define the standard departure time, which refers to the time required for a vehicle to travel from the entrance of the vehicle yard to the exit when there are no other in-and-out vehicles in the yard. If there are multiple entrances and exits, for each entrance, there is an exit with the longest time-consuming, and the time from the entrance to this exit is the standard departure time of this entrance. It should be noted that for the standard departure time, after determining the entrance and exit, it is the shortest time-consuming from the entrance to the exit.

[0062] When the vehicle enters the yard from the entrance, within the time of "the current time (entry time) + the standard departure time of the entrance", the path with the smallest sum of congestion values of all channels between this entrance and the finally planned parking space is used as the driving route for entry. If there are multiple paths, the one with the shortest distance is selected. The driving route for exit is the same, that is, within the time of "the current time (exit time) + the standard departure time of the entrance", the path with the smallest sum of congestion values of all channels between the parking space and a pre-planned exit is used as the driving route for exit. If there are multiple paths, the one with the shortest distance is selected.

[0063] According to the above planning scheme, a reasonable parking space can be planned for the incoming vehicles, and when entering and leaving the parking lot, the congestion values of the channels traveled are both relatively low, and the time taken for entering and leaving is both short.

[0064] In addition, it is also monitored whether the vehicle is parked in the planned parking space. If an incoming vehicle does not park in the planned parking space but parks in other parking spaces, then according to the parking space where the vehicle actually parks and the expected departure time of the vehicle, the congestion value of the channel where the (parking space) is located at the expected departure time is corrected, so as to facilitate the judgment of the congestion value when planning parking spaces for subsequent incoming vehicles.

[0065] Through the above scheme, after planning parking spaces and driving paths for incoming vehicles, as long as some vehicle owners choose the planned parking spaces, the congestion situation in the parking lot can be effectively reduced as a whole, and the operation efficiency of the parking lot can be improved as a whole.

[0066] Embodiment 2

[0067] A system for planning vehicle driving guidance for parking spaces and paths, the system includes a processor and necessary storage devices, and the processor is used to execute the method for planning vehicle driving guidance for parking spaces and paths in the above embodiment.

[0068] In a specific embodiment, the storage device is a computer-readable storage medium, and a computer program is stored therein. Running the computer program can execute the above method for planning vehicle driving guidance for parking spaces and paths.

[0069] In some embodiments, the processor includes functional modules respectively corresponding to the steps in Embodiment 1. For example, a data set creation module for creating a data set according to historical parking data; a data set clustering module for clustering the data set to obtain the parking habits of individual vehicles and the parking habits of all vehicles respectively; a parking space planning module for initially planning parking spaces for incoming vehicles according to the parking habits obtained by clustering and calculating the expected departure time; a parking space correction module for correcting on the basis of the initially planned parking space with the principle that the congestion value of the channel where the planned parking space is located at the expected departure time meets the predetermined requirements; a congestion threshold update module for adaptively adjusting the congestion threshold according to the traffic flow at the parking lot exit; a path planning module for planning a driving path according to the finally planned parking space with the principle of the shortest entry and exit time and / or the shortest distance; a congestion value correction module for monitoring whether the vehicle is parked in the planned parking space. If an incoming vehicle does not park in the planned parking space but parks in other parking spaces, then according to the parking space where the vehicle actually parks and the expected departure time of the vehicle, the congestion value of the channel where the (parking space) is located at the expected departure time is corrected.

[0070] The present invention is not limited to the foregoing specific embodiments. The present invention extends to any new feature or any new combination disclosed in this specification, as well as to any new method or process step or any new combination disclosed.

Claims

1. A method for planning vehicle guiding parking spaces and paths, characterized in that, Including: Based on the parking habits obtained by clustering historical parking data, initially plan parking spaces for the incoming vehicles and calculate the estimated departure time; On the basis of the initially planned parking spaces, make corrections according to the principle that the congestion value of the channel where the planned parking space is located at the estimated departure time meets the predetermined requirements. The predetermined requirements include comparing the congestion value with the congestion threshold. The correction process includes: taking the estimated number of vehicles to leave the parking spaces of the other vehicles in the channel where the planned parking space is located at the estimated departure time as the congestion value of the channel at this departure time; each channel is preset with a congestion threshold; comparing the congestion value of the channel where the initially planned parking space is located at the estimated departure time with the corresponding congestion threshold. When the congestion value is lower than the congestion threshold, retain the initially planned parking space. Otherwise, match adjacent channels one by one until the congestion value of the matched channel is lower than the congestion threshold of this channel, and then plan the parking space of the matched channel. Or, when the congestion values of all channels reach the corresponding congestion thresholds, plan the parking space of the channel with the smallest congestion value; The congestion threshold is adaptively adjusted according to the principle that it is inversely correlated with the traffic flow at the vehicle yard exit. The adjustment process includes: if the traffic flow at the exit is higher than the first threshold, the congestion threshold is reduced to the first congestion threshold; if the traffic flow at the exit continues to increase to be higher than the second threshold, the congestion threshold is further reduced to the second congestion threshold, and so on, until the congestion threshold is reduced to the lowest congestion threshold; According to the finally planned parking spaces, plan the driving route according to the principle of the shortest in-and-out time and / or the shortest distance.

2. The method for planning vehicle driving guidance parking spaces and paths according to claim 1, wherein, The parking habits obtained by clustering the historical parking data include the parking habits of a single vehicle and the parking habits of all vehicles, where: The parking habit of a single vehicle is: the parking space and the estimated parking duration after a single vehicle enters the parking lot on any Sunday and at any time period; The parking habit of all vehicles is: the aggregation area of the parking spaces and the average parking duration after all vehicles enter the parking lot on any Sunday and at any time period.

3. The method for planning vehicle driving guiding parking spaces and paths according to claim 2, wherein, The step of initially planning parking spaces for the incoming vehicles and calculating the estimated departure time according to the parking habits obtained by clustering the historical parking data includes: According to the Sunday and the entry time of the vehicle, plan a parking space for the vehicle under the parking habit of a single vehicle, or a parking space in the aggregation area of the parking spaces under the parking habit of all vehicles; and According to the entry time and the estimated parking duration under the parking habit of a single vehicle, or the average parking duration under the parking habit of all vehicles, calculate the estimated departure time.

4. The method for planning vehicle driving guidance for parking spaces and paths according to claim 1, characterized in that, The step of planning the driving route according to the finally planned parking spaces according to the principle of the shortest in-and-out time and / or the shortest distance includes: The driving route for vehicle entry: when the vehicle enters from the entrance, take the path with the minimum sum of the congestion values of all channels between the entrance and the finally planned parking space within the time of "the current time + the standard departure time required at the entrance" as the driving route for entry. If there are multiple paths, take the one with the shortest distance; the standard departure time required at the entrance is the time for the vehicle to travel from the entrance at the time of entry to the exit with the longest travel time when there are no other vehicles in the yard.

5. The method for planning vehicle driving guiding parking spaces and paths according to claim 1, characterized in that, The driving path is planned according to the finally planned parking spaces based on the principle of the shortest entry and exit time and / or the shortest distance, including: The driving path for vehicle exit: When the vehicle exits the parking space, within the time of "the current time + the standard departure time required at the entrance", among all the paths between the parking space and the exit to be left, the path with the minimum sum of congestion values of all channels is used as the driving path for exit. If there are multiple paths, the one with the shortest distance is selected; the standard departure time required at the entrance is the time it takes for the vehicle to travel from the entrance at the time of entry to the exit with the longest travel time when there are no other vehicles in the field.

6. The method for planning vehicle driving guiding parking spaces and paths according to claim 1, wherein, It also includes: Monitoring whether the vehicle entering the field is parked in the planned parking space. When the vehicle is not parked in the planned parking space, correct the congestion value of the channel at the expected exit time according to the actual parking space where the vehicle is parked and the expected exit time of the vehicle.

7. A system for planning vehicle guiding parking spaces and paths, including a processor, characterized in that, The processor is configured to execute the method for planning the parking spaces and paths for guiding vehicle driving as described in any one of claims 1 to 6.

Images