Processing method and device for recommending battery swap station, electronic equipment and storage medium

Abstract

The invention discloses a processing method and device for recommending a battery swap station, electronic equipment and a storage medium. The method comprises the following steps: acquiring a candidate battery swap station matched with a battery swap vehicle; estimating the estimated operation information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current position; and according to the pre-estimated operation information, recommending a battery swap station to a driving user of the battery swap vehicle. According to the method, the pre-estimated operation information of the selected battery swap station when the vehicle arrives at the candidate battery swap station can be pre-estimated, battery swap station recommendation based on the pre-estimated operation information is provided for a user, the user does not need to pre-judge the condition after the vehicle arrives at the candidate battery swap station, misjudgment is easily avoided, and the accuracy of battery swap station recommendation is improved.

Description

[0001] This application is a divisional case of the Chinese invention patent with the application date of December 31, 2020, application number 202011623609.6, and name “Processing method, device, electronic device and storage medium for recommending battery swap stations”. Technical Field

[0002] The present invention belongs to the field of battery swap station navigation, and in particular relates to a processing method, device, electronic device and storage medium for recommending a battery swap station. Background Art

[0003] To provide battery swap users with a better experience, some battery swap station navigation apps recommend battery swap stations to guide users in choosing a station. Currently, these recommendations are based on the station's current operating conditions, such as the number of available batteries and the number of people waiting in line. For example, users are guided to the station with the most available batteries or the least number of people waiting in line.

[0004] However, in actual applications, it can be found that since it takes time for users to get to the battery swap station, the situation at the battery swap station after the user arrives is likely to be different from the situation when the recommendation was given. This means that if the user completely follows the navigation software's recommendation to select the best recommended battery swap station, the available battery at the battery swap station may be 0 after arriving at the battery swap station, and the battery swap station may require queuing, and the user's battery swap needs still cannot be quickly met. To avoid this situation, users need to predict the situation after arriving at the battery swap station and choose the best battery swap station. However, users' predictions are usually based on their own experience, and it is easy to make mistakes. Summary of the Invention

[0005] The technical problem to be solved by the present invention is to overcome the defect in the prior art that the list of recommended battery swap stations is usually given based on the current operating conditions of the battery swap station, which is very different from the situation of the battery swap station after the user arrives at the battery swap station, resulting in the user having to predict the situation after arriving at the battery swap station, which easily leads to misjudgment and inability to swap batteries. A processing method, device, electronic device and storage medium for recommending battery swap stations are provided.

[0006] The present invention solves the above technical problems through the following technical solutions:

[0007] The present invention provides a method for recommending a battery swap station, comprising:

[0008] Obtain candidate battery swap stations that match the battery swap vehicle;

[0009] Respectively estimating the estimated operating information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current location;

[0010] Recommend a battery swap station to the driver of the battery swap vehicle based on the estimated operating information.

[0011] The above method can estimate the estimated operating information of the candidate battery swap station when the vehicle arrives at the candidate battery swap station, and provide users with battery swap station recommendations based on the estimated operating information. The user does not need to predict the situation after arriving at the candidate battery swap station, which can easily avoid misjudgment and improve the accuracy of battery swap station recommendations.

[0012] Preferably, the step of obtaining a candidate battery swap station that matches the battery swap vehicle includes:

[0013] Obtaining alternative battery swap stations within the target search range that match the model of the battery swap vehicle;

[0014] According to the remaining battery power of the battery swap vehicle, the reference mileage and the driving path of the battery swap vehicle from each of the alternative battery swap stations, candidate battery swap stations that can be reached by the battery swap vehicle based on the remaining battery power are screened out from the alternative battery swap stations.

[0015] Through the above steps, the battery swap stations that match the model of the battery swap vehicle within the target search range are selected as alternative battery swap stations, and the alternative battery swap stations that the battery swap vehicle can reach based on the remaining battery power are selected as candidate battery swap stations. The battery swap stations that the battery swap vehicle can reach and have matching batteries available for replacement are screened out. In this way, when recommending battery swap stations to driving users based on the screened out battery swap stations, it can be guaranteed that the battery swap stations recommended to driving users are all battery swap stations that they can reach and have batteries available for replacement, ensuring that the battery swap users' battery swap needs are met.

[0016] Preferably, the estimated operation information includes the predicted queue number when the battery swap vehicle arrives at the candidate battery swap station; the estimated operation information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current position includes:

[0017] For each candidate battery swap station, perform the following steps:

[0018] estimating the driving time for the battery swapping vehicle to reach the candidate battery swapping station;

[0019] estimating the number of battery swaps required at the candidate battery swap station within the driving time;

[0020] Estimating the actual number of battery swaps at the candidate battery swap station within the driving time;

[0021] estimating the number of batteries available at the candidate battery swap station when the battery swap vehicle arrives at the candidate battery swap station;

[0022] Determine the arrival queue number of the battery swapping vehicle when it arrives at the candidate battery swapping station based on the required number of battery swapping and the actual number of battery swapping;

[0023] The predicted queue number is determined according to the arrival queue number and the predicted number of available batteries.

[0024] In this technical solution, the estimated operating information of the candidate battery swap station is reflected at least by the predicted queue number when the battery swap vehicle arrives at the candidate battery swap station. In this way, when recommending a battery swap station based on the estimated operating information of the candidate battery swap station, it is possible to consider recommending battery swap users to go to relatively idle stations based on the predicted queue number, which can not only quickly meet the battery swap users' battery swap needs, but also balance the operating load of peak stations.

[0025] Preferably, the estimating the actual number of battery swaps at the candidate battery swap station during the driving time includes:

[0026] estimating the ideal number of battery swaps at the candidate battery swap station within the driving time;

[0027] When the predicted number of available batteries is greater than or equal to 0, the smaller of the ideal number of battery swaps and the required number of battery swaps is selected as the actual number of battery swaps;

