A parking space allocation method and related equipment

Abstract

This application provides a parking space allocation method and related equipment. The parking space allocation method includes: determining a first-generation value of an available parking space in a parking lot associated with a destination for a target vehicle from its current location, and determining a second-generation value of a user in the target vehicle from the available parking space to the destination; determining a total generation value for each available parking space based on the first-generation value and the second-generation value, wherein the total generation value represents the time cost for the user to reach the destination; and sending the location information of the available parking space corresponding to the target generation value to the target vehicle or to the user terminal associated with the target vehicle, wherein the target generation value indicates a total generation value less than a preset generation value. This application improves the accuracy of parking space allocation.

Description

Technical Field

[0001] This application relates to the field of parking technology, and in particular to a parking space allocation method and related equipment. Background Technology

[0002] As people's living standards improve, vehicles have become an indispensable means of transportation for daily travel. In areas with high pedestrian traffic, such as hospitals, users need to spend a lot of time searching for parking spaces nearby or within the area.

[0003] In the exemplary technology, users can make reservations at their destination through the parking system, which then recommends suitable parking spaces to the user.

[0004] However, after parking in the recommended parking space, users may need to navigate within the space, resulting in a longer walking time. This leads to lower accuracy in parking space recommendations and a poor user experience. Summary of the Invention

[0005] Based on the aforementioned technological status, this application provides a parking space allocation method and related equipment to solve the problem of low accuracy in parking space allocation.

[0006] To achieve the above-mentioned technical objectives, this application proposes the following technical solution: Firstly, this application provides a parking space allocation method, including: Determine the first-generation value of the available parking space in the parking lot associated with the target vehicle's journey from its current location to its destination, and determine the second-generation value of the user in the target vehicle's journey from the available parking space to the destination. Based on the first-generation value and the second-generation value corresponding to each of the vacant parking spaces, the total generation value of each vacant parking space is determined, and the total generation value is used to characterize the time cost for the user to reach the destination; The location information of the available parking space corresponding to the target value is sent to the target vehicle or to the user terminal associated with the target vehicle. The target value is used to indicate the total value that is less than the preset value.

[0007] In some implementations, determining the total generation value of each vacant parking space based on the first-generation value and the second-generation value corresponding to each vacant parking space includes: Determine the correction parameters for the vacant parking space, wherein the correction parameters include at least one of the penalty parameters and reward parameters for the vacant parking space; The total generation value of the vacant parking space is determined based on the first-generation value, the second-generation value, and the correction parameter.

[0008] In some implementations, the correction parameter includes a penalty parameter, and the correction parameter for determining the vacant parking space includes: Obtain the historical occupancy probability of the available parking space and the popularity value of the destination; The penalty parameters for the vacant parking space are determined based on the historical occupancy probability and the popularity value.

[0009] In some implementations, the correction parameters include reward parameters, and the correction parameters for determining the vacant parking space include: Obtain the user profile information corresponding to the user associated with the target vehicle and the attribute information of the vacant parking space; The reward parameters for the vacant parking space are determined based on the matching degree between the attribute information and the user profile information.

[0010] In some implementations, after sending the location information of the available parking space corresponding to the minimum total value to the target vehicle or to the user terminal associated with the target vehicle, the method further includes: If the target vehicle is detected to have locked the target parking space, the travel time of the target vehicle to the target parking space and the parking time of the target vehicle are obtained, and the target parking space is used to indicate the available parking space selected by the user. Based on the reservation time of the user associated with the target vehicle for the destination, the driving time, and the parking time, determine the latest time for the target vehicle to arrive at the target parking space; Establish the binding relationship between the target parking space and the target vehicle; If the current time reaches the latest time and the target vehicle has not entered the target parking space, the binding relationship between the target parking space and the target vehicle is released.

[0011] In some implementations, after setting the binding relationship between the target parking space and the target vehicle, the method further includes: If the current time is later than the latest time and the target parking space is entered, the target parking space will be changed from an idle state to an occupied state.

[0012] In some implementations, determining the second-generation value of each of the vacant parking spaces includes: Obtain a three-dimensional spatial model containing the available parking spaces and the destination; Based on the three-dimensional spatial model, determine the horizontal and vertical paths of the user in the target vehicle; The second-generation value corresponding to the vacant parking space is determined based on the horizontal path and the vertical path.

[0013] Secondly, this application provides a parking space allocation device, including a memory and a processor, wherein, The memory is connected to the processor and is used to store programs; The processor is used to implement the parking space allocation method as described in the first aspect or any implementation thereof by running a program in the memory.

[0014] Thirdly, this application provides a computer program product, including computer instructions, which, when executed by a processor, implement the parking space allocation method as described in the first aspect or any implementation thereof.

[0015] Fourthly, this application provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the parking space allocation method as described in the first aspect or any implementation thereof.

