Parking space intelligent matching method and system based on Beidou navigation
Through the Beidou navigation system, the charging pile status is obtained and analyzed in real time, and the number of parking space changes and matching degrees are calculated, which solves the problem of low matching efficiency of electric vehicles before arriving at the charging space, achieving more efficient charging space matching and parking convenience.
Patent Information
- Application Number
- CN202410733676.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-07
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-06-07
AI Technical Summary
The prior art is difficult to effectively improve the efficiency of electric vehicles accurately matching charging spaces before arriving at the charging space, resulting in the problems of planning failure and unmet parking charging needs.
Using the intelligent matching method of parking spaces based on Beidou navigation, we can obtain the user's destination, determine the parking lot of nearby charging piles, obtain the charging pile status and navigation request information in real time, calculate the number of parking spaces changes during the expected arrival time period, match the number of parking spaces and charge Matching degree, intelligently match the optimal charging space.
It improves the accuracy and convenience of charging parking space matching, meets users' parking charging needs, and improves the intelligence of charging parking space matching.
Smart Images

Figure CN118538044B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of parking space matching, and in particular to a parking space intelligent matching method and system based on Beidou navigation. Background Art
[0002] With the development of electric vehicles and charging piles, charging parking spaces have become extremely scarce. When users need to park and charge before reaching their destination, they often search the map for charging parking spaces near the destination. However, when they arrive at the charging space, it may have been occupied by other vehicles, causing the plan to fail and unable to meet parking and charging needs.
[0003] The Beidou satellite navigation system has the characteristics of high-precision positioning and time synchronization. Among the related technologies, the combination of the fifth generation mobile communication technology (5G) and Beidou positioning and navigation technology can realize the real-time positioning of vehicles in ground and underground parking lots, vacancy detection, parking guidance and other functions, providing new possibilities for intelligent matching of charging parking spaces.
[0004] Therefore, in order to improve the efficiency of electric vehicles in finding charging piles, how to combine the Beidou navigation system with charging parking spaces and improve the accuracy of charging parking space matching has become an urgent problem to be solved. Summary of the invention
[0005] The present invention aims to provide a parking space intelligent matching method and system based on Beidou navigation, aiming to improve the intelligence level of charging parking space matching.
[0006] In order to achieve the above object, the present invention provides the following technical solutions:
[0007] In a first aspect, an embodiment of the present invention provides a parking space intelligent matching method based on Beidou navigation, the method comprising the following steps:
[0008] S100, obtaining a destination set by a user in a Beidou navigation-based map;
[0009] S200, determining multiple charging piles closest to the destination in the map, and respectively determining parking lots where the multiple charging piles are located, to obtain at least one parking lot; wherein the charging piles are arranged at charging parking spaces in the parking lot, and the location information of the charging piles is pre-marked in the map;
[0010] S300, determining a common path for the target vehicle to travel to each parking lot based on Beidou navigation, navigating the target vehicle according to the common path, and acquiring status information and navigation request information of all charging piles in each parking lot in real time; wherein the status information includes the usage status of the charging piles, and the usage status includes idle and occupied; and the navigation request information includes a navigation request with the parking lot as the starting point and the end point;
[0011] S400, for each parking lot, determining the expected arrival time of the target vehicle at the parking lot based on Beidou navigation, determining the charging pile search time period of the target vehicle at the parking lot based on the expected arrival time, and determining the number of parking spaces changed in the parking lot during the charging pile search time period based on the status information of all charging piles in the parking lot and the navigation request information; wherein the number of parking spaces changed is the number of vacant parking spaces changed during the charging pile search time period; and the vacant parking spaces are charging parking spaces where charging piles whose use status is vacant are located;
[0012] S500, when the distance between the current position of the target vehicle and the bifurcation point is less than a set distance threshold, the number of free parking spaces in each parking lot is obtained, and the number of matching parking spaces in the parking lot during the pole-seeking time period is determined based on the number of free parking spaces and the number of parking space changes in the parking lot; wherein the bifurcation point is the end point of the common path;
[0013] S600, determining the difference distance between each parking lot and the destination, determining the charging matching degree of the parking lot based on the number of matching parking spaces in the parking lot and the difference distance, sorting the parking lots according to the charging matching degree, obtaining the parking lot selected by the user, and using the vacant parking spaces in the parking lot as charging parking spaces matching the target vehicle.
[0014] Optionally, in S400, determining a charging pile search time period of the target vehicle in the parking lot based on the expected arrival time, and determining a number of parking space changes in the parking lot during the charging pile search time period based on status information of all charging piles in the parking lot and navigation request information, includes:
[0015] S410, for each parking lot, obtaining an expected arrival time of the target vehicle at the parking lot, determining a time period for seeking a pole when the target vehicle travels to the parking lot based on the expected arrival time, dividing the time period for seeking a pole into a plurality of sub-time periods, and determining time matching weights corresponding to the plurality of sub-time periods;
[0016] S420, obtaining status information of all charging piles in the parking lot, and determining the expected number of vacant parking spaces in the parking lot in each sub-time period based on the status information;
[0017] S430, determining the number of parking space changes in each sub-time period of the pole-seeking time period after the target vehicle drives to the parking lot based on the time matching weight of each sub-time period and the expected number of free parking spaces.
[0018] Optionally, in S410, determining a time period for seeking a pole when the target vehicle travels to the parking lot based on the expected arrival time, dividing the time period for seeking a pole into a plurality of sub-time periods, and determining time matching weights corresponding to the plurality of sub-time periods include:
[0019] S411, for each parking lot, determine the entrance and exit roads of the parking lot, determine the parking heat of the parking lot based on the congestion ratio of the entrance and exit roads, extend the expected arrival time of the target vehicle to the parking lot based on the parking heat, and obtain a pole-seeking time period including the expected arrival time; wherein the entrance and exit roads include an exit road and an entrance road connecting the entrance and exit of the parking lot, and the exit road and the entrance road both have multiple congestion levels, the value range of the congestion level is an integer from 1 to 4, and the value of the congestion level is positively correlated with the degree of congestion; the congestion ratio is the ratio of the congestion level of the entrance road to the congestion level of the exit road; the parking heat represents the expected change value of the number of vehicles in the parking lot;
[0020] S412, dividing the parking lot search time period into a plurality of sub-time periods, and setting a corresponding time matching weight for each sub-time period according to the expected arrival time and parking popularity; wherein the time matching weight decreases as the time distance increases.
[0021] Optionally, in S420, the acquiring status information of all charging piles in the parking lot, and determining the expected number of vacant parking spaces in the parking lot in each sub-time period based on the status information, includes:
[0022] S421, establishing a database, the database including the location information and status information of all charging piles in each parking lot; wherein the status information includes the usage status of the charging piles, the usage status including idle and occupied; the status information of each charging pile is recorded using a timestamp;
[0023] S422, for a charging pile whose usage status is occupied, obtaining charging information of an electric vehicle occupying the charging pile, and determining a charging end time of the charging pile based on the charging information of the electric vehicle and the status information of the charging pile; wherein the charging information of the electric vehicle includes a remaining battery capacity;
[0024] S423, if it is determined that the charging end time of the charging pile is within the charging pile search time period, the charging pile is recorded as an expected vacant parking space;
[0025] S424: Determine the expected number of free parking spaces in each sub-time period based on the charging end time of each charging pile.
[0026] Optionally, in S500, the obtaining of the number of free parking spaces in each parking lot, and determining the number of matching parking spaces in the parking lot during the parking lot search period based on the number of free parking spaces and the number of parking space changes in the parking lot, includes:
[0027] S510, obtaining status information of all charging piles in a parking lot when the target vehicle is traveling along a common path, and determining a parking space change degree of the parking lot based on the status information;
[0028] S520: Determine the number of matching parking spaces in the parking lot in each sub-time period based on the number of parking space changes in the parking lot in each sub-time period, the degree of parking space change in the parking lot, and the number of vacant parking spaces.
[0029] Optionally, in S510, the acquiring of status information of all charging piles in a parking lot during the target vehicle's driving along a common path, and determining the degree of change of parking spaces in the parking lot based on the status information, includes:
[0030] S511, obtaining the usage status of all charging piles in the parking lot when the target vehicle is traveling along the common path;
[0031] S512, determining a state change record of the charging pile and a timestamp corresponding to the state change record based on the use state of the charging pile; wherein the state change record includes an occupied record and an idle record, the occupied record is a record of the use state changing from idle to occupied, and the idle record is a record of the use state changing from occupied to idle;
[0032] S513, dividing the time period during which the target vehicle travels along the common path into a plurality of time intervals, and determining the time interval in which the state change record is located based on the timestamp corresponding to the state change record;
[0033] S514, counting the number of occupied records and the number of idle records within each time interval, and determining the parking space change degree of the parking lot based on the number of occupied records and the number of idle records within each time interval.
[0034] Optionally, the parking space variation degree of the parking lot is calculated by the following formula:
[0035]
[0036] Among them, C p is the parking space change degree of the pth parking lot, nd j is the number of idle records in the jth time interval, na jis the number of occupancy records within the jth time interval, nd j-1 is the number of idle records in the j-1th time interval, na j-1 is the number of occupancy records in the j-1th time interval, m is the total number of time intervals, j = 1, 2, 3, ..., m; λ t is the time adjustment factor, △t j is the time difference between the starting point of the j-1th time interval and the current time.
[0037] In a second aspect, an embodiment of the present invention provides a parking space intelligent matching system based on Beidou navigation, the system comprising:
[0038] at least one processor;
[0039] at least one memory for storing at least one program;
[0040] When the at least one program is executed by the at least one processor, the at least one processor implements the intelligent parking space matching method based on Beidou navigation as described in any one of the first aspects.
[0041] The beneficial effects of the present invention are as follows: the present invention discloses a parking space intelligent matching method and system based on Beidou navigation. The present invention determines the number of matching parking spaces in the parking lot during the pile-seeking time period according to the status information of all charging piles in the parking lot, determines the final charging matching degree in combination with the difference distance between the destination and the parking lot, and intelligently matches the optimal charging parking space matching solution. On the premise of meeting the charging needs, the convenience of parking charging is improved, thereby improving the intelligence level of charging parking space matching. BRIEF DESCRIPTION OF THE DRAWINGS
[0042] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0043] Figure 1 is a flow chart of a parking space intelligent matching method based on Beidou navigation in an embodiment of the present invention;
[0044] Figure 2 is a schematic diagram of a scene of a parking space intelligent matching method based on Beidou navigation in an embodiment of the present invention;
[0045] Figure 3 It is a structural schematic diagram of a parking space intelligent matching system based on Beidou navigation in an embodiment of the present invention. DETAILED DESCRIPTION
[0046] The following will be combined with the embodiments and drawings to clearly and completely describe the concept, specific structure and technical effects of the present invention, so as to fully understand the purpose, scheme and effect of the present invention. It should be noted that the embodiments and features in the embodiments of the present invention can be combined with each other without conflict.
[0047] In the related art, a widely used solution to the problem in the background art is to make the model provide the basis for judging whether it is correct while providing the confidence of its recognition. However, the above method can only provide uncertainty information of the data or model, but cannot use the uncertainty information to feed back to the network for training.
[0048] See also Figure 1 , Figure 1 The present invention provides a method for intelligently matching parking spaces based on Beidou navigation, which includes the following steps:
[0049] S100, obtaining a destination set by a user in a Beidou navigation-based map;
[0050] Specifically, a vehicle used by a user is taken as a target vehicle, the vehicle-mounted terminal of the target vehicle includes a Beidou navigation module, and a map supporting Beidou navigation is installed on the vehicle-mounted terminal of the target vehicle.
[0051] S200, determining multiple charging piles closest to the destination in the map, and respectively determining parking lots where the multiple charging piles are located, to obtain at least one parking lot; wherein the charging piles are arranged at charging parking spaces in the parking lot, and the location information of the charging piles is pre-marked in the map;
[0052] Specifically, based on the destination and the location information of the charging piles in the map, the charging pile closest to the destination can be searched, and M charging piles can be determined in order of distance from near to far, and then the parking lot where each charging pile is located can be determined. The M charging piles are divided according to the parking lot to obtain N groups of charging piles, where M and N are both positive integers.
[0053] S300, determining a common path for the target vehicle to travel to each parking lot based on Beidou navigation, navigating the target vehicle according to the common path, and acquiring status information and navigation request information of all charging piles in each parking lot in real time; wherein the status information includes the usage status, charging power and charging time of the charging pile; and the navigation request information includes a navigation request with the parking lot as the starting point and the end point;
[0054] refer to Figure 2Specifically, based on Beidou navigation, the planned path from the current position of the target vehicle to each parking lot is determined, and the bifurcation point of each planned path is determined (that is, the point corresponding to the first bifurcation passed by the target vehicle during driving in the map); the planned path from the current position of the target vehicle to the bifurcation point is used as the common path, and the planned path from the bifurcation point to each parking lot is used as the branch path; in the subsequent steps, the difference distance between the parking lot and the destination is the driving distance of the branch path; by obtaining the status information of all charging piles in the parking lot and the navigation request information of the parking lot, the parking space matching is started; the navigation request information can reflect the number of vehicles requesting to enter and exit the parking lot.
[0055] In this embodiment, the use status of the charging pile includes idle and occupied; if the use status of the charging pile is idle, the charging parking space where the charging pile is located is assumed to be an idle parking space, and vehicles without charging requirements will not occupy the idle parking space by default. The charging power of the charging pile refers to the power output to the electric vehicle connected to the charging pile for charging; the charging time of the charging pile refers to the cumulative time that the electric vehicle is connected to the charging pile for charging.
[0056] S400, for each parking lot, determining the expected arrival time of the target vehicle at the parking lot based on Beidou navigation, determining the time period for the target vehicle to search for charging piles in the parking lot based on the expected arrival time, and determining the number of parking spaces changed in the parking lot during the time period for searching for charging piles based on the status information of all charging piles in the parking lot and the navigation request information; wherein the number of parking spaces changed is the number of vacant parking spaces; wherein the vacant parking spaces are charging spaces where charging piles whose use status is vacant are located;
[0057] S500, when the distance between the current position of the target vehicle and the bifurcation point is less than a set distance threshold, the number of free parking spaces in each parking lot is obtained, and the number of matching parking spaces in the parking lot during the pole-seeking time period is determined based on the number of free parking spaces and the number of parking space changes in the parking lot; wherein the bifurcation point is the end point of the common path;
[0058] S600, determining the difference distance between each parking lot and the destination, determining the charging matching degree of the parking lot based on the number of matching parking spaces in the parking lot and the difference distance, sorting the parking lots according to the charging matching degree, obtaining the parking lot selected by the user, and using the vacant parking spaces in the parking lot as charging parking spaces matching the target vehicle.
[0059] It should be noted that the purpose of setting the distance threshold is to provide users with sufficient time to select a parking lot before the target vehicle reaches the fork point. The size of the distance threshold is set based on experience. When the distance between the current position of the target vehicle and the fork point is less than the set distance threshold, the latest number of matching parking spaces can be obtained, and the determined charging matching degree is more accurate. After the charging matching degree is determined, the parking lots are sorted in descending order of charging matching degree to form a parking lot list. The parking lot selected by the user in the parking lot list is used as the target parking lot; and then the vacant parking spaces in the target parking lot are used as the matched charging parking spaces; the charging parking spaces that match the target vehicle can be one or more.
[0060] The present invention uses the Beidou navigation system to perform high-precision positioning of the user's vehicle, and uses the high-precision positioning function of the Beidou navigation system to improve the position accuracy of the charging parking space matching. The status of the charging parking space is updated in real time to ensure the timeliness of the matching results. The use of Beidou navigation can ensure the consistency and accuracy of time. Beidou navigation technology is used to determine the user's location and parking lot location, and calculate the distance and route. The SQL database is used to store and query the status information of the parking lot and the charging pile. The matching status information is pushed to the user's mobile phone application or vehicle terminal. After the user receives the matching information, a navigation service from the current location to the charging parking space is provided. Through intelligent matching, the time for users to find charging parking spaces is reduced.
[0061] In some embodiments, in S400, determining the charging pile search time period of the target vehicle in the parking lot based on the expected arrival time, and determining the number of parking space changes in the parking lot during the charging pile search time period based on the status information of all charging piles in the parking lot and the navigation request information, includes:
[0062] S410, for each parking lot, obtaining an expected arrival time of the target vehicle at the parking lot, determining a time period for seeking a pole when the target vehicle travels to the parking lot based on the expected arrival time, dividing the time period for seeking a pole into a plurality of sub-time periods, and determining time matching weights corresponding to the plurality of sub-time periods;
[0063] S420, obtaining status information of all charging piles in the parking lot, and determining the expected number of vacant parking spaces in the parking lot in each sub-time period based on the status information;
[0064] S430, determining the number of parking space changes in each sub-time period of the pole-seeking time period after the target vehicle drives to the parking lot based on the time matching weight of each sub-time period and the expected number of free parking spaces.
[0065] It should be noted that the number of parking space changes reflects the number of free parking space changes based on time weighting within the sub-time period. The higher the number of parking space changes, the more free parking spaces change within the pile-seeking time period; the number of parking space changes = expected number of free parking spaces * time matching weight.
[0066] In some embodiments, in S410, determining a time period for seeking a pole when the target vehicle travels to the parking lot based on the expected arrival time, dividing the time period for seeking a pole into a plurality of sub-time periods, and determining time matching weights corresponding to the plurality of sub-time periods include:
[0067] S411, for each parking lot, determine the entrance and exit roads of the parking lot, determine the parking heat of the parking lot based on the congestion ratio of the entrance and exit roads, extend the expected arrival time of the target vehicle to the parking lot based on the parking heat, and obtain a pole-seeking time period including the expected arrival time; wherein the entrance and exit roads include an exit road and an entrance road connecting the entrance and exit of the parking lot, and the exit road and the entrance road both have multiple congestion levels, the value range of the congestion level is an integer from 1 to 4, and the value of the congestion level is positively correlated with the degree of congestion; the congestion ratio is the ratio of the congestion level of the entrance road to the congestion level of the exit road; the parking heat represents the expected change value of the number of vehicles in the parking lot;
[0068] Specifically, parking heat is the ratio of the congestion of the road entering the parking lot to the congestion of the road exiting the parking lot. The map uses lines of different colors such as crimson, red, yellow, and green to represent congestion. Crimson represents a very congested road section, red represents congestion on the road section, yellow represents slow traffic on the road section, and green represents smooth traffic on the road section. The congestion level is set for the congestion represented by each color, for example, crimson = 4, red = 3, yellow = 2, and green = 1; if the congestion of the road entering the parking lot is 3 and the congestion of the road exiting the parking lot is 2, the parking heat is 1.5. The higher the parking heat, the more vehicles enter the parking lot and the fewer vehicles exit the parking lot, and the more scarce the vacant parking spaces in the parking lot are.
[0069] The extended time is positively correlated with the parking popularity; specifically, the lower the parking popularity, the smoother the entrance to the parking lot, and the shorter the extended time; the greater the parking popularity, the more congested the entrance to the parking lot, and the longer the extended time; for example, when the parking popularity is low, the end time of the pole-seeking time period is set to 3 minutes after the expected arrival time, and when the parking popularity is high, the end time of the pole-seeking time period is set to 10 minutes after the expected arrival time.
[0070] In some embodiments, the start time and end time of the pile-seeking time period are determined by:
[0071] T1=t0; where t0 is the expected arrival time and T1 is the starting time of the pile-seeking time period;
[0072] T2=t0+k1*h*△t; wherein, T2 is the end time of the pile-seeking time period, k1 is the adjustment coefficient, h is the parking heat, and △t is the benchmark redundant time.
[0073] In some embodiments, 1 minute<Δt<20 minutes, 0.25<h<4, 0<k1*h<20.
[0074] S412: Divide the parking lot search time period into a plurality of sub-time periods, and set a corresponding time matching weight for each sub-time period according to the expected arrival time and parking popularity.
[0075] Specifically, the time period for searching for poles is divided according to the set time interval interval to obtain multiple continuous sub-time periods. The sub-time period where the expected arrival time is located is used as the reference time period, the time matching weight of the reference time period is set to the maximum value, and the initial time matching weight of each remaining sub-time period is determined based on the time length distance of the reference time period and each remaining sub-time period; wherein the time matching weight decreases as the time length distance increases;
[0076] It should be noted that the duration distance is obtained by calculating the difference between the start times of two sub-time periods, and the duration distance between the reference time period and the adjacent sub-time period is one sub-time period.
[0077] The parking heat is multiplied by the initial time matching weight corresponding to each sub-time period to obtain the corresponding time matching weight of each sub-time period.
[0078] In some embodiments, the calculation formula of the initial time matching weight is:
[0079] W ti =e -k2*ti / (T2-T1) ;
[0080] Among them, W ti is the initial time matching weight of the ith sub-time period, ti is the expected arrival time and the duration distance of the ith sub-time period, k2 is the adjustment coefficient, 1<k2<20; e is the natural base.
[0081] For the sub-time period after the base time period, the calculation formula of the time matching weight is:
[0082] W i =h*W ti ; where h is the parking heat, W i is the time matching weight of the i-th sub-time period.
[0083] In some embodiments, in S420, the acquiring status information of all charging piles in the parking lot, and determining the expected number of free parking spaces in the parking lot in each sub-time period based on the status information, includes:
[0084] S421, establishing a database, wherein the database includes location information and status information of all charging piles in each parking lot; wherein the status information of each charging pile is recorded using a timestamp;
[0085] Specifically, the status information includes the usage status, charging power and charging time of the charging pile, and the usage status includes idle and occupied. The status information of the charging parking spaces is stored in the database, and each charging parking space uses a timestamp to record its status change. When the vehicle starts charging or ends charging, the usage status of the charging pile changes, and the status information of the charging pile in the database is updated in real time.
[0086] In some embodiments, the cloud server communicates with the charging pile and the BMS of the electric vehicle respectively to obtain the status information of the charging pile and the charging information of the electric vehicle; the charging information of the electric vehicle includes the remaining battery capacity, charging speed, charging time, etc. of the power battery on the electric vehicle; the charging information of the electric vehicle is monitored and managed by the battery management system (BMS) built into the vehicle. The status information of the charging pile includes the usage status of the charging pile (idle or occupied), charging power, charging time, and the parking position of the parking space where the charging pile is located; the usage status of the charging pile can reflect whether the charging parking space is occupied; a sensor is installed in each charging parking space to monitor in real time whether the charging parking space is occupied, and send the status information to the cloud server. The status information changes dynamically, so the status information of the charging pile needs to be updated in real time to ensure the accuracy of the matching. After the matching is completed, the Beidou navigation system can provide users with navigation services from the current location to the matching charging parking space.
[0087] S422, for a charging pile whose usage status is occupied, obtaining charging information of an electric vehicle occupying the charging pile, and determining a charging end time of the charging pile based on the charging information of the electric vehicle and the status information of the charging pile; wherein the charging information of the electric vehicle includes a remaining battery capacity;
[0088] Specifically, if a parking space is currently occupied, it is necessary to calculate the estimated time when the vehicle occupying the parking space will finish charging, so as to determine whether the parking space is vacant when the target vehicle arrives.
[0089] Wherein, the end time of charging = current time + required charging time; by determining the remaining battery capacity of the vehicle (for example, how many kilowatt hours kWh) and the charging power of the charging pile (for example, how many kilowatts kW), the required charging time is calculated using the formula: required charging time (hours) = K3 * remaining battery capacity (kWh) / charging power (kW); add the required charging time to the charging start time to get the estimated end time of charging.
[0090] The charging power may be affected by many factors, such as grid restrictions, vehicle charging strategy, etc., so the actual charging time may differ from the calculated result. In addition, considering that the user may not fully charge the battery, or the charging speed may not be constant (such as the charging speed will decrease when the battery is nearly full), set the empirical coefficient K3 to adjust the charging time. Generally, users will choose to stop charging when the battery capacity is charged to 80%, so K3 can be set to 0.8.
[0091] S423, if it is determined that the charging end time of the charging pile is within the charging pile search time period, the charging pile is recorded as an expected vacant parking space;
[0092] S424: Determine the expected number of free parking spaces in each sub-time period based on the charging end time of each charging pile.
[0093] In some embodiments, in S500, the obtaining of the number of free parking spaces in each parking lot and determining the number of matching parking spaces in the parking lot during the parking lot search period based on the number of free parking spaces and the number of parking space changes in the parking lot include:
[0094] S510, obtaining status information of all charging piles in a parking lot when the target vehicle is traveling along a common path, and determining a parking space change degree of the parking lot based on the status information;
[0095] Specifically, the parking space occupancy time changes dynamically, and it is necessary to be able to process real-time updated data. By monitoring the charging status in real time, if the charging status changes (such as the user ends charging early), the status information of the charging pile in the database is updated.
[0096] S520: Determine the number of matching parking spaces in the parking lot in each sub-time period based on the number of parking space changes in the parking lot in each sub-time period, the degree of parking space change in the parking lot, and the number of vacant parking spaces.
[0097] In some embodiments, in S510, the acquiring of status information of all charging piles in a parking lot during the target vehicle's driving along a common path, and determining the degree of change of parking spaces in the parking lot based on the status information, includes:
[0098] S511, obtaining the usage status of all charging piles in the parking lot when the target vehicle is traveling along the common path;
[0099] S512, determining a state change record of the charging pile and a timestamp corresponding to the state change record based on the use state of the charging pile; wherein the state change record includes an occupied record and an idle record, the occupied record is a record of the use state changing from idle to occupied, and the idle record is a record of the use state changing from occupied to idle;
[0100] Specifically, the change of the use status from idle to occupied is recorded as an occupied record, and the change of the use status from occupied to idle is recorded as an idle record, and the occupied record and idle record of each charging pile in the parking lot are determined, as well as the timestamps corresponding to the occupied record and the idle record;
[0101] S513, dividing the time period during which the target vehicle travels along the common path into a plurality of time intervals, and determining the time interval in which the state change record is located based on the timestamp corresponding to the state change record;
[0102] S514, counting the number of occupied records and the number of idle records within each time interval, and determining the parking space change degree of the parking lot based on the number of occupied records and the number of idle records within each time interval.
[0103] In some embodiments, the parking space variation of the parking lot is calculated by the following formula:
[0104]
[0105] Among them, C p is the parking space change degree of the pth parking lot, nd j is the number of idle records in the jth time interval, na j is the number of occupancy records within the jth time interval, nd j-1 is the number of idle records in the j-1th time interval, na j-1 is the number of occupancy records in the j-1th time interval, m is the total number of time intervals, j = 1, 2, 3, ..., m; λ t is the time adjustment factor, △t j is the time difference between the starting point of the j-1th time interval and the current time.
[0106] It should be noted that (nd j -na j ) represents the difference between the idle record and the occupied record in the jth time interval, that is, the idle record that finally changes in the jth time interval, (nd j -naj ) / (nd j-1 -na j-1 ) represents the change rate of free parking spaces in the jth time interval; Indicates the time weight of the jth time interval; in the parking space change calculation formula, the denominator is the sum of the time weights of each time interval, and the numerator is the weighted sum of the free parking space change rates of each time interval. In this way, the free parking space change rate closer to the current time will have a greater time weight, thus playing a greater role in the parking space change rate. t The size of λ is set according to the actual situation. If the change rate of free parking spaces is large, a larger λ is required. t To ensure that recent changes do not have an excessive impact on the overall trend; if the change rate of vacant parking spaces is small, a smaller λ can be set t .
[0107] In some embodiments, the number of matching parking spaces in the parking lot is calculated using the following formula:
[0108] N pi =Nr pi +Nd pi *C p ;
[0109] Among them, N pi is the number of matching parking spaces in the pth parking lot in the i-th sub-time period, Nr pi Nd is the number of parking spaces changed in the pth parking lot in the i-th sub-time period, pi is the number of free parking spaces in the p-th parking lot in the i-th sub-time period.
[0110] In some embodiments, in S600, determining the charging matching degree of the parking lot based on the number of matching parking spaces and the difference distance of the parking lot includes:
[0111] When each sub-time period within the pile-seeking time period is min(N pi )>N th ,but:
[0112]
[0113] For any sub-time period within the pile-seeking time period, if there is min(N pi )≤N th ,but:
[0114]
[0115] Among them, M p represents the charging matching degree of the parking lot of the pth parking lot, max(Npi ) is the maximum number of matching parking spaces in all parking lots in the i-th sub-time period, min(N pi ) is the minimum number of matching parking spaces in all parking lots in the i-th sub-time period, N th is the minimum threshold for matching the number of parking spaces; d Represents the weight of the difference distance, D p is the difference distance of the pth parking lot, max(D p ) is the maximum value of the difference distance of all parking lots,
[0116] In some embodiments, N th >10,0<λ d <1. The number of matching parking spaces can reflect the number of free parking spaces during the time period of searching for charging piles. The higher the certainty, the higher the possibility of matching with free parking spaces. The difference distance can reflect the convenience of the parking lot to the destination. When the number of matching parking spaces is limited, the parking lot is selected based on the parking and charging needs. When the number of matching parking spaces is sufficient, the parking lot is selected based on the difference distance. Based on the charging matching degree obtained from the number of matching parking spaces and the difference distance, a parking lot that meets the parking and charging needs and is highly convenient can be comprehensively selected.
[0117] In addition, refer to Figure 3 An embodiment of the present invention further provides a parking space intelligent matching system based on Beidou navigation, the system comprising:
[0118] at least one processor;
[0119] at least one memory for storing at least one program;
[0120] When the at least one program is executed by the at least one processor, the at least one processor implements the above method.
[0121] It can be seen that the contents of the above method embodiments are all applicable to the present system embodiments, the functions specifically implemented by the present system embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0122] In addition, an embodiment of the present invention also provides a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are executed by a processor or controller, for example, by a processor in the above-mentioned electronic device embodiment, so that the above-mentioned processor can execute the Beidou navigation-based parking space intelligent matching method in the above-mentioned embodiment.
[0123] Similarly, the contents of the above method embodiments are all applicable to the present storage medium embodiments. The functions specifically implemented by the present storage medium embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0124] It will be appreciated by those skilled in the art that all or some of the steps and systems in the disclosed method above may be implemented as software, firmware, hardware and appropriate combinations thereof. Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor or a microprocessor, or may be implemented as hardware, or may be implemented as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or a non-transitory medium) and a communication medium (or a temporary medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CDROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that may be used to store desired information and may be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.
[0125] The above is a specific description of the preferred implementation of the present disclosure, but the present disclosure is not limited to the above-mentioned implementation mode. Technical personnel familiar with the field can also make various equivalent deformations or substitutions without violating the spirit of the present disclosure. These equivalent deformations or substitutions are all included in the scope defined by the claims of the present disclosure.
Claims
1. A parking space intelligent matching method based on Beidou navigation, characterized in that: The method comprises the following steps: S100, obtaining a destination set by a user in a Beidou navigation-based map; S200, determining multiple charging piles closest to the destination in the map, and respectively determining parking lots where the multiple charging piles are located, to obtain at least one parking lot; wherein the charging piles are arranged at charging parking spaces in the parking lot, and the location information of the charging piles is pre-marked in the map; S300, determining a common path for the target vehicle to travel to each parking lot based on Beidou navigation, navigating the target vehicle according to the common path, and acquiring status information and navigation request information of all charging piles in each parking lot in real time; wherein the status information includes the usage status of the charging piles, and the usage status includes idle and occupied; and the navigation request information includes a navigation request with the parking lot as the starting point and the end point; S400, for each parking lot, determining the expected arrival time of the target vehicle at the parking lot based on Beidou navigation, determining the charging pile search time period of the target vehicle at the parking lot based on the expected arrival time, and determining the number of parking spaces changed in the parking lot during the charging pile search time period based on the status information of all charging piles in the parking lot and the navigation request information; wherein the number of parking spaces changed is the number of vacant parking spaces changed during the charging pile search time period; and the vacant parking spaces are charging parking spaces where charging piles whose use status is vacant are located; S500, when the distance between the current position of the target vehicle and the bifurcation point is less than a set distance threshold, the number of free parking spaces in each parking lot is obtained, and the number of matching parking spaces in the parking lot during the pole-seeking time period is determined based on the number of free parking spaces and the number of parking space changes in the parking lot; wherein the bifurcation point is the end point of the common path; S600, determining the difference distance between each parking lot and the destination, determining the charging matching degree of the parking lot based on the number of matching parking spaces in the parking lot and the difference distance, sorting the parking lots according to the charging matching degree, obtaining the parking lot selected by the user, and using the vacant parking spaces in the parking lots as charging parking spaces matching the target vehicle; In S400, the determining of the charging pile search time period of the target vehicle in the parking lot based on the expected arrival time, and the determining of the number of parking space changes in the parking lot during the charging pile search time period based on the status information of all charging piles in the parking lot and the navigation request information, includes: S410, for each parking lot, obtaining an expected arrival time of the target vehicle at the parking lot, determining a time period for seeking a pole when the target vehicle travels to the parking lot based on the expected arrival time, dividing the time period for seeking a pole into a plurality of sub-time periods, and determining time matching weights corresponding to the plurality of sub-time periods; S420, obtaining status information of all charging piles in the parking lot, and determining the expected number of vacant parking spaces in the parking lot in each sub-time period based on the status information; S430, determining the number of parking space changes in each sub-time period of the pole-seeking time period after the target vehicle drives to the parking lot based on the time matching weight of each sub-time period and the expected number of free parking spaces; In S410, the determining of a pole-seeking time period for the target vehicle to travel to the parking lot based on the expected arrival time, dividing the pole-seeking time period into a plurality of sub-time periods, and determining time matching weights corresponding to the plurality of sub-time periods includes: S411, for each parking lot, determine the entrance and exit roads of the parking lot, determine the parking heat of the parking lot based on the congestion ratio of the entrance and exit roads, extend the expected arrival time of the target vehicle to the parking lot based on the parking heat, and obtain a pole-seeking time period including the expected arrival time; wherein the entrance and exit roads include an exit road and an entrance road connecting the entrance and exit of the parking lot, and the exit road and the entrance road both have multiple congestion levels, the value range of the congestion level is an integer from 1 to 4, and the value of the congestion level is positively correlated with the degree of congestion; the congestion ratio is the ratio of the congestion level of the entrance road to the congestion level of the exit road; the parking heat represents the expected change value of the number of vehicles in the parking lot; S412, dividing the parking lot search time period into a plurality of sub-time periods, and setting a corresponding time matching weight for each sub-time period according to the expected arrival time and parking popularity; wherein the time matching weight decreases as the time distance increases; In S420, the acquiring of status information of all charging piles in the parking lot and determining the expected number of vacant parking spaces in the parking lot in each sub-time period based on the status information includes: S421, establishing a database, wherein the database includes location information and status information of all charging piles in each parking lot; wherein the status information of each charging pile is recorded using a timestamp; S422, for a charging pile whose usage status is occupied, obtaining charging information of an electric vehicle occupying the charging pile, and determining a charging end time of the charging pile based on the charging information of the electric vehicle and the status information of the charging pile; wherein the charging information of the electric vehicle includes a remaining battery capacity; S423, if it is determined that the charging end time of the charging pile is within the charging pile search time period, the charging pile is recorded as an expected vacant parking space; S424, determining the expected number of free parking spaces in each sub-time period based on the end charging time of each charging pile; In S500, the step of obtaining the number of free parking spaces in each parking lot and determining the number of matching parking spaces in the parking lot during the parking pile search time period based on the number of free parking spaces and the number of parking space changes in the parking lot includes: S510, obtaining status information of all charging piles in a parking lot when the target vehicle is traveling along a common path, and determining a parking space change degree of the parking lot based on the status information; S520, determining the number of matching parking spaces in the parking lot in each sub-time period based on the number of parking space changes in the parking lot in each sub-time period, the degree of parking space change in the parking lot, and the number of vacant parking spaces; In S510, the step of obtaining status information of all charging piles in a parking lot during the target vehicle's driving along a common path, and determining a parking space change degree of the parking lot based on the status information includes: S511, obtaining the usage status of all charging piles in the parking lot when the target vehicle is traveling along the common path; S512, determining a state change record of the charging pile and a timestamp corresponding to the state change record based on the use state of the charging pile; wherein the state change record includes an occupied record and an idle record, the occupied record is a record of the use state changing from idle to occupied, and the idle record is a record of the use state changing from occupied to idle; S513, dividing the time period during which the target vehicle travels along the common path into a plurality of time intervals, and determining the time interval in which the state change record is located based on the timestamp corresponding to the state change record; S514, counting the number of occupied records and the number of idle records in each time interval, and determining the parking space change degree of the parking lot based on the number of occupied records and the number of idle records in each time interval; The parking space variation of the parking lot is calculated by the following formula: ; in, is the parking space change degree of the pth parking lot, is the number of idle records in the jth time interval, is the number of occupancy records within the jth time interval, is the number of idle records in the j-1th time interval, is the number of occupancy records in the j-1th time interval, m is the total number of time intervals, j=1,2,3,...,m; is the time adjustment factor, is the time difference between the starting point of the j-1th time interval and the current time.
2. A parking space intelligent matching system based on Beidou navigation, characterized in that: The system comprises: at least one processor; at least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the intelligent parking space matching method based on Beidou navigation as described in claim 1.
Citation Information
Patent Citations
Route information display device and route information display method
CN101430211A
Intelligent charging pile system and a charging method for a new energy vehicle
CN109050300A
Intelligent management system of parking lot, parking lot, parking method and device
CN111553994A
Navigation method and device based on vehicle-mounted display
CN116110246A
Path positioning planning method and system based on Beidou navigation
CN117740013A