[0028] When the predicted number of available batteries is less than 0, the smaller of the ideal number of battery swaps and the total number of available batteries is selected as the actual number of battery swaps; the total number of available batteries is related to the current real-time number of available batteries at the candidate battery swap station and the number of newly added fully charged batteries at the candidate battery swap station during the driving time.

[0029] The above steps fully consider the specific algorithms for estimating the actual number of battery swaps in different scenarios where the predicted number of available batteries is greater than or equal to 0 and less than 0, thereby improving the accuracy of estimating the actual number of battery swaps.

[0030] Preferably, the estimating the ideal number of battery swaps at the candidate battery swap station within the driving time includes:

[0031] Obtaining the single battery swapping time of the candidate battery swapping station and the number of battery swapping channels of the candidate battery swapping station;

[0032] According to the driving time, the duration of a single battery swap and the number of battery swap channels, the ideal number of battery swaps at the candidate battery swap station within the driving time is estimated.

[0033] The above steps provide a specific method for estimating the ideal number of battery replacements, which has the advantage of accurate estimation.

[0034] Preferably, determining the predicted queue number based on the arrival queue number and the predicted number of available batteries includes:

[0035] When the predicted number of available batteries is greater than 0 and the arrival queue number is less than or equal to 0, determining that the predicted queue number is equal to 0;

[0036] When the predicted number of available batteries is greater than 0 and the number of arrival queues is greater than 0, the number of arrival queues is used as the predicted number of queues.

[0037] The above steps fully consider the specific algorithm for determining the predicted queue number under different scenarios where the predicted number of available batteries is greater than 0 and the arrival queue number is less than or equal to 0 or greater than 0, thereby improving the accuracy of estimating the predicted queue number.

[0038] Preferably, the estimated operation information also includes the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is equal to 0; when the predicted queue number is the arrival queue number, the predicted queue time is determined based on the arrival queue number, the single battery swapping time and the number of battery swapping channels of the candidate battery swapping station.

[0039] The above steps fully consider the specific algorithm for determining the predicted queue duration in different scenarios where the predicted queue number is equal to 0 or the arrival queue number, thereby improving the accuracy of estimating the predicted queue duration.

[0040] Preferably, determining the predicted queue number based on the arrival queue number and the predicted number of available batteries includes:

[0041] When the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is less than or equal to 0, determining that the predicted queue number is equal to 0;

[0042] When the predicted number of available batteries is less than or equal to 0 and the arrival queue number is greater than 0, the arrival queue number is used as the predicted queue number.

[0043] The above steps fully consider the specific algorithm for determining the predicted queue number under different scenarios where the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is less than or equal to 0 or greater than 0, and provide the accuracy of estimating the predicted queue number.

[0044] Preferably, the estimated operation information also includes the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is the remaining charging time of the battery that is not fully charged and has the highest charge within the driving time; when the predicted queue number is the arrival queue number, the predicted queue time is the smaller of the first time and the second time, the first time is determined based on the arrival queue number, the single battery swap time and the number of battery swapping channels of the candidate battery swapping station, the second time is the (k+1)th remaining charging time of the currently uncharged battery sorted from low to high according to the remaining charging time, and k is the arrival queue number.

[0045] The above steps fully consider the specific algorithm for determining the predicted queue duration in different scenarios where the predicted queue number is equal to 0 or the arrival queue number, thereby improving the accuracy of estimating the predicted queue duration.

[0046] Preferably, the estimated operation information includes the predicted number of available batteries and the battery swapping time when the battery swapping vehicle arrives at the candidate battery swapping station, and the battery swapping time includes the driving time and the predicted queuing time of the battery swapping vehicle to the candidate battery swapping station; and recommending a battery swapping station to the driver of the battery swapping vehicle based on the estimated operation information includes:

[0047] Sort the candidate battery swap stations with a predicted number of available batteries greater than or equal to 0 by battery swapping time from low to high to generate a first battery swap station recommendation list;

[0048] Sort the candidate battery swap stations with a predicted number of available batteries less than 0 by battery swapping time from low to high, and generate a second battery swap station recommendation list;

[0049] After joining the second recommended battery swap station list with the first recommended battery swap station list, a recommended battery swap station list is obtained;

[0050] Recommend battery swap stations to the driver of the battery swap vehicle according to the battery swap station recommendation list.

[0051] Through the above steps, the method guides the user to prioritize the candidate battery swap stations with a predicted number of available batteries greater than or equal to 0 and the shortest battery swap time through the battery swap station recommendation list, helping the user to quickly complete the battery swap.

[0052] The present invention also provides a processing device for recommending a battery swap station, comprising:

[0053] The battery swap station acquisition module is used to obtain candidate battery swap stations that match the battery swap vehicle;

[0054] An operation estimation module, configured to respectively estimate the estimated operation information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current location;

[0055] The battery swap station recommendation module is used to recommend a battery swap station to the driver of the battery swap vehicle based on the estimated operation information.

[0056] Preferably, the battery swap station acquisition module is used to:

[0057] Obtaining alternative battery swap stations within the target search range that match the model of the battery swap vehicle;

[0058] According to the remaining battery power of the battery swap vehicle, the reference mileage and the driving path of the battery swap vehicle from each of the alternative battery swap stations, candidate battery swap stations that can be reached by the battery swap vehicle based on the remaining battery power are screened out from the alternative battery swap stations.

[0059] Preferably, the estimated operation information includes the predicted queue number of the battery swapping vehicles when they arrive at the candidate battery swapping station; the operation estimation module is used to:

[0060] Implement the following functions for each candidate battery swap station:

[0061] Estimating the driving time for the battery swap vehicle to reach the candidate battery swap station and predicting the number of available batteries;