[0016] This application provides a parking space allocation method and related equipment. It determines the first-generation value of an available parking space in a parking lot associated with a target vehicle's current location, and the second-generation value of a user's journey from an available parking space to their destination. Based on the first-generation and second-generation values ​​of the available parking spaces, a total generation value is determined. Location information of available parking spaces with a total generation value less than a preset value is sent to the target vehicle or a user terminal associated with the target vehicle. In this application, the total generation value representing the time cost for a user to reach their destination is determined by the generation value of the vehicle reaching the parking space and the generation value of the user's journey from the parking space. This allows for the push of information related to parking spaces with lower total generation values, ensuring that the time spent by the user to reach their destination from their current location is minimized, thus improving the accuracy of parking space allocation and enhancing the user experience. Attached Figure Description

[0017] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0018] Figure 1 A flowchart of a parking space allocation method provided in this application embodiment Figure 1 .

[0019] Figure 2 A flowchart of a parking space allocation method provided in this application embodiment Figure 2 .

[0020] Figure 3 A flowchart of a parking space allocation method provided in this application embodiment Figure 3 .

[0021] Figure 4 A flowchart of a parking space allocation method provided in this application embodiment Figure 4 .

[0022] Figure 5 This is a schematic diagram of the functional modules of a parking space allocation device provided in an embodiment of this application.

[0023] Figure 6 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0024] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0025] It should be noted that the user information (including but not limited to electrical equipment information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties. Furthermore, the collection, use and processing of the relevant data must comply with relevant laws, regulations and standards, and corresponding operation entry points are provided for users to choose to authorize or refuse.

[0026] As people's living standards improve, vehicles have become an indispensable means of transportation for daily travel. In areas with high pedestrian traffic, such as hospitals, users need to spend a lot of time searching for parking spaces nearby or within the area.

[0027] In the exemplary technology, users can make reservations at their destination through the parking system, which then recommends suitable parking spaces to the user.

[0028] However, after parking in the recommended parking space, users may need to navigate within the space, resulting in a longer walking time. This leads to lower accuracy in parking space recommendations and a poor user experience.

[0029] Furthermore, it is unable to identify and prioritize parking spaces near elevators and accessible pathways for users with special needs (such as wheelchairs, stretchers, and pregnant women).

[0030] In addition, the inability to dynamically adjust the resource allocation of each parking area based on the flow of people at the destination and the reservation time slots results in some areas being congested while others are vacant.

[0031] To address the above problems, this application provides a parking space allocation method. The following detailed description of the parking space allocation method proposed in this application is provided through various embodiments.

[0032] Reference Figure 1 , Figure 1 A flowchart of a parking space allocation method provided in this application embodiment Figure 1 .like Figure 1 As shown, the parking space allocation method provided in this embodiment includes: Step S101: Determine the first-generation value of the available parking space in the parking lot associated with the target vehicle's journey from its current location to its destination, and determine the second-generation value of the user in the target vehicle's journey from the available parking space to its destination.

[0033] In this embodiment, the executing entity is a parking space allocation device. For ease of description, the term "device" will be used to refer to the parking space allocation device below. The device can be a terminal device or server with parking space allocation functionality, and it is communicatively connected to equipment in the parking lot. The equipment in the parking lot reports the status of parking spaces to the device, including both vacant and occupied status. The device can be an edge node within the parking lot. The edge node uses Kalman filtering to fuse the results of parking space status detected by geomagnetic, video, and ultrasonic sensors, improving the accuracy of parking space status judgment (accuracy > 99.5%). For example, if the video detects a car but the geomagnetic field remains unchanged, Kalman filtering gives the video a higher confidence level.

[0034] When a user needs to travel to a location, they run a reservation program on their user terminal and enter their destination in the corresponding interface. The user terminal communicates with the device through the reservation program, obtains its own location as its current location, and generates a parking space allocation request based on the current location and destination. The user terminal then sends the parking space allocation request to the device. Furthermore, if the user needs to go to a hospital, the system retrieves the patient's (user's) registration department, appointment timestamp, and doctor's schedule from the hospital system in real time, allowing the user to make an accurate appointment on their user terminal.

[0035] After receiving a parking space allocation request, the device parses the request to determine its current location and destination. Once the destination is determined, the device searches for parking lots near the destination and, based on the stored parking space status, identifies available parking spaces. These available spaces are defined as vacant. There can be multiple vacant parking spaces. After identifying vacant spaces, the device determines the cost for the target vehicle to travel from its current location to each vacant space. This cost is defined as the first-generation value, which refers to the time cost required for the target vehicle to reach the vacant space. The higher the time cost, the higher the first-generation value.

[0036] Specifically, after determining the destination, the device extracts an electronic map and identifies parking lots within the destination's radius as associated parking lots. For example, parking lots within a 500-meter radius of the destination are considered as associated parking lots. After identifying parking lots, the device determines available spaces based on their availability and plans a driving route from the current location to an available space for the target vehicle using the electronic map. The target vehicle refers to the user's vehicle; that is, when the user reserves a parking space, it is assumed that the user will be driving to the destination. The planned route can be the shortest route, meaning the target vehicle can reach the available parking space from its current location as quickly as possible. For example, the device plans multiple routes for the target vehicle, each starting at the current location and ending at the destination. By analyzing the road conditions and route length within the user's reserved parking space timeframe, the time required for the target vehicle to reach the available parking space using that route can be determined, and the shortest route is selected as the final route.

