CN114973692A - Method and system for realizing community/business district tide parking space sharing - Google Patents
Method and system for realizing community/business district tide parking space sharing Download PDFInfo
- Publication number
- CN114973692A CN114973692A CN202111646686.8A CN202111646686A CN114973692A CN 114973692 A CN114973692 A CN 114973692A CN 202111646686 A CN202111646686 A CN 202111646686A CN 114973692 A CN114973692 A CN 114973692A
- Authority
- CN
- China
- Prior art keywords
- shared
- vehicle
- parking space
- time
- historical
- 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/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
Abstract
A method and system for implementing space sharing, the method comprising: acquiring historical access data of an owner vehicle, occupied tolerance of the owner and historical access 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; in response to receiving a request that the shared vehicle be to use a shared slot in an idle state, determining a latest departure time for each shared vehicle based at least in part on the data; determining a shared parking space set which meets the condition that the latest leaving time of the shared vehicle is earlier than the estimated idle time of the shared parking space; and selecting the parking space of the shared vehicle from the shared space set. The system comprises a collection module configured to collect the data and a parking space management module configured to select a parking space of the shared vehicle using the method. Numerous other aspects are also included.
Description
Technical Field
The present invention relates to the field of intelligent communities, and more particularly to a method and system for tidal parking space sharing for communities and/or commercial areas.
Background
Along with the increase of the quantity of automobile reserves in large and medium-sized cities in China, the problem of difficult urban parking becomes a common problem, but meanwhile, the parking problem shows very strong tide, 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 the residential area has a large number of idle parking spaces, otherwise, a large number of vehicles leave the office building and enter the residential area at night. Aiming at the moving tide of the urban vehicle, the invention provides a method and a system for realizing tide parking space sharing in a community/business area, which effectively reduce the parking space occupation situation in non-idle time periods, improve the utilization rate of idle parking spaces and save the time and power consumption for searching the parking spaces by the vehicle through analyzing the historical behavior of the vehicle.
The invention content is as follows:
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 invention provides a method and a system for realizing tidal parking space sharing in a community/business district.
The invention provides a method for realizing parking space sharing, which comprises the following steps:
acquiring historical entry and exit data of an owner vehicle associated with each shared parking space in a plurality of shared parking spaces, the occupied tolerance of the owner to the parking space and historical entry and exit data associated with each shared vehicle in the plurality of shared vehicles using the shared parking spaces;
in response to detecting that the shared slot is in an idle state, determining an estimated idle time for the shared slot based at least in part on historical ingress and egress data and an occupied tolerance associated with the shared slot;
in response to receiving a request for a shared vehicle to use a shared slot in an idle state, determining a latest departure time for the shared vehicle for each shared slot in an idle state based at least in part on historical entry and exit data for the shared vehicle and an occupancy tolerance associated with each shared slot in an idle state;
determining a set of shared slots that satisfies that the latest departure time of the shared vehicle is earlier than an estimated idle time of the shared slots; and
and selecting the shared parking space with the minimum 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 invention, the occupied tolerance is expressed in the form of an occupied tolerance probability, wherein the occupied tolerance probability indicates the probability that a proprietor can tolerate a parking space occupied when returning to it.
According to a further embodiment of the present invention, determining the estimated idle time of the shared slot further comprises:
determining an estimated idle time based on historical entry and exit data of the owner vehicle of the shared parking space such that a 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 an occupied tolerance probability.
According to a further embodiment of the invention, 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 slot for the first time; and
determining the promised departure time of the temporary shared vehicle as its latest departure time.
According to a further embodiment of the invention, the method further comprises:
determining a latest departure time of the long-term shared vehicle based on historical entry and exit 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 a historical departure time of the long-term shared vehicle is less than an occupied tolerance probability.
The invention also provides a system for realizing parking space sharing, which comprises:
a collection module configured to acquire owner vehicle historical ingress and egress data associated with each of a plurality of shared parking spaces and an owner's occupancy tolerance for the parking space, and historical ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space;
a slot management module configured to:
detecting whether each sharing parking space is in an idle state or not;
in response to detecting that the shared slot is in an idle state, determining an estimated idle time for the shared slot based at least in part on historical ingress and egress data and an occupied tolerance associated with the shared slot;
receiving, from a shared vehicle, a request that the shared vehicle be to use a shared slot in an idle state; in response to the request, determining a latest departure time of the shared vehicle for each shared slot in an idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupancy tolerance associated with each shared slot in an idle state;
determining a set of shared slots that satisfies that the latest departure time of the shared vehicle is earlier than an estimated idle time of the shared slots; and
and selecting the shared parking space with the minimum 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 invention, the occupancy tolerance is expressed in the form of an occupancy tolerance probability, wherein the occupancy tolerance probability indicates the probability that the owner can tolerate a parking space being occupied when returning to the parking space.
According to a further embodiment of the present invention, the space management module is further configured to:
determining an estimated idle time based on historical entry and exit data of the owner vehicle of the shared parking space such that a 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 an occupied tolerance probability.
According to a further embodiment of the present invention, the 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 slot 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 present invention, the space management module is further configured to:
determining a latest departure time of the long-term sharing vehicle based on historical entry and exit data of the long-term sharing vehicle such that a probability that the latest departure time of the long-term sharing vehicle is earlier than a historical departure time of the long-term sharing vehicle is less than an occupancy 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 various 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 invention can be understood in detail, a more particular description of the invention, 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 some typical aspects of this invention 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 used to designate like elements 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 a system module for enabling sharing of tidal parking spaces according to an embodiment of the present invention.
FIG. 2 illustrates an example of a process flow for achieving sharing of tidal parking spaces in accordance with an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to specific embodiments and the accompanying drawings. 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 specified, the term "a or B" used through the present specification means "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, a management method for providing services to outside in the idle period of a parking space is provided in partial communities and business districts. However, due to lack of analysis on the number of free parking spaces and the length of free parking spaces, the situation that a shared vehicle (an external vehicle occupying a parking space in a sharing manner) does not leave when an owner vehicle (a vehicle to which the parking space actually belongs) returns often occurs, so that the enthusiasm of the owner for a management method for providing services to the outside in the free parking space period is low. The invention provides a method and a system for realizing community/business district tide parking space sharing, which effectively reduce the parking space occupation situation in non-idle time periods and improve the supporting force of owners on tide parking space management by analyzing the historical behaviors of vehicles, thereby improving the utilization rate of idle parking spaces and saving the time and power consumption for searching parking spaces by vehicles.
FIG. 1 illustrates an example of a system module for enabling sharing of tidal parking spaces according to an embodiment of the present invention.
In an embodiment of the present application, the system 100 for enabling sharing of tidal parking spaces may include a capture module 105 for capturing historical behavior of the owner vehicle. For example, the history data may be recorded and stored according to the history behavior of the entry and exit of the owner vehicle: { date D, date Attribute A, departure time T out (HH: MM: SS), door-in time T in (HH: MM: SS) }. Wherein, the date attribute A can take the following values: a belongs to { working day, weekend, holiday }, and departure time T out Before the door-entering time T in . In an embodiment of the present application, the historical data set may be denoted as N. It should be noted that the history data in the case where the owner vehicle makes multiple accesses on the same day may be omitted, or only one of the history data (for example, the first access time of the day, the average value of the access times, the expected value of the access times, etc.) may be recorded/stored in the case where the owner vehicle makes multiple accesses on the same day, and may be filtered using an existing statistical method known to those skilled in the art, which will not be described herein.
In an embodiment of the present application, a system 100 for enabling sharing of tidal parking spaces may include a space management module 110. The parking space management module 110 may calculate the probability that the car owner can tolerate the occupied parking space.
In the embodiment of the application, the tolerance of the owner on the occupied parking space when the owner goes out and returns can be investigated in a questionnaire mode, and the attribute is set for the owner vehicle. Wherein, the tolerance value range is as follows: r.epsilon. { never, 1 time per half year, 1 time per month, 1 time per week }. Correspondingly, the occupied tolerance can be represented by the form of occupied tolerance probability, wherein the occupied tolerance probability indicates the probability that the owner can tolerate the parking space to be occupied when returning the parking space, and the occupied tolerance probability is as follows: p ∈ {0, 1/180, 1/30, 1/7}, i.e., 1 time every half year (180 days), 1 time per month (30 days), and 1 time per week (7 days). In the embodiment of the present application, the tolerance value condition is (that is, only the qualified owner vehicle may select the corresponding tolerance value): (1) never: historical data sample number > 365; (2) once every half year: (ii) number of historical data samples > 180; (3) 1 time per month: (ii) number of historical data samples > 30; and (4) 1 time per week: number of historical data samples > 7. In the embodiment of the application, in order to improve the share 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 although only 4 value ranges 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 the time when the parking space is free. For example, the parking space free time T (HH: MM: SS) can be estimated from the historical leaving data of the owner vehicle according to the tolerance probability of the owner to the occupied parking space and the date attribute: t is a Length ({ B | T) in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C ∈ N }) maximum (latest) of P, where a 0 For the current date attribute, the value: a ∈ { working day, weekend, holiday }, and the Length (X) function indicates the length of set X, i.e., the number of elements of X. The above formula can be interpreted as: having a date attribute A 0 Under the condition of (1), the parking space is idle at the moment T in The number later than the historical entry time T is less than the total number of the historical entry times T multiplied by the occupancy tolerance probability.
In the examples of the present application, let A be 0 For weekends, the tolerance probability value P is 1/180, the probability that the parking space is still occupied when the owner vehicle goes out and returns in weekends is less than 1/180, 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/180. Specifically, Length ({ B | T) can be satisfied by finding in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C belongs to N }) P parking space idle time T in T of in Set and further from the T in And selecting the latest value in the set as the estimated parking space idle time. In another embodiment of the present application, assume A 0 The tolerance probability value P is 1/7 for the working day, and the probability that the estimated idle time of the shared parking space is later than the historical door-entering time of the owner vehicle is less than 1/7. For example, if the historical entry time T has values of {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 in total), the idle time T is estimated in 17:15:01, and {17:11:00, 17:12:00, 17:13:00, 17:14:00, 17:15:00} in the set of history data satisfies { BlT } in <T AND A＝A 0 B ∈ N }, and thus Length ({ B | T }) in <T AND A＝A 0 B ∈ N }) -5, thus Length ({ B | T }) in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C ∈ N })) P does not hold. Conversely, when T is in Not later than 17:11:59, only {17:11:00} satisfies { B | T } in <T AND A＝A 0 B ∈ N }, and thus Length ({ B | T }) in <T AND A＝A 0 B ∈ N }) >1 such that Length ({ B | T) } in <T AND A＝A 0 ，B∈N})<Length({C|A＝A 0 C e N) P is established, and the estimated parking space idle time T should be determined to be 17:11: 59. Note that the estimated space free time T of 17:11:59 indicates that the owner vehicle is estimated not to return to the space at that time approximately. It should also be noted that the above examples are by way of example only and are not meant to limit the present application.
In embodiments of the present application, the behavior of a shared vehicle may be collected. For example, the sharing vehicle may be distinguished as a long-term sharing vehicle (i.e., a sharing vehicle that frequently enters the community/business district) and a temporary sharing vehicle. The long-term shared vehicle may be identified as a first type of vehicle and the temporary shared vehicle may be identified as a second type of vehicle.
In embodiments of the present application, the acquisition module 105 may also acquire historical behavior of long-term shared vehicles. For example, according to long-term shared vehiclesHistory of vehicle ingress and egress to record its historical data: { date D ', date attribute A ', door entry time T ' in (HH: MM: SS), departure time T' out (HH: MM: SS) }. Wherein, the date attribute can take the value: a' belongs to { working day, weekend, holiday }, and door-entering time T in ' earlier than departure time T out '. In an embodiment of the present application, the historical data set may be denoted as M. It should be noted that the historical data in the case of multiple accesses on the same day by the shared vehicle may be ignored, or only one of the historical data (e.g., the last departure time of the day, the average value of the departure times, the expected value of the departure times, etc.) may be taken for storage/recording in the case of multiple accesses on the same day by the shared vehicle, and may be filtered using existing statistical methods known to those skilled in the art, which will not be described herein.
In embodiments of the present application, the collection module 105 may also collect the promised departure time of the temporary shared vehicle. For example, a temporarily shared vehicle may need to commit to a departure time at the time of entry. For example, a temporarily shared vehicle entering a community/business area may promise a latest departure time T 2 (HH: MM: SS). If overtime, the community/business area punishments overtime according to the requirement.
In embodiments of the present application, the space management module 110 may also estimate the expected departure time of the long-term shared vehicle by analyzing historical behavior of the long-term shared vehicle. For example, free parking spaces in a community/business district can be compared one by one, the expected leaving time T of the long-term shared vehicle can be estimated through historical data according to the tolerance probability of the owner to the occupation of the free parking spaces and the date attribute 1 (HH:MM:SS)：T 1 To satisfy Length ({ B | T) 1 <T’ out AND A’＝A’ 0 ，B∈M})<Length({C|A’＝A’ 0 C ∈ M }) minimum value (earliest value) of P, where A' 0 For the current date attribute, the value: a ∈ { working day, weekend, holiday }, and the Length (X) function indicates the length of 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 desired departure time T 1 Morning calendarHistory leaving time T' out Is less than the historical departure time T' out Multiplied by the occupancy tolerance probability. Specifically, the Length ({ B | T) can be satisfied by finding 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 1 Set and further from the T 1 And selecting the earliest value in the set as the estimated parking space idle time.
In the examples of the present application, let A be 0 The tolerance probability value P is 1/7 for the working day, the probability that the parking space is still occupied when the owner vehicle goes out and returns in the working day is less than 1/7, and the probability that the latest leaving time of the long-term sharing vehicle is earlier than the historical leaving time of the long-term sharing vehicle is less than 1/7. Specifically, for example, at the historical departure time T' out With 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} (8 in total), if 17:01: 59, then 7 values of {17:02:00, 17:03:00, 17:04:00, 17:05:00, 17:06:00, 17:07:00, 17:08:00} in the above historical data set all satisfy { B | T } 1 <T’ out AND A’＝A’ 0 B ∈ M }, and therefore Length ({ B | T }) 1 <T’ out AND A’＝A’ 0 B ∈ M }) -7. Conversely, when T is 1 Not earlier than 17:07:01, only {17:08:00} satisfies { B | T } 1 <T’ out AND A’＝A’ 0 B ∈ M }, so Length ({ B | T [ ] 1 <T’ out AND A’＝A’ 0 B ∈ M })) 1, such 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), the long-term shared vehicle should be expected to leave at time T 1 The determination was 17:07: 01. t in the above example 1 17:07:01 denotes that the vehicle is estimated to be at 17:07: the vehicle leaves at the moment 01 approximately, namely, the time for predicting the vehicle to leave is not later than 17:07: 01. it should be noted that the above examples are merely illustrative and are not meant to be an admission of the present applicationAnd (4) limiting.
In the 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 committed departure time T 2 Or long-term sharing of the vehicle expected departure time T 1 And selecting the parking place which meets T ' less than or equal to T and has the minimum value of T-T ' according to the latest leaving time T ' of the sharing vehicle and the parking place idle time T, and determining the parking place as the current sharing parking place which is matched as the most preferable sharing parking place by the method. In the embodiment of the application, a set of parking spaces meeting T '≦ T can be determined, and the parking space with the smallest difference between the latest leaving time T' of the shared vehicle and the parking space free time T in the set is determined as the parking space matched with the shared vehicle, and the shared vehicle is parked on the parking space.
FIG. 2 illustrates an example of a process flow for achieving sharing of tidal parking spaces in accordance with an embodiment of the present invention.
At 1102, the owner's tolerance to the parking space being occupied can be recorded and the owner's tolerance probability to the parking space being occupied can be calculated.
At 1104, a determination may be made as to whether the owner vehicle is away, if not polling, then 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 saved.
At 1110, the slot free time T may be estimated based on the owner vehicle's time of day of departure and historical behavior records.
At 1112, it may be determined whether a shared vehicle has entered, if not polling, 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 the long-term shared vehicle, then at 1116, the promised departure time T for the temporary shared vehicle may be collected 1 。
If the shared vehicle belongs to a long-term shared vehicle, then the behavior of the long-term shared vehicle may be collected 1118, anda historical behavior record of the long-term shared vehicle is saved 1120, and an expected departure time T of the long-term shared vehicle can be calculated based on the previously saved historical behavior record of the long-term shared vehicle 2 。
At 1122, the shared vehicle's latest departure time T' is determined as the promised departure time T based on the shared vehicle attributes 1 Or desired departure time T 2 。
At 1124, it may be determined whether T is a space satisfying T '≦ T, and the T-T' value is the smallest space, if not polling the determination, then at 1126, confirm the space, and at 1128 direct the parking according to the space.
The above describes a system and a method for realizing the contribution of a tidal parking space according to the invention, which has at least the following advantages over the prior art:
(1) in the scheme, vehicles with sharing requirements can participate in sharing, so that the application range of tidal parking space sharing is effectively expanded;
(2) the vehicle can find the optimal free parking space in the parking lot of the target community/business district, the utilization rate of the free parking space and the system efficiency are effectively improved, a method for estimating the free time of the parking space when the owner vehicle goes out and a method for estimating the latest leaving time of the shared vehicle are provided, and a system optimal scheme for completing the matching of the free parking space and the shared vehicle is obtained on the basis, so the time and the power consumption for the vehicle to find the parking space are saved;
(3) the method comprises the following steps of creatively introducing the owner's tolerance survey of occupied parking spaces when the owner goes out and returns, and carrying out analysis and calculation on the basis of the tolerance survey to obtain an owner satisfaction optimal scheme for completing matching of free parking spaces and shared vehicles;
(4) through automatic calculation of historical data, a process of manually selecting matching is omitted, and a scheme with high automation degree for completing matching of the free parking spaces and the shared vehicles is obtained; and
(5) a method for temporarily sharing the vehicle to occupy the vacant parking space without historical data samples is compatibly considered, and a scheme with a wide 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, usage of such phrases may not refer to only 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 the 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, hardware component, or any combination thereof. A general purpose processor may be a processor, microprocessor, controller, microcontroller, or state machine, among others. If implemented in software, the various illustrative steps, modules, etc. described in connection with the disclosure may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. A software module implementing various operations of the present disclosure may reside in a storage medium such as RAM, flash memory, ROM, EPROM, EEPROM, registers, hard disk, a removable disk, a CD-ROM, cloud storage, and the like. A storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium, and execute the corresponding program modules to perform the various steps of the present disclosure. Furthermore, software-based embodiments may be uploaded, downloaded, or accessed remotely through suitable communication means. Such suitable communication means include, for example, the internet, the world wide web, an intranet, software applications, cable (including fiber optic cable), magnetic communication, electromagnetic communication (including RF microwave and infrared communication), electronic communication, or other such communication means.
The numerical values given in the embodiments are only examples and do not limit the scope of the present invention. In addition, there may be other components or steps not recited in the claims or description of the invention as a whole. Moreover, the singular reference of a component does not exclude the plural reference of such components.
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. In addition, 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 individually and in various combinations and sub-combinations with each other. 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 a particular or all technical problem be solved.
The present invention is not limited to the above-mentioned embodiments, which are only illustrative and not restrictive, and those skilled in the art can make many modifications without departing from the spirit and scope of the invention as defined in the appended claims.
One skilled in the relevant art will recognize that the embodiments can be practiced without one or more of the specific details, or with other methods, resources, materials, and so forth. In other instances, well-known structures, resources, or operations have not been shown or described in detail merely to observe obscuring aspects of the embodiments.
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 a variety of meanings that are also contemplated depending, at least in part, on the context in which such terms are used. In general, "or" if used to associate a list, such as A, B or C, is intended to mean A, B and C (used herein in an inclusive sense) and A, B or C (used herein in an exclusive sense). In addition, the term "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 or some other combination of features, structures, or characteristics. 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 claimed subject matter without departing from the central concept described herein.
An implementation (1) may be a method for implementing space sharing, comprising: acquiring historical entry and exit data of an owner vehicle associated with each shared parking space in a plurality of shared parking spaces, occupied tolerance of the owner to the parking space, and historical entry and exit data associated with each shared vehicle in the plurality of shared vehicles using the shared parking spaces; in response to detecting that the shared slot is in an idle state, determining an estimated idle time for the shared slot based at least in part on historical ingress and egress data and an occupied tolerance associated with the shared slot; in response to receiving a request for a shared vehicle to use a shared slot in an idle state, determining a latest departure time for the shared vehicle for each shared slot in an idle state based at least in part on historical entry and exit data for the shared vehicle and an occupancy tolerance associated with each shared slot in an idle state; determining a set of shared parking spaces that satisfies that the latest departure time of the shared vehicle is earlier than an estimated idle time of the shared parking spaces; and selecting the shared parking space with the minimum difference value between the latest leaving 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 method (1) described above in which the occupancy tolerance is expressed in the form of an occupancy tolerance probability that indicates a probability that the owner can tolerate a space being occupied when returning to the space.
Some implementations (3) of the method (2) above, wherein determining the estimated idle time of the shared slot further comprise: determining an estimated idle time based on historical entry and exit data of the owner vehicle of the shared parking space such that a 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 an occupied tolerance probability.
There may be some implementations (4) of the method (2) above, 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 thereof.
There may be some implementations (5) of the method (4) above, wherein the method further comprises: determining a latest departure time of the long-term shared vehicle based on the historical entry and exit 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 implementing space sharing, comprising: a collection module configured to acquire owner vehicle historical ingress and egress data associated with each of a plurality of shared parking spaces and an owner's occupancy tolerance for the parking space, and historical ingress and egress data associated with each of a plurality of shared vehicles using the shared parking space; and a slot management module configured to: detecting whether each sharing parking space is in an idle state or not; 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 entry and exit data and occupied tolerances associated with the shared parking space; receiving, from a shared vehicle, a request that the shared vehicle be to use a shared slot in an idle state; in response to the request, determining a latest departure time of the shared vehicle for each shared slot in an idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupancy tolerance associated with each shared slot in an idle state; determining a set of shared slots that satisfies that the latest departure time of the shared vehicle is earlier than an estimated idle time of the shared slots; and selecting the shared parking space with the minimum difference value between the latest leaving 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 system (6) described above in which the occupancy tolerance is expressed in the form of an occupancy tolerance probability that indicates a probability that the owner can tolerate a space being occupied when returning to that space.
There may be some implementations (8) of the system (7) described above, wherein the slot management module is further configured to: determining an estimated idle time based on historical entry and exit data of the owner vehicle of the shared parking space such that a 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 an occupied tolerance probability.
There may be some implementations (9) of the system (7) described above, wherein the slot 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 slot for the first time; and determining the promised departure time of the temporary shared vehicle as the latest departure time thereof.
There may be some implementations (10) of the system (9) described above, wherein the slot management module is further configured to: determining a latest departure time of the long-term sharing vehicle based on historical entry and exit data of the long-term sharing vehicle such that a probability that the latest departure time of the long-term sharing vehicle is earlier than a historical departure time of the long-term sharing vehicle is less than an occupancy tolerance probability.
Claims (10)
1. A method for implementing space sharing, comprising:
acquiring historical entry and exit data of an owner vehicle associated with each shared parking space in a plurality of shared parking spaces, the occupied tolerance of the owner to the parking space and historical entry and exit data associated with each shared vehicle in the plurality of shared vehicles using the shared parking spaces;
in response to detecting that the shared slot is in an idle state, determining an estimated idle time for the shared slot based at least in part on historical ingress and egress data and an occupied tolerance associated with the shared slot;
in response to receiving a request for a shared vehicle to use a shared slot in an idle state, determining a latest departure time for the shared vehicle for each shared slot in an idle state based at least in part on historical entry and exit data for the shared vehicle and an occupancy tolerance associated with each shared slot in an idle state;
determining a set of shared slots that satisfies that the latest departure time of the shared vehicle is earlier than an estimated idle time of the shared slots; and
and selecting the shared parking space with the minimum 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 occupancy tolerance is expressed as an occupancy tolerance probability that indicates a probability that the owner can tolerate a space being occupied when returning to the space.
3. The method of claim 2, wherein determining the estimated idle time for the shared slot further comprises:
determining an estimated idle time based on historical entry and exit data of the owner vehicle of the shared parking space such that a 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 an occupied tolerance probability.
4. The method of claim 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 its latest departure time.
5. The method of claim 4, wherein the method further comprises:
determining a latest departure time of the long-term sharing vehicle based on historical entry and exit data of the long-term sharing vehicle such that a probability that the latest departure time of the long-term sharing vehicle is earlier than a historical departure time of the long-term sharing vehicle is less than an occupancy tolerance probability.
6. A system for implementing space sharing, comprising:
a collection module configured to acquire owner vehicle historical ingress and egress data associated with each of a plurality of shared parking spaces and an owner's occupancy tolerance for the parking space, and historical 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 sharing parking space is in an idle state or not;
in response to detecting that the shared slot is in an idle state, determining an estimated idle time for the shared slot based at least in part on historical ingress and egress data and an occupied tolerance associated with the shared slot;
receiving, from a sharing vehicle, a request that the sharing vehicle be to use a sharing parking spot in an idle state;
in response to the request, determining a latest departure time of the shared vehicle for each shared slot in an idle state based at least in part on historical ingress and egress data of the shared vehicle and an occupancy tolerance associated with each shared slot in an idle state;
determining a set of shared slots that satisfies that the latest departure time of the shared vehicle is earlier than an estimated idle time of the shared slots; and
and selecting the shared parking space with the minimum 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.
7. The system of claim 6, wherein the occupancy tolerance is expressed in terms of an occupancy tolerance probability, wherein the occupancy tolerance probability indicates a probability that the owner can tolerate a space being occupied when returning to the space.
8. The system of claim 7, wherein the slot management module is further configured to:
determining an estimated idle time based on historical entry and exit data of the owner vehicle of the shared parking space such that a 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 an occupied tolerance probability.
9. The system of claim 7, wherein the slot 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 slot 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.
10. The system of claim 9, wherein the slot management module is further configured to:
determining a latest departure time of the long-term sharing vehicle based on historical entry and exit data of the long-term sharing vehicle such that a probability that the latest departure time of the long-term sharing vehicle is earlier than a historical departure time of the long-term sharing vehicle is less than an occupancy 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 true CN114973692A (en) | 2022-08-30 |
| CN114973692B 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 |
|---|
| 张雷;陈浩;王强;刘虹蔚;: "向量自回归预测的泊位共享优化算法研究", 科学技术与工程, no. 05 * |
| 王斌;: "基于RFID车位身份识别卡的小区地下车库安全管理设计", 电子制作, no. 06 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114973692B (en) | 2023-09-19 |
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 | |
| CN110390349A (en) | Bus passenger flow volume based on XGBoost model predicts modeling method | |
| CN106295888B (en) | Method for determining shared time window of public building parking lot configuration based on measured data | |
| CN111190942B (en) | Urban road parking spot overall analysis method based on data mining technology | |
| CN110807946B (en) | Shared parking space renting method based on big data | |
| CN113223291A (en) | System and method for predicting number of free parking spaces in parking lot | |
| CN112509363A (en) | Method and device for determining idle parking space | |
| CN112927376A (en) | Intelligent parking lot management system | |
| CN114973692A (en) | Method and system for realizing community/business district tide parking space sharing | |
| CN112652164B (en) | Traffic time interval dividing method, device and equipment | |
| CN111754642A (en) | Management method and management device for shared parking lot and terminal | |
| CN113269957A (en) | Parking lot parking space scheduling system and method | |
| CN116012029A (en) | Big data information acquisition method and system | |
| CN113538948B (en) | Parking space navigation system and method based on wireless sensing technology of Internet of things | |
| CN115019509A (en) | Parking lot vacant parking space prediction method and system based on two-stage attention LSTM | |
| CN110837903A (en) | Rail transit short-term passenger flow prediction method and system and electronic equipment | |
| CN113823085B (en) | Traffic flow estimation method of comprehensive management system of public parking lot | |
| Zafar et al. | Analysis of GPS-based high resolution vehicle mobility data towards the electrification of transportation in Qatar | |
| CN113371664B (en) | Non-social urea and fuel filling point position identification method, system and terminal | |
| CN113159897A (en) | Intelligent property community management system and method based on cloud storage and data analysis | |
| CN111276006A (en) | Intelligent community parking space sharing system and method thereof | |
| CN111815994A (en) | Intelligent vehicle information comprehensive application system | |
| CN111523723A (en) | Method and device for optimal configuration of vehicles at public bicycle station | |
| CN112242068A (en) | Parking space sharing method, service platform and storage medium |
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 |