[0062] estimating the number of battery swaps required at the candidate battery swap station within the driving time;

[0063] Estimating the actual number of battery swaps at the candidate battery swap station within the driving time;

[0064] Determine the arrival queue number of the battery swapping vehicle when it arrives at the candidate battery swapping station based on the required number of battery swapping and the actual number of battery swapping;

[0065] The predicted queue number is determined according to the arrival queue number and the predicted number of available batteries.

[0066] Preferably, the estimating the actual number of battery swaps at the candidate battery swap station during the driving time includes:

[0067] estimating the ideal number of battery swaps at the candidate battery swap station within the driving time;

[0068] When the predicted number of available batteries is greater than or equal to 0, the smaller of the ideal number of battery swaps and the required number of battery swaps is selected as the actual number of battery swaps;

[0069] When the predicted number of available batteries is less than 0, the smaller of the ideal number of battery swaps and the total number of available batteries is selected as the actual number of battery swaps; the total number of available batteries is related to the current real-time number of available batteries at the candidate battery swap station and the number of newly added fully charged batteries at the candidate battery swap station during the driving time.

[0070] Preferably, the estimating the ideal number of battery swaps at the candidate battery swap station within the driving time includes:

[0071] Obtaining the single battery swapping time of the candidate battery swapping station and the number of battery swapping channels of the candidate battery swapping station;

[0072] According to the driving time, the duration of a single battery swap and the number of battery swap channels, the ideal number of battery swaps at the candidate battery swap station within the driving time is estimated.

[0073] Preferably, determining the predicted queue number based on the arrival queue number and the predicted number of available batteries includes:

[0074] When the predicted number of available batteries is greater than 0 and the arrival queue number is less than or equal to 0, determining that the predicted queue number is equal to 0;

[0075] When the predicted number of available batteries is greater than 0 and the number of arrival queues is greater than 0, the number of arrival queues is used as the predicted number of queues.

[0076] Preferably, the estimated operation information also includes the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is equal to 0; when the predicted queue number is the arrival queue number, the predicted queue time is determined based on the arrival queue number, the single battery swapping time and the number of battery swapping channels of the candidate battery swapping station.

[0077] Preferably, determining the predicted queue number based on the arrival queue number and the predicted number of available batteries includes:

[0078] When the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is less than or equal to 0, determining that the predicted queue number is equal to 0;

[0079] When the predicted number of available batteries is less than or equal to 0 and the arrival queue number is greater than 0, the arrival queue number is used as the predicted queue number.

[0080] Preferably, the estimated operation information also includes the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is the remaining charging time of the battery that is not fully charged and has the highest charge within the driving time; when the predicted queue number is the arrival queue number, the predicted queue time is the smaller of the first time and the second time, the first time is determined based on the arrival queue number, the single battery swap time and the number of battery swapping channels of the candidate battery swapping station, the second time is the (k+1)th remaining charging time of the currently uncharged battery sorted from low to high according to the remaining charging time, and k is the arrival queue number.

[0081] Preferably, the estimated operation information includes the predicted number of available batteries and the battery swapping time when the battery swapping vehicle arrives at the candidate battery swapping station. The battery swapping time includes the driving time and the predicted queuing time of the battery swapping vehicle to the candidate battery swapping station. The battery swapping station recommendation module is used to:

[0082] Sort the candidate battery swap stations with a predicted number of available batteries greater than or equal to 0 by battery swapping time from low to high to generate a first battery swap station recommendation list;

[0083] Sort the candidate battery swap stations with a predicted number of available batteries less than 0 by battery swapping time from low to high, and generate a second battery swap station recommendation list;

[0084] After joining the second recommended battery swap station list with the first recommended battery swap station list, a recommended battery swap station list is obtained;

[0085] Recommend battery swap stations to the driver of the battery swap vehicle according to the battery swap station recommendation list.

[0086] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-described method for recommending a battery swap station when executing the computer program.

[0087] The present invention also provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the method for recommending a battery swap station as described above are implemented.

[0088] On the basis of conforming to the common sense in this field, the above-mentioned preferred conditions can be arbitrarily combined to obtain the preferred embodiments of the present invention.

[0089] The positive progressive effect of the present invention is that the present invention can estimate the estimated operating information of the candidate battery swap station when the vehicle arrives at the candidate battery swap station, and provide users with battery swap station recommendations based on the estimated operating information. The user does not need to predict the situation after arriving at the candidate battery swap station, thereby easily avoiding misjudgment and improving the accuracy of battery swap station recommendations. BRIEF DESCRIPTION OF THE DRAWINGS

[0090] Figure 1 This is a flowchart of a method for recommending a battery swap station according to embodiment 1 of the present invention;

[0091] Figure 2 This is a flowchart of another method for recommending a battery swap station according to embodiment 1 of the present invention;

[0092] Figure 3 This is a flowchart of step 12 of Example 1 of the present invention;

[0093] Figure 4 This is a flowchart of step 123 of Example 1 of the present invention;

[0094] Figure 5 This is a flowchart of step 126 of Example 1 of the present invention;

[0095] Figure 6 This is a flowchart of another method for recommending a battery swap station according to embodiment 1 of the present invention;

[0096] Figure 7 This is a module schematic diagram of a processing device recommended for a battery swap station according to embodiment 2 of the present invention;

[0097] Figure 8 This is a schematic structural diagram of an electronic device according to embodiment 3 of the present invention. DETAILED DESCRIPTION

[0098] The present invention is further described below by way of examples, but the present invention is not limited to the scope of the examples.

[0099] Example 1

[0100] Figure 1 A method for recommending a battery swap station according to this embodiment is shown. The method includes the following steps:

[0101] Step 11: Obtain candidate battery swap stations that match the battery swap vehicle.

[0102] Step 12: Estimate the estimated operating information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current location.

[0103] Step 13: Recommend battery swap stations to drivers of battery swap vehicles based on estimated operating information.

[0104] The method of this embodiment can estimate the estimated operating information of the candidate battery swap station when the vehicle arrives at the candidate battery swap station, and provide users with battery swap station recommendations based on the estimated operating information. The user does not need to predict the situation after arriving at the candidate battery swap station, which makes it easy to avoid misjudgment and improve the accuracy of battery swap station recommendations.

[0105] In one practicable manner, step 11 may specifically include: Figure 2 As shown:

[0106] Step 111: Obtain alternative battery swap stations within the target search range that match the model of the battery swap vehicle.

[0107] Step 112: Based on the remaining battery power of the battery swapping vehicle, the reference mileage and the driving path of the battery swapping vehicle from each alternative battery swapping station, select the candidate battery swapping stations that the battery swapping vehicle can reach based on the remaining battery power from the alternative battery swapping stations.

[0108] Among them, the target search range can be an area range that is no more than a preset distance from the current position of the battery swap vehicle. The current position of the battery swap vehicle can be obtained through the GPS or other positioning devices on the vehicle, or through the GPS or other positioning modules of the driving user terminal. The alternative battery swap station that matches the model of the battery swap vehicle can support the provision of battery swap services for the battery swap vehicle of that model. The remaining battery power can be obtained from the battery management system (BMS) of the battery swap vehicle. The reference mileage per kilowatt-hour is a reference quantity based on the mileage per kilowatt-hour, which can be directly equal to the mileage per kilowatt-hour, or it can be a reference quantity after a certain degree of increase or decrease in the mileage per kilowatt-hour. The driving path of the battery swap vehicle from each alternative battery swap station can be obtained by calling the interface of the navigation map software.

[0109] In one practicable approach, the mileage per kWh is the distance a battery-swap vehicle travels when the battery pack consumes a unit of electricity (1 kWh), which can be determined based on the mileage of the battery-swap vehicle and the cumulative power consumption of the battery pack within a certain period of time. The mileage per kWh of battery-swap vehicles varies for different vehicle types.

[0110] Step 112 may specifically include:

[0111] Estimate the remaining cruising range of the battery-swapped vehicle based on the remaining battery charge and the reference mileage; where remaining cruising range = remaining battery charge / reference mileage, or a corrected value based on this calculated value;

[0112] Determine the area that the battery swap vehicle can reach before running out of power based on the remaining range and the current location of the battery swap vehicle;

[0113] Obtain the driving path of the battery swapping vehicle from each alternative battery swapping station;

[0114] Alternative battery swap stations whose driving routes are within the regional range are selected as candidate battery swap stations.

[0115] Through steps 111 to 112, the battery swap stations that match the model of the battery swap vehicle within the target search range are selected as alternative battery swap stations, and the alternative battery swap stations that the battery swap vehicle can reach based on the remaining battery power are selected as candidate battery swap stations. The battery swap stations that the battery swap vehicle can reach and have matching batteries available for replacement are screened out. In this way, when recommending battery swap stations to driving users based on the screened out battery swap stations, it can be guaranteed that the battery swap stations recommended to driving users are all battery swap stations that they can reach and have batteries available for replacement, ensuring that the battery swap users' battery swap needs are met.

[0116] In one feasible manner, step 112 may also include: based on the remaining battery power of the battery swap vehicle, the reference mileage, the driving path of the battery swap vehicle from each alternative battery swap station, and the operating status of the alternative battery swap station when the battery swap vehicle arrives at the alternative battery swap station, selecting from the alternative battery swap stations the candidate battery swap stations that the battery swap vehicle can reach based on the remaining battery power.

[0117] The operating status includes "in operation" and "suspended operation." The operating status of an alternative battery swap station can be determined based on its operating hours. A battery swap station will only be selected as a candidate if it is in operation when the battery swap vehicle arrives. This prevents battery swap users from arriving at a station that is temporarily closed and unable to swap batteries.

[0118] In one practicable manner, the estimated operation information includes the predicted queue number of battery swapping vehicles when they arrive at the candidate battery swapping station. Step 12 may include:

[0119] Perform the following steps for each candidate battery swap station: Figure 3 As shown:

[0120] Step 121: Estimate the driving time for the battery swapping vehicle to reach the candidate battery swapping station.

[0121] Step 122: Estimate the number of battery swaps required at the candidate battery swap station within the driving time.

[0122] Step 123: Estimate the actual number of battery swaps at the candidate battery swap station during the driving time.

[0123] Step 124: estimating the number of batteries available at the candidate battery swap station when the battery swap vehicle arrives at the candidate battery swap station;

[0124] Step 125: Determine the arrival queue number of battery swapping vehicles when they arrive at the candidate battery swapping station based on the required number of battery swapping and the actual number of battery swapping.

[0125] Step 126: Determine the predicted queue number based on the arrival queue number and the predicted number of available batteries.

[0126] Available in this embodiment refers to the availability of battery-swap vehicle models. If the same candidate battery-swap station can support battery swapping for multiple models, then the predicted number of available batteries refers to the predicted number of available batteries available for the battery-swap vehicle models.

[0127] In step 121, estimating the travel time for the battery swapping vehicle to reach the candidate battery swapping station may include:

[0128] Obtain the driving route of the battery swap vehicle to the candidate battery swap station;

[0129] Determine the total travel distance of the route and the length of each congestion state section and congestion state coefficient on the route;

[0130] The driving time for the battery swap vehicle to the candidate battery swap station is determined based on the total driving distance, the length of each congested section on the driving route, and the congestion coefficient.

[0131] Among them, a possible calculation formula for driving time is:

[0132]

[0133] Where T represents the driving time, i represents the number of traffic congestion states, and k i represents the congestion state coefficient (unknown = 1.0 / unimpeded = 1.0 / slow traffic = 1.5 / congested = 2.1 / severe congestion = 2.5), T i Indicates the corresponding k i The length of the road section, v represents the driving speed of the battery-swapping vehicle under unobstructed conditions.

[0134] In step 122, the required number of battery swaps can be the larger of the current queue number of the candidate battery swap station and the historical reference number of battery swaps from the current moment to the arrival of the battery swap vehicle (such as the average number of battery swaps at the candidate battery swap station during the current period every day in the past month).

[0135] In step 124, a possible calculation formula for predicting the number of available batteries is: predicted number of available batteries = total number of available batteries - estimated number of battery replacements, or a corrected value based on the calculated value.

[0136] In step 125, a possible calculation formula for the number of queues at the station is: number of queues at the station = number of required battery swaps - actual number of battery swaps, or a corrected value based on the calculated value.

[0137] In this embodiment, the estimated operating information of the candidate battery swap station is reflected at least by the predicted queue number when the battery swap vehicle arrives at the candidate battery swap station. In this way, when recommending a battery swap station based on the estimated operating information of the candidate battery swap station, it is possible to consider recommending battery swap users to go to relatively idle stations based on the predicted queue number, which can not only quickly meet the battery swap users' battery swap needs, but also balance the operating load of peak stations.

[0138] In one practicable manner, step 123 may include, for example, Figure 4 As shown:

[0139] Estimate the ideal number of battery swaps within the driving time at the candidate battery swap station; and,

[0140] When the predicted number of available batteries is greater than or equal to 0, the smaller of the ideal number of battery swaps and the required number of battery swaps is selected as the actual number of battery swaps;

[0141] When the predicted number of available batteries is less than 0, the smaller of the ideal number of battery swaps and the total number of available batteries is selected as the actual number of battery swaps; the total number of available batteries is related to the current real-time number of available batteries at the candidate battery swap station and the number of fully charged batteries added to the candidate battery swap station during the driving time.

[0142] Among them, one possible way to relate the total number of available batteries to the real-time number of available batteries and the number of newly added fully charged batteries can be total number of available batteries = real-time number of available batteries + number of newly added fully charged batteries, or a correction value based on this calculated value. The real-time number of available batteries and the number of newly added fully charged batteries can be obtained through the battery charging management system of the candidate battery swap station. The number of newly added fully charged batteries can be equal to the number of batteries whose remaining charging time is less than the driving time among the currently non-fully charged batteries at the candidate battery swap station, or equal to a correction value based on this value.

[0143] The above steps fully consider the specific algorithms for estimating the actual number of battery swaps in different scenarios where the predicted number of available batteries is greater than or equal to 0 and less than 0, thereby improving the accuracy of estimating the actual number of battery swaps.

[0144] In one practicable manner, the estimated ideal number of battery swaps at the candidate battery swap station within the driving time in step 123 may include:

[0145] Obtain the single battery swap duration and the number of battery swap channels at the candidate battery swap station;

[0146] Based on driving time, single battery swap duration, and number of battery swap channels, estimate the ideal number of battery swaps at the candidate battery swap station within the driving time.

[0147] Among them, the duration of a single battery swap is the duration it takes for a candidate battery swap station to complete a battery swap. It can be a standard value or the average duration of multiple actual battery swaps. The number of battery swap channels indicates the number of battery swaps that can be performed simultaneously at the candidate battery swap station. A possible calculation formula for the ideal number of battery swaps is: Ideal number of battery swaps = driving time * number of battery swap channels / single battery swap duration. Of course, the calculation formula for the ideal number of battery swaps is not limited to this. It can also be calculated using the aforementioned calculation formula after further correction or introduction of error for driving time and single battery swap duration, or it can be further corrected or introduced based on the aforementioned calculation results.

[0148] The above steps provide a specific method for estimating the ideal number of battery replacements, which has the advantage of accurate estimation.

[0149] In one practicable manner, step 126 may specifically include: Figure 5 As shown:

[0150] When the predicted number of available batteries is greater than 0 and the number of arrival queues is less than or equal to 0, the predicted queue number is determined to be equal to 0;

[0151] When the predicted number of available batteries is greater than 0 and the number of arrival queues is greater than 0, the number of arrival queues is used as the predicted number of queues.

[0152] The above steps fully consider the specific algorithm for determining the predicted queue number under different scenarios where the predicted number of available batteries is greater than 0 and the arrival queue number is less than or equal to 0 or greater than 0, thereby improving the accuracy of estimating the predicted queue number.

[0153] In one feasible manner, the estimated operation information may also include the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is equal to 0; when the predicted queue number is the arrival queue number, the predicted queue time is determined based on the arrival queue number, the single battery swapping time and the number of battery swapping channels at the candidate battery swapping station.

[0154] Among them, one possible calculation formula for predicting queue time is: predicted queue time = number of queues at the station * single battery swap time / number of battery swap channels. Of course, the calculation formula for predicting queue time is not limited to this. The number of queues at the station and the single battery swap time can be further corrected or an error can be introduced to calculate using the above calculation formula, or the above calculation result can be further corrected or an error can be introduced.

[0155] The above steps fully consider the specific algorithm for determining the predicted queue duration in different scenarios where the predicted queue number is equal to 0 or the arrival queue number, thereby improving the accuracy of estimating the predicted queue duration.

[0156] In one practicable manner, step 126 may include:

[0157] When the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is less than or equal to 0, the predicted queue number is determined to be equal to 0;

[0158] When the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is greater than 0, the number of arrival queues is used as the predicted number of queues.

[0159] The above steps fully consider the specific algorithm for determining the predicted queue number under different scenarios where the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is less than or equal to 0 or greater than 0, and provide the accuracy of estimating the predicted queue number.

[0160] In one feasible manner, the estimated operation information may also include the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is the remaining charging time of the battery that is not fully charged and has the highest power within the driving time; when the predicted queue number is the arrival queue number, the predicted queue time is the smaller of the first time and the second time, the first time is determined based on the arrival queue number, the single battery swap time and the number of battery swapping channels of the candidate battery swapping station, and the second time is the (k+1)th remaining charging time of the currently uncharged battery sorted from low to high according to the remaining charging time, where k is the arrival queue number.

[0161] Among them, a possible calculation formula for the first duration is: first duration = number of queues at the station * single battery swap duration / number of battery swap channels. Of course, the calculation formula for the first duration is not limited to this. The number of queues at the station and the single battery swap duration can be further corrected or an error can be introduced to calculate the result using the above calculation formula, or the above calculation result can be further corrected or an error can be introduced to calculate the result.

[0162] The above steps fully consider the specific algorithm for determining the predicted queue duration in different scenarios where the predicted queue number is equal to 0 or the arrival queue number, thereby improving the accuracy of estimating the predicted queue duration.

[0163] In one practicable manner, the estimated operation information includes the predicted number of available batteries and the battery swapping time when the battery swapping vehicle arrives at the candidate battery swapping station. The battery swapping time includes the driving time and the predicted queuing time of the battery swapping vehicle to the candidate battery swapping station. Step 13 may specifically include, for example, Figure 6 As shown:

[0164] Step 131: Sort candidate battery swap stations with a predicted number of available batteries greater than or equal to 0 by battery swapping time from low to high to generate a first recommended battery swap station list;

[0165] Step 132: Sort the candidate battery swap stations with a predicted number of available batteries less than 0 by battery swapping time from low to high, and generate a second recommended battery swap station list;

[0166] Step 133: Join the second recommended battery swap station list to the first recommended battery swap station list to obtain a recommended battery swap station list;

[0167] Step 134: Recommend battery swap stations to the driver of the battery swap vehicle according to the recommended battery swap station list.

[0168] Through the above steps, the method guides the user to prioritize the candidate battery swap stations with a predicted number of available batteries greater than or equal to 0 and the shortest battery swap time through the battery swap station recommendation list, helping the user to quickly complete the battery swap.

[0169] In one practicable embodiment, when recommending a battery swap station to a driver of a battery swap vehicle based on the estimated operation information, the battery swap station information of the recommended battery swap station may also be output. The battery swap station information includes but is not limited to at least one of the predicted number of available batteries, the predicted number of queues, and the predicted queue time.

[0170] Example 2

[0171] Figure 7 A processing device for recommending battery swap stations in accordance with the present embodiment is shown. The device comprises: a battery swap station acquisition module 21, an operation estimation module 22, and a battery swap station recommendation module 23. The battery swap station acquisition module 21 is used to acquire candidate battery swap stations that match the battery swap vehicle. The operation estimation module 22 is used to separately estimate the estimated operation information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from its current location. The battery swap station recommendation module 23 is used to recommend battery swap stations to the driver of the battery swap vehicle based on the estimated operation information.

[0172] In one practicable manner, the battery swap station acquisition module 21 is used to:

[0173] Obtain alternative battery swap stations within the target search range that match the model of the battery swap vehicle;

[0174] According to the remaining battery power of the battery swap vehicle, the reference mileage and the driving path of the battery swap vehicle from each alternative battery swap station, the candidate battery swap stations that the battery swap vehicle can reach based on the remaining battery power are screened out from the alternative battery swap stations.

[0175] In one practicable manner, the estimated operation information includes the predicted queue number of battery swapping vehicles when they arrive at the candidate battery swapping station; the operation estimation module 22 is used to:

[0176] Implement the following functions for each candidate battery swap station:

[0177] Estimate the travel time for the battery swapping vehicle to reach the candidate battery swapping station;

[0178] Estimate the number of battery swaps required at the candidate battery swap station within the driving time;

[0179] Estimate the actual number of battery swaps at the candidate battery swap station within the driving time;

[0180] estimating the number of batteries available at the candidate battery swap station when the battery swap vehicle arrives at the candidate battery swap station;

[0181] Determine the arrival queue number of battery swapping vehicles when they arrive at the candidate battery swapping station based on the required number of battery swapping and the actual number of battery swapping.

[0182] The predicted queue number is determined based on the number of queues at the station and the predicted number of available batteries.

[0183] In one practicable method, estimating the actual number of battery swaps at a candidate battery swap station during driving time includes:

[0184] Estimate the ideal number of battery swaps within the driving time at the candidate battery swap station;

[0185] When the predicted number of available batteries is greater than or equal to 0, the smaller of the ideal number of battery swaps and the required number of battery swaps is selected as the actual number of battery swaps;

[0186] When the predicted number of available batteries is less than 0, the smaller of the ideal number of battery swaps and the total number of available batteries is selected as the actual number of battery swaps; the total number of available batteries is related to the current real-time number of available batteries at the candidate battery swap station and the number of fully charged batteries added to the candidate battery swap station during the driving time.

[0187] In one feasible method, estimating the ideal number of battery swaps at a candidate battery swap station within the driving time includes:

[0188] Obtain the single battery swap duration and the number of battery swap channels at the candidate battery swap station;

[0189] Based on driving time, single battery swap duration, and number of battery swap channels, estimate the ideal number of battery swaps at the candidate battery swap station within the driving time.

[0190] In one practicable manner, determining a predicted queue number based on the number of arrival queues and the predicted number of available batteries includes:

[0191] When the predicted number of available batteries is greater than 0 and the number of arrival queues is less than or equal to 0, the predicted queue number is determined to be equal to 0;

[0192] When the predicted number of available batteries is greater than 0 and the number of arrival queues is greater than 0, the number of arrival queues is used as the predicted number of queues.