[0037] After determining the final path, the first-generation value is determined based on the time required for that path. The longer the path takes, the greater the first-generation value; that is, the time required for the final path is positively correlated with the first-generation cost value. For example, the first-generation value refers to the macroscopic accessibility cost, indicating the cost for a user to reach an available parking space from their current location. For example, the first-generation cost value is: ;in, This refers to starting from the user's current location. Drive to an empty parking space Estimated time This refers to the entry congestion coefficient of a parking lot. Based on data such as the historical queue length and the current number of vehicles in the queue at the parking lot entrance, the waiting time can be obtained by inputting it into the prediction model. The entry congestion coefficient is determined by the waiting time, and the longer the waiting time, the greater the entry congestion coefficient. These are the weighting coefficients.

[0038] After determining the first path, the device determines the second-generation value of the user's journey from the vacant parking space to the destination. This second-generation value represents the time or distance cost of traveling from the vacant parking space to the destination. The destination can be a specific address, room, or store. For example, if a user needs to go to a hospital, the input location could be "xx hospital xx department," where "xx department" is the destination. Therefore, the device also needs to plan the path from the vacant parking space to the "xx department." For instance, the device uses an internal map of the parking lot containing the vacant parking space to determine the path to the destination. Based on the user's walking speed, it determines the time required for the user to travel from the vacant parking space to the destination, and uses this time to determine the second-generation value. The longer the time, the greater the second-generation value. The walking speed is determined based on the type of destination. For example, if the destination is a hospital and the user is a patient or a patient's family member, the walking speed determined by the device will be lower than the normal walking speed. If the destination is a store in a shopping mall, the walking speed determined by the device will be the normal walking speed, which is a preset value.

[0039] Step S102: Determine the total generation value of each vacant parking space based on the first generation value and the second generation value corresponding to each vacant parking space. The total generation value is used to represent the time cost for the user to reach the destination.

[0040] After determining the first-generation and second-generation values ​​of vacant parking spaces, the total generation value of the vacant parking spaces is determined based on these values. For example, the sum of the first-generation and second-generation values ​​is the total generation value. The total generation value represents the time cost for a user to reach their destination from their current location; the greater the time cost, the greater the total generation value.

[0041] Step S103: The location information of the available parking space corresponding to the target value is sent to the target vehicle or to the user terminal associated with the target vehicle. The target value is used to indicate the total value that is less than the preset value.

[0042] After determining the total value of the parking space, the device identifies a target value from the total values ​​of all available parking spaces. It then sends the location information of the available parking space corresponding to the target value to the target vehicle or its associated user terminal. This allows the user to drive the target vehicle to the available parking space based on the location information and proceed to their destination. The target value refers to the total value of the parking space, which is less than a preset value. Alternatively, the target value refers to the minimum total value among all total values ​​that are less than a preset value.

[0043] In one example, the location information includes the specific location of the available parking space. Additionally, the location information may include the planned route from the target vehicle to the available parking space (i.e., the final route mentioned above), the route from the available parking space to the destination, etc. If the user sends a parking space allocation request through a user terminal, the location information is sent to the user terminal; if the user sends a parking space allocation request through an in-vehicle terminal, the location information is sent to the target vehicle.

[0044] In this embodiment, the first-generation value of a target vehicle's journey from its current location to an available parking space in a parking lot associated with its destination is determined, and the second-generation value of a user's journey from an available parking space to their destination is also determined. Based on the first-generation and second-generation values ​​corresponding to the available parking spaces, the total generation value of the available parking spaces is determined. The location information of available parking spaces with a total generation value less than a preset generation value is sent to the target vehicle or the user terminal associated with the target vehicle. In this embodiment, the total generation value representing the time cost for the user to reach their destination is determined by the generation value of the vehicle reaching the parking space and the generation value of the user's journey from the parking space to their destination. This allows for the push of information related to parking spaces with lower total generation values ​​representing lower time costs, ensuring that the time spent by the user to reach their destination from their current location is minimized, thus improving the accuracy of parking space recommendations and enhancing the user experience.

[0045] Reference Figure 2 , Figure 2 A flowchart of a parking space allocation method provided in this application embodiment Figure 2 ,based on Figure 1 In the embodiment shown, step S102 includes: Step S201: Determine the correction parameters for vacant parking spaces. The correction parameters include at least one of the penalty parameters and reward parameters for vacant parking spaces.

[0046] In this embodiment, when it is necessary to determine the total value of vacant parking spaces, a correction parameter for the vacant parking spaces is determined. The correction parameter includes at least one of a reward parameter and a penalty parameter. The penalty parameter can be a spatiotemporal heat penalty parameter, which is determined by the heat of the vacant parking space or the probability of it being occupied.

[0047] In one example, the correction parameters include a penalty parameter, which is a set value, meaning the device uses the set value as the value of the penalty parameter.

[0048] In another example, the correction parameters include penalty parameters. The historical probability of vacant parking spaces being occupied and the destination's popularity value are obtained. The penalty parameter for vacant parking spaces is determined based on the historical probability of occupancy and the popularity value. For example, the penalty parameter is calculated by weighting the historical probability of occupancy, its corresponding weight, the popularity value, and the weight corresponding to the popularity value. For instance, the device obtains historical reservation information and historical status of vacant parking spaces to determine the target number of times a vehicle not reserved for that space will occupy it within the agreed time period in the historical reservation information. The historical probability of occupancy is determined by the ratio of the target number to the number of historical reservations (representing the total number of historical reservations). The popularity value is determined by the historical number of times vacant parking spaces have been occupied; the higher the historical number of occupancy, the higher the popularity value. For instance, the penalty parameter is: , For parking spaces By analyzing historical data on the probability of parking spaces being occupied at time t, parking spaces in popular areas are assigned higher "popularity" values ​​as a penalty, thus guiding users to park more dispersedly. For position If the patient visit frequency is high at time t, and the location is the pediatrics department, and the pediatrics department has a high frequency of visits between 9-11 am, then the parking area near that department will have an increased penalty coefficient. These are the weighting coefficients.

[0049] The reward parameter is the user-parking space matching reward parameter, which refers to the degree of matching between users and parking spaces. The higher the matching degree, the greater the cost reduction.

[0050] In one example, the correction parameters include a reward parameter, which is a preset value, and the device uses the preset value as the corresponding value of the reward parameter.

[0051] In another example, the adjustment parameters include reward parameters. The device obtains user profile information corresponding to the user associated with the target vehicle and attribute information of the available parking space. Based on the matching degree between the attribute information and the user profile information, it determines the reward parameter for the available parking space, with a higher matching degree resulting in a larger reward parameter. For example, the user profile U includes a series of tags, such as user type, parking credit limit, etc., and parking space attributes... Includes: whether it is applicable to special groups, whether it is near an elevator, etc. Function It is an indicator function that returns 1 when the user's k-th profile matches the parking space's k-th attribute, and 0 otherwise. This assigns reward weights to different labels. Higher matching degrees result in larger reward parameters, more value subtracted from the total cost, and ultimately lower cost. For example, the reward function is: 。

[0052] Furthermore, user profile information can be constructed by using users' active choices or historical behaviors on their devices to create user status tags, which can then be used as user profile information. For example, if a user clicks on "pregnancy mode" or "wheelchair mode," the user's status is that of a special needs person; similarly, if historical behavior includes frequently using accessible parking spaces, the user's status is also that of a special needs person.

[0053] Step S202: Determine the total generation value of the vacant parking space based on the first generation value, the second generation value, and the correction parameters corresponding to the vacant parking space.

[0054] After obtaining the correction parameters, the total generation value of the vacant parking space is determined based on the first generation value, the second generation value, and the correction parameters.

[0055] For example, when the adjustment parameters include both penalty and reward parameters, the total cost value is: ;in, , For second-generation value, Penalty function; For reward parameters; These are the weighting coefficients.

[0056] In this embodiment, the first-generation value and second-generation value of vacant parking spaces are corrected by adjusting the parameters of vacant parking spaces, thereby accurately obtaining the total generation value of vacant parking spaces.

[0057] Figure 3 A flowchart of a parking space allocation method provided in this application embodiment Figure 3 ,based on Figure 1 or Figure 2 In the embodiment shown, after step S103, the method further includes: Step S301: If the target vehicle is detected to have locked the target parking space, the travel time of the target vehicle to the target parking space and the parking time of the target vehicle are obtained. The target parking space is used to indicate the available parking space selected by the user.

[0058] In this embodiment, after the device sends location information to the target vehicle or user terminal, the user can select a target parking space. For example, the device sends the location information of multiple parking spaces corresponding to target prices to the user terminal. The user selects any available parking space corresponding to any location information on the user terminal as the target parking space; that is, the target parking space is the available parking space selected by the user from the various available parking spaces pushed to the user. After the user selects the target parking space, the device needs to lock the target parking space to prevent others from occupying it. To this end, when the device detects a lock request sent by the user through the user terminal, it extracts the target parking space selected by the user from the lock request. The lock request refers to the request of the target vehicle to lock the target parking space. The device obtains the travel time of the target vehicle to the target parking space and the parking time of the target vehicle. For example, the device obtains the path of the target vehicle to the target parking space and determines the travel time based on the path length and the road conditions during the reserved time period; the parking time is a preset value, which is an empirical value.

[0059] Step S302: Determine the latest time for the target vehicle to arrive at the target parking space based on the reservation time, travel time, and parking time of the user associated with the target vehicle.

[0060] After obtaining the walking time and parking time, the latest arrival time of the target vehicle at the target parking space can be determined based on the reservation time, driving time, and parking time of the target vehicle. For example, the latest time = reservation time + driving time + parking time + fluctuation time, where the fluctuation time is an empirical value, such as 15 minutes.

[0061] Step S303: Set the binding relationship between the target parking space and the target vehicle.

