US-12626593-B2 - IoV based parking system and parking method

US12626593B2US 12626593 B2US12626593 B2US 12626593B2US-12626593-B2

Abstract

An Internet of Vehicles (IoV) based parking system includes an information transceiver module configured to communicate with vehicles parked in a target parking area to receive reference departure times sent by the vehicles, and to communicate with a user vehicle to be parked in the target parking area to receive expected departure time sent by the user vehicle; and a planning module configured to compare the expected departure time of the user vehicle to be parked in the target parking area with each of the reference departure times of the vehicles parked in the target parking area, and to plan a parking area for the user vehicle. The present disclosure also provides an IoV based parking method.

Inventors

Qiyun ZENG

Assignees

SHENYANG ONE DRIVE TECHNOLOGY CO., LTD.

Dates

Publication Date: 20260512
Application Date: 20211223
Priority Date: 20211118

Claims (16)

1 . An Internet of Vehicles (IoV) based parking system, comprising: a processor storing a computer program; and a memory coupled with the processor, wherein when being executed by the processor, the computer program causes the processor to: communicate with vehicles parked in a target parking area to receive reference departure times sent by the vehicles, and to communicate with a user vehicle to be parked in the target parking area to receive expected departure time sent by the user vehicle; store in a storage device parking area floor plans of the target parking area, the reference departure times of the vehicles parked in the target parking area, and the expected departure time of the user vehicle; based on the parking area floor plans stored in the storage device, divide a road access area next to line-marked parking spaces in the target parking area into spots; calculate a usage weight for each of the spots; based on the usage weight, determine whether each spot is a non-marked parking space; and compare the expected departure time of the user vehicle to be parked in the target parking area with each of the reference departure times of the vehicles parked in the target parking area, and determine a parking space among the line-marked parking spaces and the non-marked parking spaces in the target parking area for the user vehicle.
2 . The parking system according to claim 1 , wherein the processor is further configured to: based on the number of times entry/exit route for each line-marked parking space passes through the corresponding spot, determine the usage weight of each spot, the usage weight of each spot increasing as the number of times the entry/exit route passes through the corresponding spot increases.
3 . The parking system according to claim 2 , wherein the processor is further configured to: reduce a recommendation index for recommending the spot as the non-marked parking space as the usage weight of the corresponding spot increases.
4 . An Internet of Vehicles (IoV) based parking method, comprising: receiving reference departure times of vehicles parked in a target parking area sent by terminals of the vehicles parked in the target parking area; receiving expected departure time sent by a terminal of a user vehicle to be parked in the target parking area; storing in a storage device parking area floor plans of the target parking area, the reference departure times of the vehicles parked in the target parking area, and the expected departure time of the user vehicle; based on the parking area floor plans stored in the storage device, dividing a road access area next to line-marked parking spaces in the target parking area into spots; calculating a usage weight for each of the spots: based on the usage weight, determining whether each spot is a non-marked parking space; and comparing the expected departure time of the user vehicle to be parked in the target parking area with each of the reference departure times of the vehicles parked in the target parking area, and determining a parking space among the line-marked parking spaces and the non-marked parking spaces in the target parking area for the user vehicle.
5 . The parking method according to claim 4 , wherein calculating the usage weight of each spot comprises: based on the number of times entry/exit route for each line-marked parking space passes through the corresponding spot, determining the usage weight of each spot, the usage weight of each spot increasing as the number of times the entry/exit route passes through the corresponding spot increases.
6 . The parking method according to claim 5 , further comprising: reducing a recommendation index for recommending the spot as the non-marked parking space as the usage weight of the corresponding spot increases.
7 . The parking method according to claim 5 , further comprising: sorting the reference departure times of the vehicles parked in the target parking area; and selecting spots near the line-marked parking spaces of parked vehicles whose reference departure times are later than the expected departure time of the user vehicle, and splicing/combining the spots whose usage weights are low as the non-marked parking area.
8 . The parking method according to claim 4 , further comprising: receiving the expected departure time of the user vehicle when the target parking area is a parking lot; and determining whether to recommend a line-marked parking space or a non-marked parking space as the parking space based on a comparison result between an estimated stay time and a time threshold, wherein the estimated stay time is calculated as a difference between the expected departure time and a current time.
9 . The parking method according to claim 8 , further comprising: in response to the estimated stay time being greater than the threshold time, determining an unoccupied line-marked parking space as the parking space; and in response to the estimated stay time being smaller than or equal to the threshold time, determining a non-marked parking space as the parking space.
10 . The parking method according to claim 9 , further comprising: determining the spot near the parking space of the vehicle whose reference departure time is later than the expected departure time as the non-marked parking space, and recommending the non-marked parking space as the parking space to the user vehicle.
11 . The parking method according to claim 10 , further comprising: in response to multiple non-marked parking spaces capable of being determined as the non-marked parking space, recommending the non-marked parking space with the lowest usage weight as the parking space.
12 . The parking method according to claim 8 , further comprising: in response to insufficient parking spaces in the target parking lot, comparing the expected departure time with reference departure time of each vehicle parked in the target parking area, and recommending the spot near the parking space of the vehicle whose reference departure time is later than the expected departure time as the parking space for the user vehicle.
13 . The parking method according to claim 10 , further comprising: when receiving a request from the parked vehicle blocked by the user vehicle, controlling the user vehicle to send a temporary vehicle key to the blocked parked vehicle.
14 . The parking method according to claim 13 , further comprising: when an owner of the blocked parked vehicle uses the temporary vehicle key, sending a permission transfer notification to an owner of the user vehicle.
15 . The parking method according to claim 4 , further comprising: when the target parking area is an unsupervised parking area, receiving the reference departure time of vehicles parked in the unsupervised parking area, which is sent by terminals of the vehicles parked in the unsupervised parking area; and selecting a spot near a parking space of a vehicle whose reference departure time is later than the expected departure time as the parking space, and sending information related to the parking space to a terminal of the user vehicle.
16 . An electronic device, comprising: a processor storing a computer program; and a memory coupled with the processor; wherein when being executed by the processor, the computer program causes the processor to: receive reference departure times of vehicles parked in a target parking area sent by terminals of the vehicles parked in the target parking area; receive expected departure time sent by a terminal of a user vehicle to be parked in the target parking area; store in a storage device parking area floor plans of the target parking area, the reference departure times of the vehicles parked in the target parking area, and the expected departure time of the user vehicle; based on the parking area floor plans stored in the storage device, divide a road access area next to line-marked parking spaces in the target parking area into spots; calculate a usage weight for each of the spots; based on the usage weight, determine whether each spot is a non-marked parking space; and compare the expected departure time of the user vehicle to be parked in the target parking area with each of the reference departure times of the vehicles parked in the target parking area, and determine a parking space among the line-marked parking spaces and the non-marked parking spaces in the target parking area for the user vehicle.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS This application is a national phase entry of PCT Patent Application No. PCT/CN2021/140819, filed on Dec. 23, 2021, which claims the priority of Chinese Patent Application No. 202111374929.7, filed on Nov. 18, 2021, the entire contents of all of which are incorporated herein by reference. TECHNICAL FIELD The present disclosure relates to the technical field of vehicle parking technology, and more particularly, to a parking system and a parking method based on Internet of Vehicles (IoV). BACKGROUND When parking spaces are in short supply, some vehicle owners park their cars in locations that block other vehicles from exiting. Under certain circumstance, a vehicle may temporarily park at a parking position blocking other vehicles, it would be nice to know whether the blocked vehicles need to leave sooner than the blocking vehicle and to avoid blocking any vehicle that will leave sooner. In addition, in certain informal venues, parking areas are not clearly divided into individual parking spaces, but are generally spaces for parking. For example, in some communities, large spaces are marked for temporary parking of vehicles between buildings. However, vehicles parked in these temporary parking spaces may block other parked vehicles from exiting. Therefore, it is necessary to know departure times of blocked vehicles in advance to avoid blocking these vehicles. SUMMARY To solve or at least partially solve the above problems, the present disclosure provides a parking mechanism based on the Internet of Vehicles (IoV), which reasonably arranges parking areas of vehicles by obtaining parking times of all vehicles, to avoid or reduce the subsequent need for the vehicle owner to move the vehicles after parking. One aspect of the present disclosure provides an Internet of Vehicles (IoV) based parking system. The parking system includes an information transceiver module configured to communicate with vehicles parked in a target parking area to receive reference departure times sent by the vehicles, and to communicate with a user vehicle to be parked in the target parking area to receive expected departure time sent by the user vehicle; and a planning module configured to compare the expected departure time of the user vehicle to be parked in the target parking area with each of the reference departure times of the vehicles parked in the target parking area, and to plan a parking area for the user vehicle. In some embodiments, the parking system further includes: a storage module configured to store parking area floor plans of the target parking area, the reference departure times of the vehicles parked in the target parking area, and the expected departure time of the user vehicle. In some embodiments, the planning module is further configured to: based on the parking area floor plans stored in the storage module, divide a road access area next to line-marked parking spaces in the target parking area into spots; calculate a usage weight for each of the spots; and based on the usage weight, determine whether each spot is a non-marked parking space. In some embodiments, the planning module is further configured to: based on the number of times entry/exit route for each line-marked parking space passes through the corresponding spot, determine the usage weight of each spot, the usage weight of each spot increasing as the number of times the entry/exit route passes through the corresponding spot increases. In some embodiments, the planning module is further configured to: reduce a recommendation index for recommending the spot as the non-marked parking space as the usage weight of the corresponding spot increases. In some embodiments, the planning module is further configured to: sort the reference departure times of the vehicles parked in the target parking area; and select spots near the line-marked parking spaces of the parked vehicles whose reference departure times are later than the expected departure time of the user vehicle, and splice/combine the spots whose usage weights are low as the non-marked parking area. In some embodiments, the information transceiver module is further configured to receive the expected departure time of the user vehicle when the target parking area is a parking lot; and the planning module is further configured to determine whether to recommend a line-marked parking spot or a non-marked spot as the parking area based on a comparison result between an estimated stay time and a time threshold, wherein the estimated stay time is calculated as a difference between the expected departure time and a current time. In some embodiments, in response to the estimated stay time being greater than the threshold time, the planning module is further configured to determine an unoccupied line-marked parking space as the parking area; and in response to the estimated stay time being smaller than or equal to the threshold time, the planning module is further configure