[0193] In one feasible method, the estimated operation information also includes the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is equal to 0; when the predicted queue number is the arrival queue number, the predicted queue time is determined based on the arrival queue number, the single battery swapping time and the number of battery swapping channels at the candidate battery swapping station.

[0194] In one practicable manner, determining a predicted queue number based on the number of arrival queues and the predicted number of available batteries includes:

[0195] When the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is less than or equal to 0, the predicted queue number is determined to be equal to 0;

[0196] When the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is greater than 0, the number of arrival queues is used as the predicted number of queues.

[0197] In one feasible method, the estimated operation information also includes the predicted queuing time when the battery swapping vehicle arrives at the candidate battery swapping station; when the predicted queue number is equal to 0, the predicted queue time is the remaining charging time of the battery that is not fully charged and has the highest power within the driving time; when the predicted queue number is the arrival queue number, the predicted queue time is the smaller of the first time and the second time. The first time is determined based on the arrival queue number, the single battery swap time and the number of battery swapping channels at the candidate battery swapping station. The second time is the (k+1)th remaining charging time of the currently uncharged battery sorted from low to high according to the remaining charging time, where k is the arrival queue number.

[0198] In one practicable manner, the estimated operational information includes the predicted number of available batteries and the battery swapping time required when the battery swapping vehicle arrives at the candidate battery swapping station. The battery swapping time includes the driving time and the predicted waiting time required to reach the candidate battery swapping station. The battery swapping station recommendation module is used to:

[0199] The candidate battery swap stations with a predicted number of available batteries greater than or equal to 0 are sorted from low to high according to the battery swapping time to generate a first recommended list of battery swap stations;

[0200] The candidate battery swap stations with a predicted number of available batteries less than 0 are sorted from low to high according to the battery swap time, and a second recommended battery swap station list is generated;

[0201] After joining the second recommended battery swap station list to the first recommended battery swap station list, a recommended battery swap station list is obtained;

[0202] Recommend battery swap stations to drivers of battery swap vehicles according to the recommended battery swap station list.

[0203] The device of this embodiment can estimate the estimated operating information of the candidate battery swap station when the vehicle arrives at the candidate battery swap station, and provide users with battery swap station recommendations based on the estimated operating information. The user does not need to predict the situation after arriving at the candidate battery swap station, which makes it easy to avoid misjudgment and improve the accuracy of battery swap station recommendations.

[0204] Example 3

[0205] An embodiment of the present invention also provides an electronic device, which can be expressed in the form of a computing device (for example, a server device), including a memory, a processor, and a computer program stored in the memory and run on the processor, wherein when the processor executes the computer program, it can implement any one of the processing methods for recommending a battery swap station in Example 1 of the present invention.

[0206] Figure 8 The hardware structure diagram of this embodiment is shown in FIG. Figure 8 As shown, the electronic device 9 specifically includes:

[0207] At least one processor 91, at least one memory 92, and a bus 93 for connecting different system components (including the processor 91 and the memory 92), wherein:

[0208] The bus 93 includes a data bus, an address bus, and a control bus.

[0209] The memory 92 includes a volatile memory, such as a random access memory (RAM) 921 and / or a cache memory 922 , and may further include a read-only memory (ROM) 923 .

[0210] Memory 92 also includes a program / utility 925 having a set (at least one) of program modules 924, such program modules 924 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0211] The processor 91 executes various functional applications and data processing by running the computer program stored in the memory 92, such as any one of the methods for recommending a battery swap station in Embodiment 1 of the present invention.

[0212] The electronic device 9 can further communicate with one or more external devices 94 (e.g., a keyboard, pointing device, etc.). Such communication can be performed via an input / output (I / O) interface 95. Furthermore, the electronic device 9 can communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 96. The network adapter 96 communicates with other modules of the electronic device 9 via a bus 93. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with the electronic device 9, including but not limited to microcode, device drivers, redundant processors, external disk drive arrays, RAID (RAID) systems, tape drives, and data backup storage systems.

[0213] It should be noted that although several units / modules or sub-units / modules of the electronic device are mentioned in the above detailed description, this division is merely exemplary and not mandatory. In fact, depending on the embodiment of the present application, the features and functions of two or more units / modules described above can be embodied in one unit / module. Conversely, the features and functions of one unit / module described above can be further divided and embodied by multiple units / modules.

[0214] Example 6

[0215] An embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the steps of any one of the methods for recommending a battery swap station in embodiment 1 of the present invention are implemented.

[0216] Specifically, the readable storage medium may include but is not limited to: a portable disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0217] In a possible implementation, the present invention can also be implemented in the form of a program product, which includes program code. When the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps of any one of the processing methods for recommending a battery swap station in Example 1 of the present invention.

[0218] The program code for executing the present invention may be written in any combination of one or more programming languages, and the program code may be executed entirely on the user device, partially on the user device, as an independent software package, partially on the user device and partially on a remote device, or entirely on the remote device.

[0219] Although specific embodiments of the present invention have been described above, those skilled in the art will appreciate that these are merely illustrative and that the scope of the present invention is defined by the appended claims. Those skilled in the art may make various changes or modifications to these embodiments without departing from the principles and essence of the present invention, and such changes and modifications are intended to fall within the scope of the present invention.

Claims

1. A method for recommending a battery swap station, characterized in that: include: Obtain candidate battery swap stations that match the battery swap vehicle; Respectively estimating the estimated operating information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current location; recommending a battery swap station to the driver of the battery swap vehicle based on the estimated operation information; The estimated operation information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current location includes: For each candidate battery swap station, perform the following steps: estimating the driving time for the battery swapping vehicle to reach the candidate battery swapping station; estimating the number of battery swaps required at the candidate battery swap station within the driving time; Estimating the actual number of battery swaps at the candidate battery swap station within the driving time; estimating the number of batteries available at the candidate battery swap station when the battery swap vehicle arrives at the candidate battery swap station; Determine the arrival queue number of the battery swapping vehicle when it arrives at the candidate battery swapping station based on the required number of battery swapping and the actual number of battery swapping; The predicted queue number is determined according to the arrival queue number and the predicted number of available batteries.

2. The method for recommending a battery swap station according to claim 1, wherein: The step of obtaining a candidate battery swap station that matches the battery swap vehicle includes: Obtaining alternative battery swap stations within the target search range that match the model of the battery swap vehicle; According to the remaining battery power of the battery swap vehicle, the reference mileage and the driving path of the battery swap vehicle from each of the alternative battery swap stations, candidate battery swap stations that can be reached by the battery swap vehicle based on the remaining battery power are screened out from the alternative battery swap stations.

3. The method for recommending a battery swap station according to claim 1, wherein: The estimated actual number of battery swaps at the candidate battery swap station during the driving time includes: estimating the ideal number of battery swaps at the candidate battery swap station within the driving time; When the predicted number of available batteries is greater than or equal to 0, the smaller of the ideal number of battery swaps and the required number of battery swaps is selected as the actual number of battery swaps; When the predicted number of available batteries is less than 0, the smaller of the ideal number of battery swaps and the total number of available batteries is selected as the actual number of battery swaps; the total number of available batteries is related to the current real-time number of available batteries at the candidate battery swap station and the number of newly added fully charged batteries at the candidate battery swap station during the driving time.

4. The method for recommending a battery swap station according to claim 3, wherein: The estimated ideal number of battery swaps at the candidate battery swap station within the driving time includes: Obtaining the single battery swapping time of the candidate battery swapping station and the number of battery swapping channels of the candidate battery swapping station; According to the driving time, the duration of a single battery swap and the number of battery swap channels, the ideal number of battery swaps at the candidate battery swap station within the driving time is estimated.

5. The method for recommending a battery swap station according to claim 3, wherein: The step of determining the predicted queue number based on the arrival queue number and the predicted number of available batteries includes: When the predicted number of available batteries is greater than 0 and the arrival queue number is less than or equal to 0, determining that the predicted queue number is equal to 0; When the predicted number of available batteries is greater than 0 and the number of arrival queues is greater than 0, the number of arrival queues is used as the predicted number of queues.

6. The method for recommending a battery swap station according to claim 5, wherein: The estimated operation information also includes the predicted queuing time when the battery-swapping vehicle arrives at the candidate battery-swapping station; when the predicted queue number is equal to 0, the predicted queue time is equal to 0; when the predicted queue number is the arrival queue number, the predicted queue time is determined based on the arrival queue number, the single battery-swapping time and the number of battery-swapping channels of the candidate battery-swapping station.

7. The method for recommending a battery swap station according to claim 4, wherein: The step of determining the predicted queue number based on the arrival queue number and the predicted number of available batteries includes: When the predicted number of available batteries is less than or equal to 0 and the number of arrival queues is less than or equal to 0, determining that the predicted queue number is equal to 0; When the predicted number of available batteries is less than or equal to 0 and the arrival queue number is greater than 0, the arrival queue number is used as the predicted queue number.

8. The method for recommending a battery swap station according to claim 7, wherein: The estimated operation information also includes the predicted queuing time when the battery-swapping vehicle arrives at the candidate battery-swapping station; when the predicted queue number is equal to 0, the predicted queue time is the remaining charging time of the battery that is not fully charged and has the highest charge within the driving time; when the predicted queue number is the arrival queue number, the predicted queue time is the smaller of the first time and the second time. The first time is determined based on the arrival queue number, the single battery-swapping time and the number of battery-swapping channels of the candidate battery-swapping station. The second time is the (k+1)th remaining charging time of the currently uncharged battery sorted from low to high according to the remaining charging time, where k is the arrival queue number.

9. The method for recommending a battery swap station according to claim 1, wherein: The estimated operation information also includes the battery swapping time when the battery swapping vehicle arrives at the candidate battery swapping station, and the battery swapping time includes the driving time and the predicted queuing time of the battery swapping vehicle to the candidate battery swapping station; The recommending a battery swap station to the driver of the battery swap vehicle based on the estimated operation information includes: Sort the candidate battery swap stations with a predicted number of available batteries greater than or equal to 0 by battery swapping time from low to high to generate a first battery swap station recommendation list; Sort the candidate battery swap stations with a predicted number of available batteries less than 0 by battery swapping time from low to high, and generate a second battery swap station recommendation list; After joining the second recommended battery swap station list with the first recommended battery swap station list, a recommended battery swap station list is obtained; Recommend battery swap stations to the driver of the battery swap vehicle according to the battery swap station recommendation list.

10. A processing device for recommending a battery swap station, characterized in that: include: The battery swap station acquisition module is used to obtain candidate battery swap stations that match the battery swap vehicle; An operation estimation module, configured to respectively estimate the estimated operation information of each candidate battery swap station when the battery swap vehicle arrives at each candidate battery swap station from the current location; A battery swap station recommendation module, configured to recommend a battery swap station to the driver of the battery swap vehicle based on the estimated operation information; The operation estimation module is used to implement the following functions for each candidate battery swap station: estimate the driving time and predicted number of available batteries for the battery swap vehicle to arrive at the candidate battery swap station; estimate the required number of battery swaps at the candidate battery swap station within the driving time; estimate the actual number of battery swaps at the candidate battery swap station within the driving time; determine the arrival queue number of the battery swap vehicle when it arrives at the candidate battery swap station based on the required number of battery swaps and the actual number of battery swaps; determine the predicted queue number based on the arrival queue number and the predicted number of available batteries.

11. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the method for recommending a battery swap station according to any one of claims 1 to 9 is implemented.

12. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method for recommending a battery swap station according to any one of claims 1 to 9 are implemented.

Images