[0062] After the user sends a lock request to the device, the device establishes a binding relationship between the target parking space and the target parking space. For example, the binding relationship can be established by binding the ID of the target parking space with the device identifier of the target vehicle. Step S304: If the current time reaches the latest time and the target vehicle has not entered the target parking space, the binding relationship between the target parking space and the target vehicle is released.

[0063] If the current time is the latest time, and the device does not detect that the target vehicle has not entered the target parking space, the binding relationship between the target parking space and the target vehicle needs to be released to free up the target parking space. If the current time is later than the latest time, and the device detects that the target vehicle has entered the target parking space, the target parking space will be changed from an idle state to an occupied state.

[0064] In this embodiment, after binding the user's selected parking space with the user's vehicle, if the user does not enter the selected parking space before the latest time, the binding between the parking space and the vehicle is released, thus preventing the parking space from being locked for an extended period when the user is not using it. Figure 4 A flowchart of a parking space allocation method provided in this application embodiment Figure 4 .based on Figures 1 to 3 In any of the embodiments shown, step 102 includes: Step S401: Obtain a three-dimensional spatial model containing available parking spaces and destinations.

[0065] In this embodiment, the second-generation value can be the micro-accessibility cost, used to determine the total cost for a user to walk from an available parking space to their destination. To this end, the device acquires a three-dimensional spatial model containing the available parking space and the destination. The three-dimensional spatial model: An integrated model of the parking lot's interior and exterior spaces, located in the target parking space, is created using indoor GDF (Geographic Data Files) format. The three-dimensional spatial model includes: Nodes: Parking space center point, road intersection, elevator entrance, stairwell entrance, store or room entrance, POI (Point of Interest).

[0066] Edge: A passable path connecting nodes, containing attributes such as type (flat road, ramp), length, speed limit, and direction of travel.

[0067] Face: Department area, waiting area, parking area.

[0068] Level Connection: Connecting different floors through elevators and staircases.

[0069] Step S402: Based on the three-dimensional spatial model, determine the horizontal and vertical paths of the user in the target vehicle.

[0070] Step S403: Determine the second-generation value corresponding to the vacant parking space based on the horizontal and vertical paths.

[0071] After obtaining the 3D spatial model, the horizontal and vertical paths of the user in the target vehicle are determined from the 3D spatial model. For example, the horizontal path can be calculated by combining the real-time pedestrian congestion situation (obtained through video analysis) on the floor where the target parking space is located to find the optimal path from the target parking space to the nearest elevator.

[0072] Vertical paths include cross-floor paths and intra-floor paths. Cross-floor paths refer to the path from the current floor to the destination floor. The walking time for cross-floor paths can be estimated by using the elevator's real-time status (current floor, direction of travel) to predict waiting and riding times. Intra-floor paths are located on the destination floor. The walking time for intra-floor paths can be calculated by using the optimal path from the elevator to the destination entrance.

[0073] After determining the horizontal and vertical paths, the second-generation value of vacant parking spaces is determined using the horizontal and vertical paths.

[0074] For example, the second cost value is; ,in, This refers to the travel time of the target vehicle from the entrance to the target parking space. Due to the complexity of the road network within the parking lot, this travel time needs to be considered as a factor in calculating the second cost value. ; in, Let be the length of the i-th road segment on the path. The real-time traffic speed of this section of road is calculated by inversely estimating traffic flow data obtained from geomagnetic or video sensors. This represents the estimated waiting time for the j-th intersection or speed bump on the path. The walking route is divided into two segments based on the user's walking time: , From the parking space Walk to the nearest vertical transportation node (elevator / stairwell). The time taken is the walking time of the horizontal path. The length of the horizontal path is based on the detailed vector map of the parking lot, and the algorithm is used to find the way and calculate the distance, which is then multiplied by the average walking speed (1.2m / s). From vertical transportation nodes Take the elevator or walk to your destination Entry time refers to the user's walking time along the vertical path, including elevator waiting time. and time spent riding and climbing ; Based on the elevator's current floor and direction of travel, predictions are made using an elevator operation status model; Floor difference Multiply by the average passage time per layer, where γ and δ are weighting coefficients.

[0075] In this embodiment, the device determines the user's horizontal and vertical paths based on a three-dimensional spatial model of the vacant parking space and the destination, thereby accurately determining the second-generation value corresponding to the vacant parking space based on the horizontal and vertical paths.

[0076] Based on the above embodiments, the parking space allocation method of this application will be illustrated by example: Scenario: Ms. Zhang, a pregnant woman at 32 weeks gestation, has booked a prenatal checkup at the obstetrics department of XX Hospital at 10:30 AM. She opens the app, sets XX Hospital as her destination, and the device, based on Ms. Zhang's authorization, automatically recognizes her past behavior and pops up a prompt: "Special needs detected. Do you want to activate Pregnancy Mode?" Ms. Zhang clicks to confirm.

[0077] 9:00: Ms. Zhang departs from home. Based on real-time traffic data, the device estimates that she will arrive at the hospital at 9:45.

[0078] 9:30: The device begins background calculations of the heat factor near the obstetrics ward (located on the 3rd floor of Building 2). The system reached 0.8. The system detected that accessible parking space P23 on level B3 is closest to the dedicated elevator to Building 2, and is currently vacant; although level B3 is relatively deep, considering... and Reward, P23 The value is much lower than that of a regular parking space on the ground.

[0079] 9:40: Five minutes before arriving at the hospital, the device sent a notification: "A barrier-free parking space, P23 on floor B3, has been reserved for you. It is closest to the maternity ward. Please check." Ms. Zhang clicked to confirm, and the parking space was locked until 10:00.

[0080] 9:48: Ms. Zhang arrived at the hospital's B3 entrance, and the gate automatically recognized her license plate and allowed her to pass. The car's navigation system guided her to P23.

[0081] 9:52: After Ms. Zhang parked her car, the device sent a message to her mobile phone, causing the mobile app to automatically switch to AR pedestrian navigation. The arrows on the ground clearly guided her to the private elevator, and the device output a prompt message to the mobile phone, such as: "Elevator waiting time: approximately 20 seconds".

[0082] 9:55: Ms. Zhang arrived at the obstetrics waiting area and waited for her number to be called.

[0083] Based on the above examples and embodiments, this application has the following advantages over exemplary technologies:

[0084] Corresponding to the above-described parking space allocation method, this application also provides a parking space allocation device. Figure 5 This is a schematic diagram of a parking space allocation device provided in an embodiment of this application. The parking space allocation device 500 provided in this embodiment includes: The first determining module 510 is used to determine the first generation value of the available parking space in the parking lot associated with the target vehicle from its current location to its destination, and to determine the second generation value of the user in the target vehicle from the available parking space to its destination. The second determination module 510 is used to determine the total generation value of each vacant parking space based on the first generation value and the second generation value corresponding to each vacant parking space. The total generation value is used to represent the time cost for the user to reach the destination. The sending module 530 is used to send the location information of the available parking space corresponding to the target value to the target vehicle or to the user terminal associated with the target vehicle. The target value is used to indicate the total value that is less than the preset value.

[0085] In some implementations, the parking space allocation device 500 is also used for: Determine the correction parameters for vacant parking spaces, including at least one of the penalty parameters and reward parameters for vacant parking spaces; The total generation value of the vacant parking space is determined based on the first-generation value, the second-generation value, and the correction parameters.

[0086] In some implementations, the parking space allocation device 500 is also used for: Obtain the historical probability of vacant parking spaces being occupied and the popularity value of the destination; The penalty parameters for vacant parking spaces are determined based on historical occupancy probabilities and popularity values.

[0087] In some implementations, the parking space allocation device 500 is also used for: Obtain the user profile information of the user associated with the target vehicle and the attribute information of the available parking spaces; The reward parameters for vacant parking spaces are determined based on the matching degree between attribute information and user profile information.

[0088] In some implementations, the parking space allocation device 500 is also used for: If the target vehicle is detected to have locked the target parking space, the travel time from the target vehicle to the target parking space and the parking time of the target vehicle are obtained. The target parking space is used to indicate the available parking space selected by the user. Based on the user's reservation time for the destination, travel time, and parking time associated with the target vehicle, determine the latest time for the target vehicle to arrive at the target parking space. Set the binding relationship between the target parking space and the target vehicle; If the current time reaches the latest time and the target vehicle has not entered the target parking space, the binding relationship between the target parking space and the target vehicle will be released.

[0089] In some implementations, the parking space allocation device 500 is also used for: If the current time is later than the latest time and the target parking space is entered, the target parking space will be changed from an vacant state to an occupied state.

[0090] In some implementations, the parking space allocation device 500 is also used for: Obtain a 3D spatial model containing available parking spaces and destinations; Based on the three-dimensional spatial model, determine the horizontal and vertical paths of the users in the target vehicle; Determine the second-generation value corresponding to the vacant parking space based on the horizontal and vertical paths.

[0091] The parking space allocation device and the parking space allocation method provided in the above embodiments of this application belong to the same application concept and can execute the parking space allocation method provided in any of the above embodiments of this application. They have the corresponding functional modules and beneficial effects for executing the parking space allocation method. Technical details not described in detail in this embodiment can be found in the specific processing content of the parking space allocation method provided in the above embodiments of this application, and will not be repeated here.

[0092] The functions of each module in the parking space allocation device can be implemented by the same or different processors, and this application embodiment does not limit this.

[0093] It should be understood that the modules in the above parking space allocation device can be implemented by a processor calling firmware. For example, the system includes a processor connected to a memory containing instructions. The processor calls the instructions stored in the memory to implement any of the above methods or to implement the functions of each module of the device. The processor can be a general-purpose processor, such as a CPU or microprocessor, and the memory can be internal to the device or external to the system. Alternatively, the modules in the system can be implemented as hardware circuits. By designing the hardware circuits, some or all of the module functions can be implemented. The hardware circuit can be understood as one or more processors. For example, in one implementation, the hardware circuit is an ASIC, and the functions of some or all of the above modules are implemented by designing the logical relationships between the components within the circuit. In another implementation, the hardware circuit can be implemented by a PLD, such as an FPGA, which can include a large number of logic gates. The connection relationships between the logic gates are configured through a configuration file, thereby implementing the functions of some or all of the above modules. All modules of the above parking space allocation device can be implemented entirely by a processor calling firmware, or entirely by hardware circuits, or partially by a processor calling firmware with the remaining parts implemented by hardware circuits.

