CN112820134A - Method, system and medium for reserving parking in local area - Google Patents
Method, system and medium for reserving parking in local area Download PDFInfo
- Publication number
- CN112820134A CN112820134A CN202011622215.9A CN202011622215A CN112820134A CN 112820134 A CN112820134 A CN 112820134A CN 202011622215 A CN202011622215 A CN 202011622215A CN 112820134 A CN112820134 A CN 112820134A
- Authority
- CN
- China
- Prior art keywords
- parking
- reserved
- vehicle
- vehicles
- occupied
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/123—Traffic control systems for road vehicles indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/14—Traffic control systems for road vehicles indicating individual free spaces in parking areas
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a method for reserving parking in a local area, which comprises the following steps: correcting the currently occupied parking number according to the total number of parks in the parking lot in different time periods in the appointed local area and historical parking data; predicting the berth number to be released at the current time according to the reserved time of the vehicle owner; predicting the number of vehicles to be parked in the future according to the reservation information of the vehicle owner; calculating the probability of the arrival of the reserved vehicle according to the temporary cancellation information and the information that the reservation is not arrived, and calculating the modified occupied berth number; calculating the current bookable berth number; comparing the calculated bookable berth number with a set threshold, and if the bookable berth number is greater than the set threshold, determining that the vehicle owner can book the berth of the area; and pushing the optimal parking lot to the vehicle owner according to the number of the reserved parking places and the distance between the parking lot and the destination. The reserved parking positions of all the parking lots are calculated dynamically, and the optimal parking lots are dynamically distributed according to the parking travel requirements of the car owners.
Description
Technical Field
The invention relates to the technical field of intelligent parking, in particular to a method, a system and a medium for reserving parking in a local area.
Background
The reserved passing method reasonably distributes space resources and time resources of the parking lot under the condition that the parking amount of the parking lot is not greatly reduced, ensures orderly, smooth, safe and controllable traffic of the parcel, and improves the safety condition, environmental experience and traffic traveling quality of the parcel.
The reservation function has been used for several years in the field of parking lots, and the construction of the current parking lot reservation system or method is divided into three cases:
the first is to establish an appointment function system, the number of appointments is specified by the system, a vehicle owner makes a parking appointment in a single parking lot through a mobile terminal, and a management terminal makes an initial appointment for setting a parking space. When the reservation is full or the car is not available, part of the parking spaces are left, and the mobile terminal often displays that the reservation cannot be made. The method has various defects, such as difference between reserved parking spaces and vehicles actually parked, independent reservation of each parking lot by a vehicle owner, repeated reservation phenomenon and the like. Therefore, this method does not effectively make full use of parking resources in the parking lot and optimize parking operation management.
The second is through software and hardware construction, after the owner reservation, appointed berth is controlled through the hardware, other vehicles are not allowed to enter. The method ensures that the reserved vehicle has the parking space, but has the problems of reduced parking space utilization rate, overhigh construction cost and the like. Therefore, the method also does not fully utilize the parking resources of the parking lot, and increases the operation cost of the parking lot operator.
The third scheme is to distribute the parking space by calculating the dynamic change of the nearest parking space, but the scheme has higher requirement on real-time data of the parking lot, and the phenomenon that no parking space is found after the car owner arrives, the temporarily distributed parking space, and the car owner does not arrive at the reserved parking lot in time. Therefore, the owner experience of the method is poor.
Disclosure of Invention
In view of the defects in the prior art, embodiments of the present invention provide a parking method, system and medium for a local area, which can control and push and calculate reservation services of parking lots in a designated area according to dynamic changes of the number of parking lots, and dynamically allocate an optimal parking lot according to a destination of a reservation vehicle owner.
In a first aspect, an embodiment of the present invention provides a local area reserved parking method, including the following steps:
acquiring the total number of parking lots and basic information of the parking lots in the area, and analyzing the supply and demand conditions of each parking lot;
acquiring parking data of each parking lot according to a set period;
correcting the currently occupied parking number according to the total number of parks in the parking lot in different time periods of each parking lot and historical parking data;
predicting the berth number to be released at the current time according to the reserved time of the vehicle owner;
predicting the number of vehicles to be parked in the future according to the reservation information of the vehicle owner;
calculating the arrival probability of the reserved vehicle according to the temporary cancellation information and the information that the reservation is not arrived, setting a coefficient for releasing the parking space to correct the number of the parking spaces to be released at the current time, and obtaining the modified occupied number of the parking spaces;
calculating the current reserved parking number according to the total number of parking spaces in the area, the modified occupied parking number, the predicted number of vehicles to be parked and the predicted number of parking spaces to be released at the current time;
comparing the calculated bookable berth number with a set threshold, and if the bookable berth number is greater than the set threshold, determining that the vehicle owner can book the berth of the area; if the number is less than the preset number, the reservation cannot be carried out;
and pushing the optimal parking lot to the vehicle owner according to the reserved parking lot number of each parking lot and the distance between each parking lot and the destination.
In a second aspect, an embodiment of the present invention provides a system for reserving a parking space in a local area, including: a parking supply and demand analysis module, a parking data acquisition module, an appointed parking analysis module and a message push module,
the parking supply and demand analysis module is used for acquiring the total number of the parking lots and basic information of the parking lots in the area and analyzing the supply and demand conditions of each parking lot;
the parking data acquisition module is used for acquiring parking data of each parking lot in a set period;
the reserved parking analysis module corrects the currently occupied parking number according to the total number of parks in the parking lot in different time periods of each parking lot and historical parking data;
predicting the berth number to be released at the current time according to the reserved time of the vehicle owner;
predicting the number of vehicles to be parked in the future according to the reservation information of the vehicle owner;
calculating the arrival probability of the reserved vehicle according to the temporary cancellation information and the information that the reservation is not arrived, setting a coefficient for releasing the parking space to correct the number of the parking spaces to be released at the current time, and obtaining the modified occupied number of the parking spaces;
calculating the current reserved parking number according to the total number of parking spaces in the area, the modified occupied parking number, the predicted number of vehicles to be parked and the predicted number of parking spaces to be released at the current time;
comparing the calculated bookable berth number with a set threshold, and if the bookable berth number is greater than the set threshold, determining that the vehicle owner can book the berth of the area; if the number is less than the preset number, the reservation cannot be carried out;
and the message pushing module pushes the optimal parking lot to the vehicle owner according to the reserved parking space number of each parking lot and the distance between each parking lot and the destination.
In a third aspect, the present invention provides a computer-readable storage medium, in which a computer program is stored, the computer program including program instructions, which, when executed by a processor, cause the processor to execute the method described in the above embodiments.
According to the technical scheme, the method and the system for reserving parking in the local area provided by the embodiment of the invention can dynamically adjust the reserved parking positions of different parking lots in different time periods according to the historical parking data condition of each parking lot and the data content of the reserved parking positions of the car owners. And combining the existing dynamic prediction results, dynamically calculating the number of the released parking lots of each parking lot, and dynamically allocating the parking lots to the car owners according to the factors such as the saturation, the distance and the like of each parking lot.
The invention has the beneficial effects that:
the method for reserving parking in local areas is suitable for the existing equipment conditions of the parking lots in most local areas at present, the reserved parking positions of the parking lots are dynamically calculated through interconnection and intercommunication of data of the parking lots, historical data and real-time data information, and the optimal parking lots in the areas are dynamically allocated according to the parking travel requirements of car owners.
The local area parking reservation system provided by the embodiment of the invention has the same beneficial effects as the local area parking reservation method based on the same inventive concept.
The computer-storable medium and the method for reserving parking in the local area have the same beneficial effects from the same inventive concept.
Drawings
In order to more clearly illustrate the detailed description of the invention or the technical solutions in the prior art, the drawings that are needed in the detailed description of the invention or the prior art will be briefly described below. Throughout the drawings, like elements or portions are generally identified by like reference numerals. In the drawings, elements or portions are not necessarily drawn to scale.
Fig. 1 is a flowchart illustrating a method for reserving a parking space in a local area according to a first embodiment of the present invention;
fig. 2 is a block diagram illustrating a system for reserved parking in a local area according to a second embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to a determination" or "in response to a detection". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".
It is to be noted that, unless otherwise specified, technical or scientific terms used herein shall have the ordinary meaning as understood by those skilled in the art to which the invention pertains.
Fig. 1 shows a flowchart of a method for reserving a parking space in a local area according to a first embodiment of the present invention, and the basic steps include:
1. and analyzing the quantity of the parking lots in the area and the supply and demand conditions of each parking lot. Including the distance between each parking lot, the distance from the center, the traffic condition and parking information.
2. Acquiring parking data with a period of 7x24 hours, wherein the parking data comprises information such as the total number of berths of each parking lot, the number of occupied berths of each parking lot, the distribution condition of occupied time of each parking lot in different time periods and the like; the reservation time period is divided, the condition that the traffic flow in unit time of the travel peak time period is greatly opened and closed is avoided, the reservation time period is utilized to carry out peak clipping and valley filling on the traffic flow, and time resources are fully excavated.
1) The sampled time period is selected, for example, in 12h units, considering that parking reservations generally occur in the daytime, the historical data may be divided into a plurality of data sets by day.
2) The length between the sections is selected according to the parking time, and if the sections are divided according to 0.5 hour, the sections can be divided into 0.5h and 1h.
3) And the parking data of the train number entering the same day in the sampling time period is selected as sampling data, so that the deviation caused by long-term accumulation of abnormal data is avoided. The number of parked vehicles in different time periods is classified into the segmented intervals, such as 0-0.5 h interval and 0.5-1 h interval.
3. According to the parking information in the parking lot in different time periods of each parking lot and the historical data information, the number of currently occupied parking lots is corrected, and the method specifically comprises the following steps:
the first step is as follows: and calculating the probability accurate value of the current occupied parking space by adopting a sampling statistical method according to the total number of the vehicles parked in the parking lot in different time periods:
normalizing each parking amount in a sampling time period, namely calculating the proportion of the parked vehicles in the total parking number in different time periods in the same period to obtain the sampling estimation characteristics of the probability distribution of the parking saturation of the vehicles in the parking lot; the probability of the saturation distribution of each parked vehicle in the sampling period is:
wherein R istNumber of reserved vehicles that have arrived for the t-th parking space, AtFor the tth parking spaceThe number of all reserved vehicles is n, and the number of the divided parking sections is n;
the second step is that: and calculating the number of the reserved vehicles arriving in a certain time period. Namely, the reserved vehicle is equal to the reserved vehicle in the previous different time period, and still occupies the parking space in the reserved time period of the vehicle owner. Then, the number of occupied berths in the reserved time period of the vehicle owner is as follows:
wherein, XtThe number of occupied berths, P, for the t-th parking intervaltProbability of parking for the vehicle of the tth parking space, Xi-1And reserving the number of parking positions occupied by the vehicle in the i-1 th time period, wherein i is a divided parking time period.
4. The number of berths to be released is predicted according to the reservation time before the owner.
5. Predicting the number of coming vehicles according to the vehicle owner reservation information, which specifically comprises the following steps:
the first step is as follows: according to the counted record of the single parking time length of the vehicle, a sampling counting method is adopted to calculate the probability condition of the arrival of the reserved vehicle, and the method comprises the following steps:
normalizing each parking amount in a sampling time period, namely calculating the proportion of the parked vehicles in the total parking number in different time periods in the same period to obtain the sampling estimation characteristics of the probability distribution of the parking saturation of the vehicles in the parking lot; the probability P of saturation distribution of each parked vehicle within the sampling periodt' is:
wherein R ist' number of reserved vehicles to be expected to arrive for the t-th parking space, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n;
the second step is that: the number of reserved vehicle arrivals in a certain time period is calculated. Namely, the reserved vehicle is equal to the reserved vehicle in the previous different time period, and still occupies the parking space in the reserved time period of the vehicle owner. Then, the number of occupied berths in the reserved time period of the vehicle owner is as follows: y ist＝Pt'YIWherein Y istNumber of reserved vehicles for the t-th parking space, Pt' probability of arrival of vehicle for the t-th parking space, YIThe number of the reserved vehicles is the current number, and I refers to the time period for the current vehicle owner to apply for reservation.
6. According to the existing temporary cancellation and reservation miss history information of the vehicle owner, calculating the arrival probability of each reserved vehicle, and setting a coefficient for releasing the berth, thereby correcting the berth number to be released, specifically comprising the following steps:
the first step is as follows: and calculating the probability condition of the arrival of the reserved vehicle by adopting a sampling statistical method according to the counted record of the single parking time of the vehicle:
normalizing each parking amount in a sampling time period, namely calculating the proportion of the parked vehicles in the total parking number in different time periods in the same period to obtain the sampling estimation characteristics of the probability distribution of the parking saturation of the vehicles in the parking lot; the probability of the saturation distribution of each parked vehicle in the sampling period is:
wherein R ist"reserved vehicle total number for departure of t-th parking section, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n;
the second step is that: the number of reserved vehicle arrivals in a certain time period is calculated. Namely, the reserved vehicle is equal to the reserved vehicle in the previous different time period, and still occupies the parking space in the reserved time period of the vehicle owner. Then, the number of occupied berths in the reserved time period of the vehicle owner is as follows:
wherein ZtNumber of released berths, P, for the tth parking durationtProbability of parking for the tth parking duration interval, Zi-1And (5) reserving the parking space number of the vehicle in the (i-1) th time period, wherein i is a divided parking time period.
7. Calculating the current reserved berth according to the modified occupied berth number, the predicted coming vehicle, the corrected and released berth number, the total number of berths in the region and other information:
wherein V is the number of vehicles which can be reserved in a certain time period; c is the total number of parking spaces of each parking lot in the area; xtA berthage number to be occupied for the reserved interval; y istThe number of vehicles coming for the reserved section; ztThe number of parking spots to be released for the reserved interval.
8. According to the dynamically calculated bookable berth number, when the value is larger than a constant set by a system (assumed to be N), the parking in the area is determined to be not saturated, and the vehicle owner can start booking; when the value is smaller than the constant set by the system, the parking saturation of the area is determined, and the vehicle owner can not reserve.
1) If P > N, the owner can reserve the time period;
2) if P < N, the owner can not reserve the time period.
9. And according to the number of reservations of each parking lot, preferentially distributing the nearest parking lot for the vehicle owner.
The first step is as follows: the walking distance is calculated. The walking distance which can be accepted by the car owner after parking is generally not more than 200m, and the maximum walking distance is not more than 500 m. The walking distance between the reserved and allocated parking lot and the target point is more than or equal to 0 and less than or equal to 500, and the calculation formula of Di is as follows:
wherein x isi、yiPosition coordinates of the i-th parking lot, mi、niThe vehicle owner destination location coordinate closest to the ith parking lot.
The second step is that: and calculating the parking saturation of each parking lot in the reserved section.
Wherein, WiParking saturation of reserved time period for ith parking lot, wherein M is total number of parking lots in area and XiNumber of parking spaces to be occupied for the ith parking lot reservation section, YiNumber of vehicles coming for the ith parking lot reservation section, ZiReserving the number of berths to be released for the ith parking lot.
The third step: and according to the reserved parking lots in the area, allocating the parking lots closest to the owner destination.
Wherein, WStopFor parking lots ultimately assigned to vehicle owners, WiParking saturation for reserved time slot for ith parking lot, DiN is a set threshold value (when the parking lot saturation is greater than a specified value, reservation will not be permitted), and L is a set distance range between the destination and the parking lot (the value will automatically change from small to large).
According to the parking method of the local area, provided by the embodiment of the invention, the reservation service of each parking lot in the designated area can be controlled, pushed and calculated according to the dynamic change of the number of the parking lots, and the optimal parking lot can be dynamically distributed according to the destination of a reservation vehicle owner. The method mainly has the following advantages:
the system is low in construction cost and simple in deployment, and can be directly deployed in a parking lot management system or a cloud platform or independently deployed;
secondly, the berth is automatically released without manual operation;
thirdly, flexibly distributing the parking lot to the car owners according to the characteristics of various different areas, and dynamically distributing the optimal parking lot according to the reservation information of the car owners;
fourthly, solving the problem that the reservation information of different parking lots is not communicated, and flexibly and dynamically allocating the parking positions by taking the parking position data in the area as a whole;
fifthly, by allocating reserved parking lots in advance, the vehicle finding time of vehicle owners is reduced, the road passing efficiency is improved to a certain extent, and the benign development of traffic in local areas is promoted;
sixthly, the rigidity requirement of citizens in trip is guaranteed, the existing resources are efficiently utilized through the analysis of an artificial intelligence algorithm, the contradiction between supply and demand of parking trip is effectively relieved, and the maximum utilization of resources in urban parking trip is realized.
In the first embodiment, a local area parking method is provided, and correspondingly, the present application also provides a local area parking system. Please refer to fig. 2, which is a block diagram of a parking system in a local area according to a second embodiment of the present invention. Since the apparatus embodiments are substantially similar to the method embodiments, they are described in a relatively simple manner, and reference may be made to some of the descriptions of the method embodiments for relevant points. The device embodiments described below are merely illustrative.
As shown in fig. 2, there is shown a parking system of a partial area according to a second embodiment of the present invention, including: the system comprises a parking supply and demand analysis module, a parking data acquisition module, an appointed parking analysis module and a message pushing module, wherein the parking supply and demand analysis module is used for acquiring the total number of parking lots and basic information of the parking lots in an area and analyzing the supply and demand conditions of each parking lot; the parking data acquisition module is used for acquiring parking data of each parking lot in a set period; the reserved parking analysis module corrects the currently occupied parking number according to the total number of parks in the parking lot in different time periods of each parking lot and historical parking data; predicting the berth number to be released at the current time according to the reserved time of the vehicle owner; predicting the number of vehicles to be parked in the future according to the reservation information of the vehicle owner; calculating the arrival probability of the reserved vehicle according to the temporary cancellation information and the information that the reservation is not arrived, setting a coefficient for releasing the parking space to correct the number of the parking spaces to be released at the current time, and obtaining the modified occupied number of the parking spaces; calculating the current reserved parking number according to the total number of parking spaces in the area, the modified occupied parking number, the predicted number of vehicles to be parked and the predicted number of parking spaces to be released at the current time; comparing the calculated bookable berth number with a set threshold, and if the bookable berth number is greater than the set threshold, determining that the vehicle owner can book the berth of the area; if the number is less than the preset number, the reservation cannot be carried out; and the message pushing module pushes the optimal parking lot to the vehicle owner according to the reserved parking space number of each parking lot and the distance between each parking lot and the destination.
In this embodiment, the parking data acquisition module sets a period of sampling; selecting the length of a parking time division zone; and selecting the parking data of the number of vehicles entering the same day in the sampling time period as sampling data, classifying the number of the parked vehicles in different time periods into a subsection interval, and counting the parking amount of each parking time in the sampling time period.
The reserved parking analysis module comprises an occupied parking number calculation unit, the occupied parking number calculation unit is used for correcting the currently occupied parking number according to the in-field parking data and the historical parking data in different time periods of each parking lot, and the probability of the currently occupied parking number is calculated by adopting a sampling statistical method, and the method specifically comprises the following steps: calculating the proportion of the parked vehicles in the total parking number in different time periods in the same period to obtain the sampling estimation characteristics of the vehicle parking saturation probability distribution of the parking lot, wherein the probability of the saturation distribution of each parked vehicle in the sampling time period is as follows:
wherein R istNumber of reserved vehicles that have arrived for the t-th parking space, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n; calculating the number of reserved vehicles in a certain time period, wherein the number of occupied berths in the reserved time period of the vehicle owner is as follows:
wherein XtThe number of occupied berths, P, for the t-th parking intervaltProbability of parking for the vehicle of the tth parking space, Xi-1And reserving the number of parking positions occupied by the vehicle in the i-1 th time period, wherein i is a divided parking time period.
The reserved parking analysis module further comprises an upcoming vehicle number calculation unit for predicting the upcoming parking according to the reserved information of the vehicle ownerThe number of vehicles. The specific calculation method comprises the following steps: according to the counted record of the single parking time length of the vehicle, calculating the arrival probability of the reserved vehicle by adopting a sampling statistical method:
wherein R ist' number of reserved vehicles to be expected to arrive for the t-th parking space, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n; calculating the number of reserved vehicles in a certain time period, wherein the number of occupied berths in the reserved time period of the vehicle owner is as follows: y ist＝Pt'YIWherein Y istNumber of reserved vehicles for the t-th parking space, Pt' probability of arrival of vehicle for the t-th parking space, YIThe number of the reserved vehicles is the current number, and I refers to the time period for the current vehicle owner to apply for reservation.
The reserved parking analysis module further comprises an occupied parking position correction unit, the occupied parking position correction unit calculates the arrival probability of the reserved vehicle according to the counted single parking time length record of the vehicle by adopting a sampling statistical method:
wherein R ist"reserved vehicle total number for departure of t-th parking section, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n;
calculating the number of reserved vehicles in a certain time period, wherein the number of occupied berths in the reserved time period of the vehicle owner is as follows:
wherein Z istNumber of released berths, P, for the tth parking durationt"probability of parking for the t-th parking duration interval, Zi-1And (5) reserving the parking space number of the vehicle in the (i-1) th time period, wherein i is a divided parking time period.
The parking reservation analysis module also comprises a current reserved parking position calculation unit, and the formula for calculating the current reserved parking position by the current reserved parking position calculation unit is as follows:
wherein V is the number of vehicles which can be reserved in a certain time period; c is the total number of parking spaces of each parking lot in the area; xtA berthage number to be occupied for the reserved interval; y istThe number of vehicles coming for the reserved section; ztThe number of parking spots to be released for the reserved interval.
The message pushing module specifically pushes the optimal parking lot to the vehicle owner according to the reserved parking space number of each parking lot and the distance from the parking lot to the destination, and comprises the following steps: calculating the walking distance between each parking lot and the target location;
calculating the parking saturation of each parking lot in the reservation section;
and pushing the parking lot closest to the destination to the vehicle owner according to the parking lot which can be reserved in the area.
The above is a description of an embodiment of a parking system for a local area according to a second embodiment of the present invention.
The parking system and the parking method for the local area provided by the invention have the same inventive concept and the same beneficial effects, and are not repeated herein.
There is also provided in a third embodiment of the present invention a computer readable storage medium storing a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method described in the first embodiment above.
The computer readable storage medium may be an internal storage unit of the terminal described in the foregoing embodiment, for example, a hard disk or a memory of the terminal. The computer readable storage medium may also be an external storage device of the terminal, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the terminal. Further, the computer-readable storage medium may also include both an internal storage unit and an external storage device of the terminal. The computer-readable storage medium is used for storing the computer program and other programs and data required by the terminal. The computer readable storage medium may also be used to temporarily store data that has been output or is to be output.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the terminal and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed terminal and method can be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.
Claims (10)
1. A local area reserved parking method is characterized by comprising the following steps:
acquiring the total number of parking lots and basic information of the parking lots in the area, and analyzing the supply and demand conditions of each parking lot;
acquiring parking data of each parking lot according to a set period;
correcting the currently occupied parking number according to the total number of parks in the parking lot in different time periods of each parking lot and historical parking data;
predicting the berth number to be released at the current time according to the reserved time of the vehicle owner;
predicting the number of vehicles to be parked in the future according to the reservation information of the vehicle owner;
calculating the arrival probability of the reserved vehicle according to the temporary cancellation information and the information that the reservation is not arrived, setting a coefficient for releasing the parking space to correct the number of the parking spaces to be released at the current time, and obtaining the modified occupied number of the parking spaces;
calculating the current reserved parking number according to the total number of parking spaces in the area, the modified occupied parking number, the predicted number of vehicles to be parked and the predicted number of parking spaces to be released at the current time;
comparing the calculated bookable berth number with a set threshold, and if the bookable berth number is greater than the set threshold, determining that the vehicle owner can book the berth of the area; if the number is less than the preset number, the reservation cannot be carried out;
and pushing the optimal parking lot to the vehicle owner according to the reserved parking lot number of each parking lot and the distance between each parking lot and the destination.
2. The method according to claim 1, wherein the acquiring the parking data of each parking lot in the set period specifically includes:
setting a period of sampling;
selecting the length of a parking time division zone;
and selecting the parking data of the number of vehicles entering the same day in the sampling time period as sampling data, classifying the number of the parked vehicles in different time periods into a subsection interval, and counting the parking amount of each parking time in the sampling time period.
3. The method of claim 2, wherein the correcting the currently occupied number of parking spots based on the in-field parking data and the historical parking data for different time periods of the respective parking lots specifically comprises:
according to the total number of vehicles parked in the parking lot in different time periods, the probability of occupying the parking space at present is calculated by adopting a sampling statistical method, and the method specifically comprises the following steps: calculating the proportion of the parked vehicles in the total parking number in different time periods in the same period to obtain the sampling estimation characteristics of the vehicle parking saturation probability distribution of the parking lot, wherein the probability of the saturation distribution of each parked vehicle in the sampling time period is as follows:
wherein R istNumber of reserved vehicles that have arrived for the t-th parking space, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n;
calculating the number of reserved vehicles in a certain time period, wherein the number of occupied berths in the reserved time period of the vehicle owner is as follows:
wherein, XtThe number of occupied berths, P, for the t-th parking intervaltProbability of parking for the vehicle of the tth parking space, Xi-1And reserving the number of parking positions occupied by the vehicle in the i-1 th time period, wherein i is a divided parking time period.
4. The method of claim 3, wherein predicting the number of vehicles that will come to a stop in the future based on the vehicle owner's reservation information specifically comprises:
according to the counted record of the single parking time length of the vehicle, calculating the arrival probability of the reserved vehicle by adopting a sampling statistical method:
wherein R ist' number of reserved vehicles to be expected to arrive for the t-th parking space, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n;
calculating the number of reserved vehicles in a certain time period, wherein the number of occupied berths in the reserved time period of the vehicle owner is as follows: y ist＝Pt'YIWherein Y istNumber of reserved vehicles for the t-th parking space, Pt' probability of arrival of vehicle for the t-th parking space, YIThe number of the reserved vehicles is the current number, and I refers to the time period for the current vehicle owner to apply for reservation.
5. The method according to claim 4, wherein the calculating a probability of the reserved vehicle arriving according to the temporary cancellation information and the information that the reservation has not arrived, setting a coefficient for releasing the parking space to correct the number of the parking spaces to be released at the current time, and obtaining the modified occupied parking space specifically comprises:
according to the counted record of the single parking time length of the vehicle, a sampling counting method is adopted, and the probability of the arrival of the reserved vehicle is calculated as follows:
wherein R ist"reserved vehicle total number for departure of t-th parking space, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n;
calculating the number of reserved vehicles in a certain time period, wherein the number of occupied berths in the reserved time period of the vehicle owner is as follows:
wherein Z istNumber of released berths, P, for the tth parking durationt"probability of parking of a vehicle for a tth parking time interval, Zi-1And (5) reserving the parking space number of the vehicle in the (i-1) th time period, wherein i is a divided parking time period.
6. The method of claim 5, wherein the formula for calculating the current reservable berth is:
wherein V is the number of vehicles which can be reserved in a certain time period; c is the total number of parking spaces of each parking lot in the area; xtA berthage number to be occupied for the reserved interval; y istThe number of vehicles coming for the reserved section; ztThe number of parking spots to be released for the reserved interval.
7. The method of claim 6, wherein the pushing the optimal parking lot to the vehicle owner according to the number of reserved parking places of each parking lot and the distance from the parking lot to the destination specifically comprises:
calculating the walking distance between each parking lot and the target location;
calculating the parking saturation of each parking lot in the reservation section;
and pushing the parking lot closest to the destination to the vehicle owner according to the parking lot which can be reserved in the area.
8. A system for reserving parking in a local area, comprising: parking supply and demand analysis module, parking data acquisition module, reservation parking analysis module and message propelling movement module:
the parking supply and demand analysis module is used for acquiring the total number of the parking lots and basic information of the parking lots in the area and analyzing the supply and demand conditions of each parking lot;
the parking data acquisition module is used for acquiring parking data of each parking lot in a set period;
the reserved parking analysis module corrects the currently occupied parking number according to the total number of parks in the parking lot in different time periods of each parking lot and historical parking data;
predicting the berth number to be released at the current time according to the reserved time of the vehicle owner;
predicting the number of vehicles to be parked in the future according to the reservation information of the vehicle owner;
calculating the arrival probability of the reserved vehicle according to the temporary cancellation information and the information that the reservation is not arrived, setting a coefficient for releasing the parking space to correct the number of the parking spaces to be released at the current time, and obtaining the modified occupied number of the parking spaces;
calculating the current reserved parking number according to the total number of parking spaces in the area, the modified occupied parking number, the predicted number of vehicles to be parked and the predicted number of parking spaces to be released at the current time;
comparing the calculated bookable berth number with a set threshold, and if the bookable berth number is greater than the set threshold, determining that the vehicle owner can book the berth of the area; if the number is less than the preset number, the reservation cannot be carried out;
and the message pushing module pushes the optimal parking lot to the vehicle owner according to the reserved parking space number of each parking lot and the distance between each parking lot and the destination.
9. The system of claim 8, wherein the reserved parking analysis module comprises an occupied parking number calculation unit, and the occupied parking number calculation unit calculates the probability of the current occupied parking space by using a sampling statistical method according to the total number of vehicles parked in the parking lot in different time periods, and specifically comprises: calculating the proportion of the parked vehicles in the total parking number in different time periods in the same period to obtain the sampling estimation characteristics of the vehicle parking saturation probability distribution of the parking lot, wherein the probability of the saturation distribution of each parked vehicle in the sampling time period is as follows:
wherein R istNumber of reserved vehicles that have arrived for the t-th parking space, AtThe number of all reserved vehicles in the t-th parking interval is n, and the number of the divided parking intervals is n;
calculating the number of reserved vehicles in a certain time period, wherein the number of occupied berths in the reserved time period of the vehicle owner is as follows:
wherein, XtThe number of occupied berths, P, for the t-th parking intervaltProbability of parking for the vehicle of the tth parking space, Xi-1And reserving the number of parking positions occupied by the vehicle in the i-1 th time period, wherein i is a divided parking time period.
10. A computer-readable storage medium, characterized in that the computer storage medium stores a computer program comprising program instructions that, when executed by a processor, cause the processor to perform the method according to any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011622215.9A CN112820134B (en) | 2020-12-30 | 2020-12-30 | Method, system and medium for reserving parking in local area |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011622215.9A CN112820134B (en) | 2020-12-30 | 2020-12-30 | Method, system and medium for reserving parking in local area |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112820134A true CN112820134A (en) | 2021-05-18 |
| CN112820134B CN112820134B (en) | 2022-08-23 |
Family
ID=75854579
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011622215.9A Active CN112820134B (en) | 2020-12-30 | 2020-12-30 | Method, system and medium for reserving parking in local area |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112820134B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113570866A (en) * | 2021-09-24 | 2021-10-29 | 成都宜泊信息科技有限公司 | Parking lot management method and system, storage medium and electronic equipment |
| CN113658446A (en) * | 2021-08-20 | 2021-11-16 | 展讯通信（上海）有限公司 | Path planning method and device, computer readable storage medium and terminal |
| CN113837410A (en) * | 2021-08-12 | 2021-12-24 | 浙江车速达软件科技有限公司 | Efficient vehicle detection on-line reservation system |
| CN114882729A (en) * | 2022-04-22 | 2022-08-09 | 超级视线科技有限公司 | Parking management method and system |
| CN115601992A (en) * | 2022-11-08 | 2023-01-13 | 智能网联汽车（山东）协同创新研究院有限公司（Cn） | Accurate intelligent parking guidance system |
| CN115879581A (en) * | 2023-01-17 | 2023-03-31 | 北京交通发展研究院 | Resource management method, device, system, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102012201472A1 (en) * | 2012-02-01 | 2013-08-01 | Bayerische Motoren Werke Aktiengesellschaft | Method for providing parking information on free parking spaces |
| DE102013211632A1 (en) * | 2013-06-20 | 2014-12-24 | Bayerische Motoren Werke Aktiengesellschaft | Method for providing parking information about free parking spaces |
| CN106779256A (en) * | 2017-03-24 | 2017-05-31 | 山东大学 | One kind is based on event driven parking unoccupied parking spaces real-time predicting method and system |
| CN107170283A (en) * | 2017-06-23 | 2017-09-15 | 深圳市盛路物联通讯技术有限公司 | A kind of parking stall decision-making technique and system |
| CN109087522A (en) * | 2017-06-13 | 2018-12-25 | 纵目科技（上海）股份有限公司 | A kind of method and system of parking lot free parking space detection |
| CN109615909A (en) * | 2018-12-12 | 2019-04-12 | 濮俊霖 | A kind of queuing type parking reserving method |
| CN110337680A (en) * | 2016-12-30 | 2019-10-15 | 同济大学 | A kind of preferential short reservation of high-quality berth and Dynamic Pricing method stopped |
| CN111815999A (en) * | 2020-07-31 | 2020-10-23 | 深圳市元征科技股份有限公司 | Parking space management method and related device |
-
2020
- 2020-12-30 CN CN202011622215.9A patent/CN112820134B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102012201472A1 (en) * | 2012-02-01 | 2013-08-01 | Bayerische Motoren Werke Aktiengesellschaft | Method for providing parking information on free parking spaces |
| CN104169990A (en) * | 2012-02-01 | 2014-11-26 | 宝马股份公司 | Method for providing parking information on free parking spaces |
| DE102013211632A1 (en) * | 2013-06-20 | 2014-12-24 | Bayerische Motoren Werke Aktiengesellschaft | Method for providing parking information about free parking spaces |
| CN110337680A (en) * | 2016-12-30 | 2019-10-15 | 同济大学 | A kind of preferential short reservation of high-quality berth and Dynamic Pricing method stopped |
| CN106779256A (en) * | 2017-03-24 | 2017-05-31 | 山东大学 | One kind is based on event driven parking unoccupied parking spaces real-time predicting method and system |
| CN109087522A (en) * | 2017-06-13 | 2018-12-25 | 纵目科技（上海）股份有限公司 | A kind of method and system of parking lot free parking space detection |
| CN107170283A (en) * | 2017-06-23 | 2017-09-15 | 深圳市盛路物联通讯技术有限公司 | A kind of parking stall decision-making technique and system |
| CN109615909A (en) * | 2018-12-12 | 2019-04-12 | 濮俊霖 | A kind of queuing type parking reserving method |
| CN111815999A (en) * | 2020-07-31 | 2020-10-23 | 深圳市元征科技股份有限公司 | Parking space management method and related device |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113837410A (en) * | 2021-08-12 | 2021-12-24 | 浙江车速达软件科技有限公司 | Efficient vehicle detection on-line reservation system |
| CN113658446A (en) * | 2021-08-20 | 2021-11-16 | 展讯通信（上海）有限公司 | Path planning method and device, computer readable storage medium and terminal |
| CN113570866A (en) * | 2021-09-24 | 2021-10-29 | 成都宜泊信息科技有限公司 | Parking lot management method and system, storage medium and electronic equipment |
| CN114882729A (en) * | 2022-04-22 | 2022-08-09 | 超级视线科技有限公司 | Parking management method and system |
| CN114882729B (en) * | 2022-04-22 | 2023-12-08 | 超级视线科技有限公司 | Parking management method and system |
| CN115601992A (en) * | 2022-11-08 | 2023-01-13 | 智能网联汽车（山东）协同创新研究院有限公司（Cn） | Accurate intelligent parking guidance system |
| CN115879581A (en) * | 2023-01-17 | 2023-03-31 | 北京交通发展研究院 | Resource management method, device, system, electronic equipment and storage medium |
| CN115879581B (en) * | 2023-01-17 | 2023-12-08 | 北京交通发展研究院 | Resource management method, device, system, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112820134B (en) | 2022-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112820134B (en) | Method, system and medium for reserving parking in local area | |
| Weikl et al. | Relocation strategies and algorithms for free-floating car sharing systems | |
| Amirgholy et al. | Optimal design of sustainable transit systems in congested urban networks: A macroscopic approach | |
| CN110807921A (en) | Vehicle scheduling method, device, equipment and storage medium | |
| CN105632230A (en) | Method and apparatus for dynamically assigning parking lot | |
| CN107563683A (en) | Passenger and goods collaboration transportation resources and system in a kind of city | |
| CN106297273B (en) | The processing method and processing device of regular bus route | |
| CN109166337B (en) | Bus arrival time generation method and device and bus passenger travel OD acquisition method | |
| CN108734353A (en) | A kind of public bus network route plan generation method and device | |
| CN113435968B (en) | Network appointment vehicle dispatching method and device, electronic equipment and storage medium | |
| CN108281033B (en) | Parking guidance system and method | |
| CN115577818B (en) | Passenger demand response type carpooling scheduling method and system for intelligent bus | |
| CN111553501A (en) | Order allocation method and device | |
| CN105095985A (en) | Shared vehicle systems and methods | |
| Manasra et al. | Optimization-based operations control for public transportation service with transfers | |
| CN112201034B (en) | Parking berth scheduling method, system, device and storage medium | |
| CN109657820A (en) | A kind of taxi matching process reserved | |
| CN113722874A (en) | Vehicle shift scheduling optimization method and device and electronic equipment | |
| US20190205796A1 (en) | System and method for optimizing allocation of different categories of vehicles | |
| CN107437129B (en) | Reservation sheet processing method and server | |
| CN112289035B (en) | Parking space allocation method and system, electronic equipment and storage medium | |
| CN106382036A (en) | Parking space management method and system and terminal | |
| CN105139637B (en) | Method, system and the client that a kind of taxi on-board and off-board place is chosen | |
| CN111815012A (en) | Rental car platform center warehouse parking space allocation method, electronic equipment and storage medium | |
| CN116109081A (en) | Dynamic bus scheduling optimization method and device based on Internet of things |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |