CN114973692B - Method and system for realizing tidal space sharing in community/business district - Google Patents
Method and system for realizing tidal space sharing in community/business district Download PDFInfo
- Publication number
- CN114973692B CN114973692B CN202111646686.8A CN202111646686A CN114973692B CN 114973692 B CN114973692 B CN 114973692B CN 202111646686 A CN202111646686 A CN 202111646686A CN 114973692 B CN114973692 B CN 114973692B
- Authority
- CN
- China
- Prior art keywords
- shared
- parking space
- vehicle
- time
- shared vehicle
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/065—Traffic control systems for road vehicles by counting the vehicles in a section of the road or in a parking area, i.e. comparing incoming count with outgoing count
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
- G08G1/0129—Traffic data processing for creating historical data or processing based on historical data
-
- 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)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Traffic Control Systems (AREA)
Abstract
A method and system for achieving space sharing, the method comprising: collecting historical business-in and business-out data of a vehicle of an owner, occupied tolerance of the owner and historical business-in and business-out data of a shared vehicle; in response to detecting that the shared parking space is in an idle state, determining an estimated idle time of the shared parking space based on the data; responsive to receiving a request that the shared vehicle is to use the shared space in an idle state, determining a latest departure time for each shared vehicle based at least in part on the data; determining a set of shared parking spaces satisfying that the latest departure time of the shared vehicle is earlier than the estimated free time of the shared parking spaces; and selecting a parking space of the shared vehicle from the set of shared spaces. The system includes an acquisition module configured to perform acquiring the data and a parking space management module configured to select a parking space for the shared vehicle using the method. Numerous other aspects are also included.
Description
Technical Field
The present application relates to the field of smart communities and more particularly to a method and system for tidal space sharing in communities and/or business areas.
Background
With the increase of the holding quantity of large and medium-sized city automobiles in China, the problem of difficult urban parking becomes a common problem, but at the same time, the parking problem shows strong tidal performance, namely a large number of vehicles leave a residential area in daytime and enter an office building, so that the office building is difficult to park, and a large number of idle parking spaces exist in the residential area, otherwise, a large number of vehicles leave the office building at night and enter the residential area. Aiming at the tidal nature of urban vehicle movement, the application provides a method and a system for realizing tidal parking space sharing in a community/business area, and the historical behavior analysis of vehicles effectively reduces the situation that the vehicles occupy the parking spaces in a non-idle period, improves the utilization rate of the idle parking spaces, and saves the time and power consumption for the vehicles to find the parking spaces.
The application comprises the following steps:
the following presents a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated aspects, and is intended to neither identify key or critical elements of all aspects nor delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a prelude to the more detailed description that is presented later.
In order to solve the problems, the scheme provides a method and a system for realizing tidal space sharing in a community/business area.
The application provides a method for realizing parking space sharing, which comprises the following steps:
collecting historical ingress and egress data of an owner vehicle associated with each of a plurality of shared parking spaces and an occupied tolerance of the owner to the parking space, and historical ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space;
responsive to detecting that the shared parking space is in an idle state, determining an estimated idle time for the shared parking space based at least in part on historical ingress and egress data and occupied tolerance associated with the shared parking space;
responsive to receiving a request for a shared vehicle to use a shared parking space in an idle state, determining a latest departure time of the shared vehicle for each shared parking space in an idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupied tolerance associated with each shared parking space in an idle state;
determining a set of shared spaces that satisfies the fact that the latest departure time of the shared vehicle is earlier than an estimated free time of the shared spaces; and
and selecting the shared parking space with the smallest difference value between the latest departure time and the estimated idle time from the shared parking space set as the parking space of the shared vehicle.
According to a further embodiment of the application, the occupancy tolerance is expressed in the form of an occupancy tolerance probability, wherein the occupancy tolerance probability indicates the probability that an owner can tolerate that a parking spot is occupied when returning to the parking spot.
According to a further embodiment of the present application, determining the estimated free time of the shared parking space further comprises:
an estimated idle time is determined based on historical ingress and egress data of the owner vehicle for the shared parking space such that a probability of the estimated idle time for the shared parking space being later than a historical ingress time for the owner vehicle is less than an occupied tolerance probability.
According to a further embodiment of the application, the method further comprises:
dividing the shared vehicle into a temporary shared vehicle and a long-term shared vehicle based on whether the shared vehicle uses the shared parking space for the first time; and
and determining the promised departure time of the temporary shared vehicle as the latest departure time of the temporary shared vehicle.
According to a further embodiment of the application, the method further comprises:
a latest departure time of the long-term shared vehicle is determined based on the historical ingress and egress data of the long-term shared vehicle such that a probability that the latest departure time of the long-term shared vehicle is earlier than the historical departure time of the long-term shared vehicle is less than an occupied tolerance probability.
The application also provides a system for realizing parking space sharing, which comprises:
an acquisition module configured to store owner vehicle history ingress and egress data associated with each of a plurality of shared parking spaces and an owner's occupied tolerance to the parking space, and history ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space;
a parking space management module configured to:
detecting whether each shared parking space is in an idle state;
responsive to detecting that the shared parking space is in an idle state, determining an estimated idle time for the shared parking space based at least in part on historical ingress and egress data and occupied tolerance associated with the shared parking space;
receiving a request from a shared vehicle that the shared vehicle is to use a shared parking space in an idle state; responsive to the request, determining a latest departure time of the shared vehicle for each of the shared spaces in the idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupied tolerance associated with each of the shared spaces in the idle state;
determining a set of shared spaces that satisfies the fact that the latest departure time of the shared vehicle is earlier than an estimated free time of the shared spaces; and
and selecting the shared parking space with the smallest difference value between the latest departure time and the estimated idle time from the shared parking space set as the parking space of the shared vehicle.
According to a further embodiment of the application, the occupancy tolerance is expressed in the form of an occupancy tolerance probability, wherein the occupancy tolerance probability indicates the probability that an owner can tolerate that a parking spot is occupied when returning to the parking spot.
According to a further embodiment of the application, the parking space management module is further configured to:
an estimated idle time is determined based on historical ingress and egress data of the owner vehicle for the shared parking space such that a probability of the estimated idle time for the shared parking space being later than a historical ingress time for the owner vehicle is less than an occupied tolerance probability.
According to a further embodiment of the application, the parking space management module is further configured to:
dividing the shared vehicle into a temporary shared vehicle and a long-term shared vehicle based on whether the shared vehicle uses the shared parking space for the first time; and
and determining the promised departure time of the temporary shared vehicle as the latest departure time of the temporary shared vehicle.
According to a further embodiment of the application, the parking space management module is further configured to:
a latest departure time of the long-term shared vehicle is determined based on the historical ingress and egress data of the long-term shared vehicle such that a probability that the latest departure time of the long-term shared vehicle is earlier than the historical departure time of the long-term shared vehicle is less than an occupied tolerance probability.
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. Additional aspects, features, and/or advantages of the embodiments will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the disclosure.
Drawings
So that the manner in which the above recited features of the present application can be understood in detail, a more particular description of the application, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only certain typical aspects of this application and are therefore not to be considered limiting of its scope, for the description may admit to other equally effective aspects. In the drawings, like reference numerals are given like designations throughout. It is noted that the drawings described are only schematic and are non-limiting. In the drawings, the size of some of the elements may be exaggerated and not drawn on scale for illustrative purposes.
Fig. 1 illustrates an example of system modules for enabling sharing of tidal spaces in accordance with an embodiment of the present application.
Fig. 2 illustrates an example of a process flow for enabling sharing of tidal spaces in accordance with an embodiment of the present application.
Detailed Description
The present application will be further described in detail below with reference to specific embodiments and with reference to the accompanying drawings, in order to make the objects, technical solutions and advantages of the present application more apparent. In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the described exemplary embodiments. It will be apparent, however, to one skilled in the art, that the described embodiments may be practiced without some or all of these specific details. In other exemplary embodiments, well-known structures or processing steps have not been described in detail in order to avoid unnecessarily obscuring the concepts of the present disclosure.
In the present specification, unless otherwise indicated, the term "a or B" as used throughout the present specification refers to "a and B" and "a or B" and does not mean that a and B are exclusive.
Aiming at the tidal problem of urban vehicle movement, part of communities and business areas have introduced a management method for providing services outside in idle parking spaces. However, due to lack of analysis on the number of idle vehicles and the idle duration of the parking space, the situation that the shared vehicle (the external vehicle occupying the parking space in a sharing manner) does not leave yet often occurs when the owner vehicle (the vehicle to which the parking space actually belongs) returns, so that the enthusiasm of the owner for the management method for providing services to the outside in the idle period of the parking space is low. The application provides a method and a system for realizing tidal space sharing in a community/business area, which effectively reduce the situation of occupying a space in a non-idle period through historical behavior analysis of vehicles, and promote the support strength of owners to tidal space management, thereby promoting the utilization rate of the idle space, and saving the time and power consumption of the vehicles for searching the space.
Fig. 1 illustrates an example of system modules for enabling sharing of tidal spaces in accordance with an embodiment of the present application.
In an embodiment of the application, the system 100 for enabling sharing of tidal spaces may include an acquisition module 105 for acquiring historical behavior of an owner vehicle. For example, historical data may be recorded and stored based on historical behavior of owner vehicles entering and exiting: { date D, date attribute A, departure time T out (HH: MM: SS), entrance time T in (HH: MM: SS) }. Wherein, the date attribute A can take the value: a is E { weekday, weekend, holiday }, leaving time T out Earlier than the time T of entering the door in . In an embodiment of the application, the historical data set may be denoted as N. It should be noted that the history data in the case of multiple entrances and exits of the industrial host vehicle on the same day may be ignored, or only one of them (for example, the first entrance time of the day, the average value of the entrance times, the expected value of the entrance times, etc.) may be recorded/stored in the case of multiple entrances and exits of the industrial host vehicle on the same day, and may be screened using existing statistical methods known to those skilled in the art, and will not be described here.
In an embodiment of the application, the system 100 for enabling sharing of tidal spaces may include a space management module 110. The space management module 110 may calculate a probability that the vehicle owner may tolerate a space being occupied.
In embodiments of the present application, the tolerance of the owner to the occupancy of the parking space when going out and back can be investigated in a questionnaire format and this attribute set for the owner's vehicle. Wherein, tolerance value range: r.epsilon.from scratch, 1 time per half year, 1 time per month, 1 time per week. Accordingly, the occupancy tolerance may be expressed in terms of an occupancy tolerance probability, where the occupancy tolerance probability indicates a probability that an owner can tolerate that a parking space is occupied when returning to the parking space, and the occupancy tolerance probability is: p.epsilon. {0,1/180,1/30,1/7}, i.e., 1 time per half year (180 days), 1 time per month (30 days), 1 time per week (7 days). In an embodiment of the present application, the tolerance value condition is (i.e., only qualified owner vehicles may select the corresponding tolerance value): (1) never: historical data sample number >365; (2) once every half year: the number of historical data samples >180; (3) 1 time per month: historical data sample number >30; and (4) 1 time per week: historical data sample number >7. In the embodiment of the application, in order to improve the sharing rate of the parking spaces of the owners, the property can be provided with an excitation mechanism, so that the tolerance of the owners to the occupied parking spaces is improved. It should be understood that while only 4 ranges of values are described herein, the tolerance may be other values that may be set.
In an embodiment of the present application, the parking space management module 110 may estimate a parking space free time. For example, the parking space free time T (HH: MM: SS) can be estimated from historical departure data of the owner's vehicle according to the owner's tolerance probability of being occupied with the parking space, in combination with the date attribute: t is the satisfaction of Length ({ B|T in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C e N) maximum value of P (latest value), where a 0 For the current date attribute, the value may be: a ε { weekday, weekend, holiday }, the Length (X) function indicates the Length of the set X, i.e., the number of elements of X. The above formula can be interpreted as: in having date attribute A 0 In the case of (1), the parking space idle time T in The number of time instants T later than the history is smaller than the total number of time instants T times the occupied tolerance probability.
In an embodiment of the present application, assume a 0 For weekends, the tolerance probability value P is 1/180, the probability that the owner vehicle is still occupied when going out and returning on the weekends should be less than 1/180, and the probability that the estimated idle time of the shared parking space is later than the historical entering time of the owner vehicle is less than 1/180. Specifically, the satisfaction of Length ({ B|T) can be obtained by in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C e N) P parking space idle time T in T of (2) in Aggregate, and further from the T in And selecting the latest value from the set as the estimated idle time of the parking space. In another embodiment of the present application, assume A 0 For a workday, the tolerance probability value P is 1/7, and the probability that the estimated idle time of the shared parking space is later than the historical entry time of the owner vehicle is less than 1/7. For example, it has a value at the historical entry time T{17:11:00, 17:12:00, 17:13:00, 17:14:00, 17:15:00, 17:16:00, 17:17:00, 17:18:00} (8 total) if idle time T is estimated in 17:15:01, {17:11:00, 17:12:00, 17:13:00, 17:14:00, 17:15:00} in the set of the above history data satisfies { B|T } in <T AND A＝A 0 B ε N, thus Length ({ B|T }) in <T AND A＝A 0 B e N } = 5, thereby Length ({ b|t in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C e N) P is not true. Conversely, when T in No later than 17:11:59, only {17:11:00} satisfies { B|T } in <T AND A＝A 0 B ε N, thus Length ({ B|T }) in <T AND A＝A 0 B e N } = 1 such that Length ({ b|t) in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C e N }) P holds that the parking space estimation idle time T should be determined to be 17:11:59. Note that the estimated free time t=17:11:59 of the parking space represents a large probability that the owner vehicle is estimated to have not returned to the parking space at that time. It should also be noted that the above examples are only examples and are not meant to limit the present application.
In an embodiment of the application, the behavior of the shared vehicle may be collected. For example, the shared vehicles may be classified into long-term shared vehicles (i.e., shared vehicles that frequently enter the community/business district) and temporary shared vehicles. The long-term shared vehicles may be identified as vehicles of a first type and the temporary shared vehicles may be identified as vehicles of a second type.
In embodiments of the present application, the acquisition module 105 may also acquire historical behavior of long-term shared vehicles. For example, history data of entry and exit of a long-term shared vehicle is recorded according to the history data: { date D ', date attribute A ', entry time T ' in (HH: MM: SS), departure time T' out (HH: MM: SS) }. Wherein, the date attribute can take the value: a' ∈ { weekday, weekend, holiday }, entry time T in ' earlier than departure time T out '. In an embodiment of the application, this historical data set may be denoted as M. It should be noted that the number of histories in the case of sharing a vehicle in and out multiple times on the same day can be ignoredAccording to the above, or in the case that the vehicle is shared to get in and out multiple times on the same day, only one of the historical data (for example, the last departure time of the day, the average value of the departure time, the expected value of the departure time, etc.) is taken for storage/recording, and the historical data can be screened by using the existing statistical method known to those skilled in the art, which is not described herein.
In an embodiment of the present application, the acquisition module 105 may also acquire the promised departure time of the temporary shared vehicle. For example, a temporary shared vehicle needs to promise a departure time when entering a stop. For example, a temporary shared vehicle entering a community/business area may promise a latest departure time T 2 (HH: MM: SS). If the time-out occurs, the community/business district performs time-out punishment according to the requirement.
In embodiments of the present application, the parking space management module 110 may also estimate the expected departure time of the long-term shared vehicle by analyzing the historical behavior of the long-term shared vehicle. For example, the free parking spaces in the community/business area can be compared one by one, and the expected departure time T of the long-term shared vehicle can be estimated through historical data according to the tolerance probability of the owner to the occupied free parking spaces and the date attribute 1 (HH:MM:SS)：T 1 To meet Length ({ B|T) 1 <T’ out AND A’＝A’ 0 ，B∈M})<Length({C|A’＝A’ 0 C e M) P, where a 'is the minimum value (earliest value)' 0 For the current date attribute, the value may be: a ε { weekday, weekend, holiday }, the Length (X) function indicates the Length of the set X, i.e., the number of elements of X. The above formula can be interpreted as: in having date attribute A' 0 In the case of (2), the departure time T is desired 1 Earlier than the historical departure time T' out The number of (2) is smaller than the historical departure time T' out Is multiplied by the occupied-tolerance probability. Specifically, the satisfaction of Length ({ B|T) can be obtained by 1 <T’ out AND A’＝A’ 0 ，B∈M})<Length({C|A’＝A’ 0 C e M) P desired departure time T 1 T of (2) 1 Aggregate, and further from the T 1 And selecting the earliest value in the set as the estimated idle time of the parking space.
In an embodiment of the present application, assume a 0 For a weekday, the tolerance probability value P is 1/7, the probability that the owner vehicle is still occupied when the weekday goes out and returns is less than 1/7, and the probability that the latest departure time of the long-term shared vehicle is earlier than the historical departure time of the long-term shared vehicle is less than 1/7. Specifically, for example, at the historical departure time T' out Having values {17:01:00, 17:02:00, 17:03:00, 17:04:00, 17:05:00, 17:06:00, 17:07:00, 17:08:00} (a total of 8), if 17:01:59, 7 values in {17:02:00, 17:03:00, 17:04:00, 17:05:00, 17:06:00, 17:07:00, 17:08:00} in the set of historical data all satisfy { B|T } 1 <T’ out AND A’＝A’ 0 B ε M, thus Length ({ B|T }) 1 <T’ out AND A’＝A’ 0 B e M }) =7. Conversely, when T 1 Not earlier than 17:07:01, only {17:08:00} satisfies { B|T } 1 <T’ out AND A’＝A’ 0 B ε M, thus Length ({ B|T }) 1 <T’ out AND A’＝A’ 0 B e M } = 1, so that Length ({ b|t 1 <T’ out AND A’＝A’ 0 ，B∈M})<Length({C|A’＝A’ 0 C e M }) P (i.e., 1<8/7) is true, the long-term shared vehicle should be expected to leave the time T 1 Determined as 17:07:01. t in the above example 1 =17: 07:01 indicates that the vehicle is estimated to be at the latest 17:07: the time when the vehicle leaves is predicted to be no later than 17 under the condition that the large probability of 01 leaves, namely, the tolerance probability is met: 07:01. it should be noted that the above examples are only examples and are not meant to limit the application.
In an embodiment of the present application, the parking space management module 110 may perform parking space selection. For example, based on the type of the shared vehicle, it is determined that the latest departure time T' (HH: MM: SS) is the short-term shared vehicle promised departure time T 2 Or long-term sharing of the desired departure time T of the vehicle 1 And selecting a parking space meeting T '. Ltoreq.T and having the minimum value of T-T ' according to the latest departure time T ' and the idle time T of the parking space of the shared vehicle, determining the parking space as the current shared parking space, wherein the parking space is a parking space of the shared vehicleThe parking space is matched to the most preferable shared parking space by the method. In the embodiment of the application, a set of the parking spaces satisfying T '+.t may be determined, and the parking space in the set where the difference between the latest departure time T' of the shared vehicle and the free time T of the parking space is smallest is determined as the parking space matching the shared vehicle, and parking is performed thereon.
Fig. 2 illustrates an example of a process flow for enabling sharing of tidal spaces in accordance with an embodiment of the present application.
At 1102, the owner's tolerance for the occupancy of the occupancy can be recorded and the owner's probability of tolerance for the occupancy can be calculated.
At 1104, a determination may be made as to whether the owner vehicle is away, if not, a poll determination is made, if so, proceed to 1106.
At 1106, departure behavior of the owner vehicle may be collected
At 1108, a historical behavioral record of the owner vehicle may be maintained.
At 1110, a spot free time T may be estimated based on the time of day departure of the owner vehicle and the historical behavior record.
At 1112, a determination may be made as to whether a shared vehicle is in, if not, a poll determination is made, if so, proceed to 1114.
At 1114, it may be determined whether the shared vehicle belongs to a long-term shared vehicle.
If the shared vehicle does not belong to a long-term shared vehicle, then at 1116, a committed departure time T of the temporary shared vehicle may be collected 1 。
If the shared vehicle belongs to a long-term shared vehicle, the behavior of the long-term shared vehicle may be collected 1118 and a historical behavior record of the long-term shared vehicle may be saved 1120, and the expected departure time T of the long-term shared vehicle may be calculated based on the previously saved historical behavior record of the long-term shared vehicle 2 。
At 1122, the shared vehicle latest departure time T' is determined as the promised departure time T according to the shared vehicle attribute 1 Or desired departure time T 2 。
At 1124, it may be determined whether T is a parking space that satisfies T '. Ltoreq.T with a minimum T-T' value, if not, the determination is polled, if so, the parking space is confirmed at 1126, and the parking is directed according to the parking space at 1128.
The system and method for achieving contribution of tidal volume according to the application have been described above, the method of the application having at least the following advantages over the prior art:
(1) Vehicles with sharing requirements can participate in sharing, so that the application range of tidal parking space sharing is effectively widened;
(2) The vehicle can find the optimal idle parking space in the parking lot of the target community/business district, effectively improves the utilization rate of the idle parking space and the system efficiency, provides a method for estimating the idle time of the parking space when the owner vehicle goes out and a method for estimating the latest departure time of the shared vehicle, and obtains a system optimal scheme for completing the matching of the idle parking space and the shared vehicle on the basis, thereby saving the time and the power consumption for the vehicle to find the parking space;
(3) Creatively introducing a tolerance investigation of owners to occupied parking spaces when going out and returning, and analyzing and calculating according to the tolerance investigation to obtain an optimal satisfaction scheme of owners for completing matching of idle parking spaces and shared vehicles;
(4) Through the automatic calculation of the historical data, a process of manually selecting and matching is omitted, and a scheme with higher automation degree for completing the matching of the idle parking spaces and the shared vehicles is obtained; and
(5) The method for taking the temporary shared vehicle without the historical data sample into consideration to occupy the idle parking space is compatible, and a scheme with wider coverage range is obtained.
Reference throughout this specification to "an embodiment" means that a particular described feature, structure, or characteristic is included in at least one embodiment. Thus, the use of such phrases may not merely refer to one embodiment. Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
The various steps and modules of the methods and apparatus described above may be implemented in hardware, software, or a combination thereof. If implemented in hardware, the various illustrative steps, modules, and circuits described in connection with this disclosure may be implemented or performed with a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), or other programmable logic component, a hardware component, or any combination thereof. A general purpose processor may be a processor, microprocessor, controller, microcontroller, state machine, or the like. If implemented in software, the various illustrative steps, modules, described in connection with this disclosure may be stored on a computer readable medium or transmitted as one or more instructions or code. Software modules implementing various operations of the present disclosure may reside in storage media such as RAM, flash memory, ROM, EPROM, EEPROM, registers, hard disk, removable disk, CD-ROM, cloud storage, etc. A storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium, as well as execute corresponding program modules to implement the various steps of the present disclosure. Moreover, software-based embodiments may be uploaded, downloaded, or accessed remotely via suitable communication means. Such suitable communication means include, for example, the internet, world wide web, intranet, software applications, cable (including fiber optic cable), magnetic communications, electromagnetic communications (including RF microwave and infrared communications), electronic communications, or other such communication means.
The numerical values given in the embodiments are only examples and are not intended to limit the scope of the present application. Furthermore, as an overall solution, there are other components or steps not listed by the claims or the specification of the present application. Moreover, the singular designation of a component does not exclude the plural designation of such a component.
It is also noted that the embodiments may be described as a process which is depicted as a flowchart, a flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. Additionally, the order of the operations may be rearranged.
The disclosed methods, apparatus, and systems should not be limited in any way. Rather, the present disclosure encompasses all novel and non-obvious features and aspects of the various disclosed embodiments (both alone and in various combinations and subcombinations with one another). The disclosed methods, apparatus and systems are not limited to any specific aspect or feature or combination thereof, nor do any of the disclosed embodiments require that any one or more specific advantages be present or that certain or all technical problems be solved.
The present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those of ordinary skill in the art without departing from the spirit of the application and the scope of the appended claims, which are all within the scope of the application.
One skilled in the relevant art will recognize that the embodiments may be practiced without one or more of the specific details, or with other methods, resources, materials, etc. In other instances, well-known structures, resources, or merely to facilitate a obscuring aspect of the embodiments have not been shown or described in detail.
While embodiments and applications have been illustrated and described, it is to be understood that the embodiments are not limited to the precise configuration and resources described above. Various modifications, substitutions, and improvements apparent to those skilled in the art may be made in the arrangement, operation, and details of the methods and systems disclosed herein without departing from the scope of the claimed embodiments.
The terms "and," "or," and/or "as used herein may include various meanings that are also expected to depend at least in part on the context in which such terms are used. Generally, or, if used in connection with a list, such as A, B or C, is intended to mean A, B and C (inclusive meaning as used herein) and A, B or C (exclusive meaning as used herein). Furthermore, the terms "one or more" as used herein may be used to describe any feature, structure, or characteristic in the singular or may be used to describe a plurality of features, structures, or characteristics or some other combination thereof. However, it should be noted that this is merely an illustrative example and claimed subject matter is not limited to this example.
While there has been illustrated and described what are presently considered to be example features, it will be understood by those skilled in the art that various other modifications may be made, and equivalents may be substituted, without departing from claimed subject matter. Additionally, many modifications may be made to adapt a particular situation to the teachings of the claimed subject matter without departing from the central concept described herein.
An implementation (1) may be a method for implementing parking space sharing, including: collecting historical ingress and egress data of an owner vehicle associated with each of a plurality of shared parking spaces and an occupied tolerance of the owner to the parking space, and historical ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space; responsive to detecting that the shared parking space is in an idle state, determining an estimated idle time for the shared parking space based at least in part on historical ingress and egress data and occupied tolerance associated with the shared parking space; responsive to receiving a request for a shared vehicle to use a shared parking space in an idle state, determining a latest departure time of the shared vehicle for each shared parking space in an idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupied tolerance associated with each shared parking space in an idle state; determining a set of shared spaces that satisfies the fact that the latest departure time of the shared vehicle is earlier than an estimated free time of the shared spaces; and selecting the shared parking space with the smallest difference value between the latest departure time and the estimated idle time from the shared parking space set as the parking space of the shared vehicle.
There may be some implementations (2) of the above method (1) in which the occupancy tolerance is expressed in terms of an occupancy tolerance probability indicating a probability that an owner can tolerate that a parking spot is occupied when returning to the parking spot.
Some implementations (3) of the above method (2) may exist, wherein determining the estimated free time of the shared parking space further comprises: an estimated idle time is determined based on historical ingress and egress data of the owner vehicle for the shared parking space such that a probability of the estimated idle time for the shared parking space being later than a historical ingress time for the owner vehicle is less than an occupied tolerance probability.
There may be some implementations (4) of the above method (2), wherein the method further comprises: dividing the shared vehicle into a temporary shared vehicle and a long-term shared vehicle based on whether the shared vehicle uses the shared parking space for the first time; and determining the promised departure time of the temporary shared vehicle as the latest departure time of the temporary shared vehicle.
There may be some implementations (5) of the above method (4), wherein the method further comprises: a latest departure time of the long-term shared vehicle is determined based on the historical ingress and egress data of the long-term shared vehicle such that a probability that the latest departure time of the long-term shared vehicle is earlier than the historical departure time of the long-term shared vehicle is less than an occupied tolerance probability.
Another implementation (6) may be a system for enabling parking space sharing, comprising: an acquisition module configured to store owner vehicle history ingress and egress data associated with each of a plurality of shared parking spaces and an owner's occupied tolerance to the parking space, and history ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space; and a parking space management module configured to: detecting whether each shared parking space is in an idle state; responsive to detecting that the shared parking space is in an idle state, determining an estimated idle time for the shared parking space based at least in part on historical ingress and egress data and occupied tolerance associated with the shared parking space; receiving a request from a shared vehicle that the shared vehicle is to use a shared parking space in an idle state; responsive to the request, determining a latest departure time of the shared vehicle for each of the shared spaces in the idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupied tolerance associated with each of the shared spaces in the idle state; determining a set of shared spaces that satisfies the fact that the latest departure time of the shared vehicle is earlier than an estimated free time of the shared spaces; and selecting the shared parking space with the smallest difference value between the latest departure time and the estimated idle time from the shared parking space set as the parking space of the shared vehicle.
There may be some implementations (7) of the above system (6) in which the occupancy tolerance is expressed in terms of an occupancy tolerance probability indicating a probability that an owner can tolerate occupancy of a parking spot when returning to the parking spot.
There may be some implementations (8) of the above system (7), wherein the parking space management module is further configured to: an estimated idle time is determined based on historical ingress and egress data of the owner vehicle for the shared parking space such that a probability of the estimated idle time for the shared parking space being later than a historical ingress time for the owner vehicle is less than an occupied tolerance probability.
There may be some implementations (9) of the above system (7), wherein the parking space management module is further configured to: dividing the shared vehicle into a temporary shared vehicle and a long-term shared vehicle based on whether the shared vehicle uses the shared parking space for the first time; and determining the promised departure time of the temporary shared vehicle as the latest departure time of the temporary shared vehicle.
There may be some implementations (10) of the above system (9), wherein the parking space management module is further configured to: a latest departure time of the long-term shared vehicle is determined based on the historical ingress and egress data of the long-term shared vehicle such that a probability that the latest departure time of the long-term shared vehicle is earlier than the historical departure time of the long-term shared vehicle is less than an occupied tolerance probability.
Claims (6)
1. A method for enabling space sharing, comprising:
collecting historical ingress and egress data of an owner vehicle associated with each of a plurality of shared parking spaces and an occupied tolerance of the owner to the parking space, and historical ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space;
in response to detecting that the shared parking space is in an idle state, determining an estimated idle time for the shared parking space based at least in part on historical ingress and egress data associated with the shared parking space and an occupied tolerance, wherein the occupied tolerance is expressed in terms of an occupied tolerance probability and the occupied tolerance probability indicates a probability that an owner can tolerate the space being occupied upon returning to the parking space, and wherein determining the estimated idle time for the shared parking space further comprises: determining an estimated idle time based on historical ingress and egress data of the owner vehicle for the shared parking space such that a probability that the estimated idle time for the shared parking space is later than a historical ingress time for the owner vehicle is less than the occupied tolerance probability;
responsive to receiving a request for a shared vehicle to use a shared parking space in an idle state, determining a latest departure time of the shared vehicle for each shared parking space in an idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupied tolerance associated with each shared parking space in an idle state;
determining a set of shared spaces that satisfies the fact that the latest departure time of the shared vehicle is earlier than an estimated free time of the shared spaces; and
and selecting the shared parking space with the smallest difference value between the latest departure time and the estimated idle time from the shared parking space set as the parking space of the shared vehicle.
2. The method of claim 1, wherein the method further comprises:
dividing the shared vehicle into a temporary shared vehicle and a long-term shared vehicle based on whether the shared vehicle uses the shared parking space for the first time; and
and determining the promised departure time of the temporary shared vehicle as the latest departure time of the temporary shared vehicle.
3. The method of claim 2, wherein the method further comprises:
a latest departure time of the long-term shared vehicle is determined based on the historical ingress and egress data of the long-term shared vehicle such that a probability that the latest departure time of the long-term shared vehicle is earlier than the historical departure time of the long-term shared vehicle is less than the occupied tolerance probability.
4. A system for enabling space sharing, comprising:
an acquisition module configured to store owner vehicle history ingress and egress data associated with each of a plurality of shared parking spaces and an owner's occupied tolerance to the parking space, and history ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space;
a parking space management module configured to:
detecting whether each shared parking space is in an idle state;
in response to detecting that the shared parking space is in an idle state, determining an estimated idle time for the shared parking space based at least in part on historical ingress and egress data associated with the shared parking space and an occupied tolerance, wherein the occupied tolerance is expressed in terms of an occupied tolerance probability and the occupied tolerance probability indicates a probability that an owner can tolerate the space being occupied upon returning to the parking space, and wherein determining the estimated idle time for the shared parking space further comprises: determining an estimated idle time based on historical ingress and egress data of the owner vehicle for the shared parking space such that a probability that the estimated idle time for the shared parking space is later than a historical ingress time for the owner vehicle is less than the occupied tolerance probability;
receiving a request from a shared vehicle that the shared vehicle is to use a shared parking space in an idle state;
responsive to the request, determining a latest departure time of the shared vehicle for each of the shared spaces in the idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupied tolerance associated with each of the shared spaces in the idle state;
determining a set of shared spaces that satisfies the fact that the latest departure time of the shared vehicle is earlier than an estimated free time of the shared spaces; and
and selecting the shared parking space with the smallest difference value between the latest departure time and the estimated idle time from the shared parking space set as the parking space of the shared vehicle.
5. The system of claim 4, wherein the parking management module is further configured to:
dividing the shared vehicle into a temporary shared vehicle and a long-term shared vehicle based on whether the shared vehicle uses the shared parking space for the first time; and
and determining the promised departure time of the temporary shared vehicle as the latest departure time of the temporary shared vehicle.
6. The system of claim 5, wherein the parking management module is further configured to:
a latest departure time of the long-term shared vehicle is determined based on the historical ingress and egress data of the long-term shared vehicle such that a probability that the latest departure time of the long-term shared vehicle is earlier than the historical departure time of the long-term shared vehicle is less than the occupied tolerance probability.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111646686.8A CN114973692B (en) | 2021-12-30 | 2021-12-30 | Method and system for realizing tidal space sharing in community/business district |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111646686.8A CN114973692B (en) | 2021-12-30 | 2021-12-30 | Method and system for realizing tidal space sharing in community/business district |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114973692A CN114973692A (en) | 2022-08-30 |
| CN114973692B true CN114973692B (en) | 2023-09-19 |
Family
ID=82975126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111646686.8A Active CN114973692B (en) | 2021-12-30 | 2021-12-30 | Method and system for realizing tidal space sharing in community/business district |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114973692B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103247179A (en) * | 2013-05-15 | 2013-08-14 | 王明伟 | Community parking space sharing and use reserving service system based on vehicle identification |
| WO2014072909A1 (en) * | 2012-11-06 | 2014-05-15 | S-Parking Technologies Ltd. | Parking spot coordination system |
| DE102015211732A1 (en) * | 2015-06-24 | 2016-12-29 | Robert Bosch Gmbh | Cooperative parking |
| CN106469517A (en) * | 2015-08-20 | 2017-03-01 | 腾石智能科技（上海）有限公司 | The method with sharing parking stall for the system sharing parking stall |
| CA2954890A1 (en) * | 2016-01-14 | 2017-03-17 | Plemicor Holdings Canada Inc. | Public parking space remote reservation system |
| WO2017088838A1 (en) * | 2015-11-27 | 2017-06-01 | 应石磊 | Parking space reservation method and device, and parking space reservation system |
| CN107170283A (en) * | 2017-06-23 | 2017-09-15 | 深圳市盛路物联通讯技术有限公司 | A kind of parking stall decision-making technique and system |
| CN107767686A (en) * | 2017-09-18 | 2018-03-06 | 东南大学 | A kind of residential area parking lot opening and shares Berth number method for determination of amount |
| CN108898830A (en) * | 2018-06-11 | 2018-11-27 | 同济大学 | The space-time of combined parking field shares the parking stall equalization methods that matching degree calculates |
| CN109872558A (en) * | 2017-12-04 | 2019-06-11 | 广州市捷众智能科技有限公司 | A kind of indoor parking stall state-detection method based on Cross hair laser projection |
| US10529233B1 (en) * | 2018-09-24 | 2020-01-07 | Ford Global Technologies Llc | Vehicle and method for detecting a parking space via a drone |
| CN112750217A (en) * | 2020-12-25 | 2021-05-04 | 西安艾润物联网技术服务有限责任公司 | Parking space sharing method, equipment and medium |
-
2021
- 2021-12-30 CN CN202111646686.8A patent/CN114973692B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014072909A1 (en) * | 2012-11-06 | 2014-05-15 | S-Parking Technologies Ltd. | Parking spot coordination system |
| CN103247179A (en) * | 2013-05-15 | 2013-08-14 | 王明伟 | Community parking space sharing and use reserving service system based on vehicle identification |
| DE102015211732A1 (en) * | 2015-06-24 | 2016-12-29 | Robert Bosch Gmbh | Cooperative parking |
| CN106469517A (en) * | 2015-08-20 | 2017-03-01 | 腾石智能科技（上海）有限公司 | The method with sharing parking stall for the system sharing parking stall |
| WO2017088838A1 (en) * | 2015-11-27 | 2017-06-01 | 应石磊 | Parking space reservation method and device, and parking space reservation system |
| CA2954890A1 (en) * | 2016-01-14 | 2017-03-17 | Plemicor Holdings Canada Inc. | Public parking space remote reservation system |
| CN107170283A (en) * | 2017-06-23 | 2017-09-15 | 深圳市盛路物联通讯技术有限公司 | A kind of parking stall decision-making technique and system |
| CN107767686A (en) * | 2017-09-18 | 2018-03-06 | 东南大学 | A kind of residential area parking lot opening and shares Berth number method for determination of amount |
| CN109872558A (en) * | 2017-12-04 | 2019-06-11 | 广州市捷众智能科技有限公司 | A kind of indoor parking stall state-detection method based on Cross hair laser projection |
| CN108898830A (en) * | 2018-06-11 | 2018-11-27 | 同济大学 | The space-time of combined parking field shares the parking stall equalization methods that matching degree calculates |
| US10529233B1 (en) * | 2018-09-24 | 2020-01-07 | Ford Global Technologies Llc | Vehicle and method for detecting a parking space via a drone |
| CN112750217A (en) * | 2020-12-25 | 2021-05-04 | 西安艾润物联网技术服务有限责任公司 | Parking space sharing method, equipment and medium |
Non-Patent Citations (2)
| Title |
|---|
| 向量自回归预测的泊位共享优化算法研究;张雷;陈浩;王强;刘虹蔚;;科学技术与工程(第05期);全文 * |
| 基于RFID车位身份识别卡的小区地下车库安全管理设计;王斌;;电子制作(第06期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114973692A (en) | 2022-08-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111009151B (en) | Parking space recommendation method, storage medium and terminal device | |
| CN108346010B (en) | Shared automobile scheduling method based on user demand analysis | |
| CN102629422B (en) | Smart urban cloud computing parking management system and implementation method | |
| CN109712392B (en) | Parking information processing method, device, equipment and storage medium based on block chain | |
| CN112509363B (en) | Method and device for determining idle parking space | |
| CN105654776A (en) | Realtime collection system and method of idle-busy parking lot data | |
| TWI395163B (en) | System and method for parking space sharing and matching | |
| CN108806317B (en) | Parking space pushing method, medium, terminal equipment and device based on big data calculation | |
| CN111190942B (en) | Urban road parking spot overall analysis method based on data mining technology | |
| CN114973692B (en) | Method and system for realizing tidal space sharing in community/business district | |
| CN110807946B (en) | Shared parking space renting method based on big data | |
| CN111915925A (en) | Intelligent parking management method, device and system and storage medium | |
| CN111539551A (en) | Driving destination address prediction method and device, computer equipment and storage medium | |
| CN112781177B (en) | Method and device for predicting air conditioner operating power, electronic equipment and storage medium | |
| CN113269957A (en) | Parking lot parking space scheduling system and method | |
| Dowling et al. | Optimizing curbside parking resources subject to congestion constraints | |
| CN110930687B (en) | Method and system for dispatching vehicles in peak vehicle time period | |
| CN111754642A (en) | Management method and management device for shared parking lot and terminal | |
| CN115204433A (en) | Shared parking place reservation matching method for automatic driving automobile | |
| CN112529311B (en) | Road flow prediction method and device based on graph convolution analysis | |
| CN116228295A (en) | Intelligent recommendation method and system for charging pile | |
| CN115019509A (en) | Parking lot vacant parking space prediction method and system based on two-stage attention LSTM | |
| CN113823085B (en) | Traffic flow estimation method of comprehensive management system of public parking lot | |
| CN111523723A (en) | Method and device for optimal configuration of vehicles at public bicycle station | |
| Kung et al. | An application of GM (1, 1) model for automobile industry |
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 |