[0094] In this application embodiment, a processor is a circuit with signal processing capabilities. In one implementation, the processor can be a circuit with instruction reading and execution capabilities, such as a CPU, microprocessor, GPU, or DSP. In another implementation, the processor can implement certain functions through the logical relationships of hardware circuits. These logical relationships are fixed or reconfigurable. For example, the processor may be a hardware circuit implemented as an ASIC or PLD, such as an FPGA. In a reconfigurable hardware circuit, the process of the processor loading a configuration document and configuring the hardware circuit can be understood as the processor loading instructions to implement the functions of some or all of the above modules. Furthermore, it can also be a hardware circuit designed for artificial intelligence, which can be understood as an ASIC, such as an NPU, TPU, or DPU.

[0095] As can be seen, each module in the above parking space allocation device can be one or more processors (or processing circuits) configured to implement the above method, such as: CPU, GPU, NPU, TPU, DPU, microprocessor, DSP, ASIC, FPGA, or a combination of at least two of these processor types.

[0096] Furthermore, the modules in the above parking space allocation device can be integrated in whole or in part, or they can be implemented independently. In one implementation, these modules are integrated together and implemented in the form of a System-on-Chip (SoC). The SoC may include at least one processor for implementing any of the above methods or implementing the functions of the modules of the device. The at least one processor can be of different types, such as CPU and FPGA, CPU and artificial intelligence processor, CPU and GPU, etc.

[0097] This application provides a schematic diagram of the structure of an electronic device, see [link]. Figure 6 As shown, the electronic device includes a memory 600 and a processor 610; wherein the memory 600 is connected to the processor 610 and is used to store programs; the processor 610 is used to implement the electronic device prompt sound generation method disclosed in any of the above embodiments by running the programs stored in the memory 600.

[0098] Specifically, the aforementioned electronic device may further include: a bus, a communication interface 620, an input device 630, and an output device 640. The electronic device may also include a data transceiver module, an image monitoring module, and a signal monitoring module.

[0099] The processor 610, memory 600, communication interface 620, input device 630, and output device 640 are interconnected via a bus. Among them: A bus can include a pathway for transmitting information between various components in an electronic device.

[0100] The processor 610 can be a general-purpose processor, such as a general-purpose central processing unit (CPU), a microprocessor, etc., or an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of the program of the present invention. It can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0101] The processor 610 may include a main processor, as well as a baseband chip, modem, etc.

[0102] The memory 600 stores a program that executes the technical solution of this invention, and may also store an operating system and other key business functions. Specifically, the program may include program code, which includes computer operation instructions. More specifically, the memory 600 may include read-only memory (ROM), other types of static storage devices capable of storing static information and instructions, random access memory (RAM), other types of dynamic storage devices capable of storing information and instructions, disk storage, flash memory, etc.

[0103] Input device 630 may include a device for receiving user input data and information, such as a keyboard, mouse, camera, scanner, light pen, voice input device, touch screen, pedometer, or gravity sensor.

[0104] Output device 640 may include devices that allow information to be output to a user, such as a display screen, printer, speaker, etc.

[0105] The communication interface 620 may include a device that uses any transceiver to communicate with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), Wireless Local Area Network (WLAN), etc.

[0106] The processor 610 executes the program stored in the memory 600 and calls other devices, and can be used to implement the various steps of any of the electronic device prompt tone generation methods provided in the above embodiments of this application.

[0107] It should be noted that the electronic device can be an in-vehicle terminal, a mobile phone, a wearable device, or a server, etc.; or it can be a vehicle that includes an in-vehicle terminal, etc.

[0108] This application also proposes a chip, which includes a processor and a data interface. The processor reads and runs a program stored in the memory through the data interface to execute the electronic device prompt sound generation method described in any of the above embodiments. For the specific processing procedure and its beneficial effects, please refer to the above embodiments of the electronic device prompt sound generation method.

[0109] In addition to the methods and devices described above, embodiments of this application may also be computer program products, which include computer program instructions that, when executed by a processor, cause the processor to perform the steps in the parking space allocation methods according to various embodiments of this application as described in any of the above embodiments of this specification.

[0110] Computer program products can be written in any combination of one or more programming languages ​​to perform the operations of the embodiments of this application. The programming languages ​​include object-oriented programming languages ​​such as Java and C++, as well as conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computing device, partially on the power device, as a standalone firmware package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0111] Furthermore, embodiments of this application may also be storage media storing computer programs, which are executed by a processor to perform the steps of the parking space allocation method according to various embodiments of this application described in any of the above embodiments of this specification, specifically implementing the steps of the above parking space allocation method.

[0112] For the foregoing method embodiments, in order to simplify the description, they are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, because according to this application, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0113] It should be noted that the various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For apparatus embodiments, since they are basically similar to method embodiments, the description is relatively simple; relevant parts can be referred to the descriptions in the method embodiments.

[0114] The steps in the methods of the various embodiments of this application can be adjusted, merged, or deleted in order according to actual needs, and the technical features described in each embodiment can be replaced or combined.

[0115] The units of the apparatus in the various embodiments of this application can be merged, divided, and deleted according to actual needs.

[0116] It should be understood that the disclosed terminals, devices, and methods can be implemented in other ways, given the several embodiments provided in this application. For example, the terminal embodiments described above are merely illustrative. For instance, the division of modules or sub-modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple sub-modules or modules may be combined or integrated into another module, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, devices, or modules, and may be electrical, mechanical, or other forms.

[0117] The modules or submodules described as separate components may or may not be physically separate. The components that constitute a module or submodule may or may not be physical modules or submodules; that is, they may be located in one place or distributed across multiple network modules or submodules. Some or all of the modules or submodules can be selected to achieve the purpose of this embodiment's solution, depending on actual needs.

[0118] Furthermore, the functional modules or sub-modules in the various embodiments of this application can be integrated into one processing module, or each module or sub-module can exist physically separately, or two or more modules or sub-modules can be integrated into one module. The integrated modules or sub-modules described above can be implemented in hardware or as firmware functional modules or sub-modules.

[0119] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer firmware, or a combination of both. To clearly illustrate the interchangeability of hardware and firmware, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or firmware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0120] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein can be implemented directly using hardware, firmware units executed by a processor, or a combination of both. The firmware unit can be located in random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0121] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes the element.

[0122] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A parking space allocation method, characterized in that, include: Determine the first-generation value of the available parking space in the parking lot associated with the target vehicle's journey from its current location to its destination, and determine the second-generation value of the user in the target vehicle's journey from the available parking space to the destination. Based on the first-generation value and the second-generation value corresponding to each of the vacant parking spaces, the total generation value of each vacant parking space is determined, and the total generation value is used to characterize the time cost for the user to reach the destination; The location information of the available parking space corresponding to the target value is sent to the target vehicle or to the user terminal associated with the target vehicle. The target value is used to indicate the total value that is less than the preset value.

2. The parking space allocation method according to claim 1, characterized in that, The step of determining the total generation value of each vacant parking space based on the first-generation value and the second-generation value corresponding to each vacant parking space includes: Determine the correction parameters for the vacant parking space, wherein the correction parameters include at least one of the penalty parameters and reward parameters for the vacant parking space; The total generation value of the vacant parking space is determined based on the first-generation value, the second-generation value, and the correction parameter.

3. The parking space allocation method according to claim 2, characterized in that, The correction parameters include penalty parameters, and the correction parameters for determining the vacant parking space include: Obtain the historical occupancy probability of the available parking space and the popularity value of the destination; The penalty parameters for the vacant parking space are determined based on the historical occupancy probability and the popularity value.

4. The parking space allocation method according to claim 2, characterized in that, The correction parameters include reward parameters, and the correction parameters for determining the available parking spaces include: Obtain the user profile information corresponding to the user associated with the target vehicle and the attribute information of the vacant parking space; The reward parameters for the vacant parking space are determined based on the matching degree between the attribute information and the user profile information.

5. The parking space allocation method according to claim 1, characterized in that, After sending the location information of the available parking space corresponding to the minimum total value to the target vehicle or to the user terminal associated with the target vehicle, the method further includes: If the target vehicle is detected to have locked the target parking space, the travel time of the target vehicle to the target parking space and the parking time of the target vehicle are obtained, and the target parking space is used to indicate the available parking space selected by the user. Based on the reservation time of the user associated with the target vehicle for the destination, the driving time, and the parking time, determine the latest time for the target vehicle to arrive at the target parking space; Establish the binding relationship between the target parking space and the target vehicle; If the current time reaches the latest time and the target vehicle has not entered the target parking space, the binding relationship between the target parking space and the target vehicle is released.

6. The parking space allocation method according to claim 5, characterized in that, After setting the binding relationship between the target parking space and the target vehicle, the method further includes: If the current time is later than the latest time and the target parking space is entered, the target parking space will be changed from an idle state to an occupied state.

7. The parking space allocation method according to claim 1, characterized in that, Determining the second-generation value of each of the vacant parking spaces includes: Obtain a three-dimensional spatial model containing the available parking spaces and the destination; Based on the three-dimensional spatial model, determine the horizontal and vertical paths of the user in the target vehicle; The second-generation value corresponding to the vacant parking space is determined based on the horizontal path and the vertical path.

8. A parking space allocation device, characterized in that, Including memory and processor, among which, The memory is connected to the processor and is used to store programs; The processor is used to implement the parking space allocation method as described in any one of claims 1-7 by running the program in the memory.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, which, when executed by a processor, implements the parking space allocation method as described in any one of claims 1-7.

10. A computer program product, characterized in that, It includes computer instructions that, when executed by a processor, implement the parking space allocation method as described in any one of claims 1-7.

Images