Battery swapping method and device for shared vehicle, computer device and readable storage medium

Abstract

The application provides a battery replacement method and device for a shared vehicle, computer equipment and a readable storage medium. The battery replacement method for the shared vehicle comprises the following steps: receiving a vehicle use request of all first user terminals in a continuous time period; classifying all vehicle use requests according to a vehicle use starting point to obtain multiple classification types; determining a current parking number in a preset range according to a set center; determining a current number of vehicles to be replaced according to the set center, a vehicle use end point and the current parking number; determining a battery replacement priority of the current vehicles to be replaced according to a number of vehicle use requests corresponding to the set center, the current number of vehicles to be replaced and a vehicle use time; determining a predicted battery replacement time according to the battery replacement priority, and sending the predicted battery replacement time to the first user terminal; if the determination of the reserved battery replacement information sent by the first user terminal is received, a locking instruction is sent to the vehicle to be replaced. The vehicle is replaced according to the battery replacement priority of the vehicle to be replaced, and the utilization rate and the income of the vehicle are improved.

Description

Technical Field

[0001] This invention relates to the field of shared vehicles, and more particularly to a battery swapping method, apparatus, computer equipment, and readable storage medium for shared vehicles. Background Technology

[0002] Currently, the battery swapping method for shared vehicles involves staff swapping batteries in batches of low-battery vehicles across multiple parking lots based on swapping orders and customized swapping routes. This method may result in situations where parking lots along the swapping route experience lower demand, while parking lots along the route later have users waiting for vehicles, leading to low utilization rates of shared vehicles and consequently reduced revenue. Therefore, improving the utilization rate of shared vehicles, and thus increasing their revenue, is a pressing technical problem that needs to be solved. Summary of the Invention

[0003] In view of this, the purpose of the present invention is to overcome the shortcomings of the prior art and provide a battery swapping method, device, computer equipment and readable storage medium for shared vehicles, so as to solve the problem of low utilization rate of shared vehicles.

[0004] In a first aspect, this application provides a battery swapping method for shared vehicles, applied to a server, the method comprising:

[0005] Receive vehicle requests from all first user terminals within a continuous time period, wherein the vehicle request includes vehicle usage time, vehicle usage start point, and vehicle usage destination;

[0006] All the car-hailing requests are classified according to the car-hailing origin to obtain multiple classification types. Among them, the aggregation radius of the car-hailing origins of car-hailing requests of the same classification type forms a car-hailing origin range set within a preset value. The car-hailing origin range set has a set center.

[0007] The current number of parking spaces within a preset range is determined based on the collection center;

[0008] The number of vehicles currently waiting to be swapped is determined based on the collection center, the vehicle destination, and the current number of parked vehicles;

[0009] The battery swapping priority of the current vehicle to be swapped is determined based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, and the usage time.

[0010] Based on the battery swapping priority, the estimated battery swapping time is determined and sent to the first user terminal;

[0011] If the system receives confirmation of a battery swap reservation from the first user terminal, it sends a locking command to the vehicle to be swapped.

[0012] Based on the battery swapping priority of the vehicles to be swapped, the vehicles are swapped to avoid the vehicles requested by users having insufficient battery power to reach the user's terminal, thereby improving the utilization rate of the vehicles and thus increasing the revenue of the vehicles.

[0013] In conjunction with the first aspect, in the first possible implementation, the aggregation radius of the starting point for ride-hailing requests of the same category is determined in the following way:

[0014] Determine the first starting point for vehicle requests of the same category;

[0015] Taking the first vehicle usage starting point as the center, determine the second vehicle usage starting point that is closest to the first vehicle usage starting point within the preset value;

[0016] Taking the center of the first vehicle usage starting point and the second vehicle usage starting point as the center, determine the third vehicle usage starting point that is closest to the center of the first vehicle usage starting point and the second vehicle usage starting point within the preset value;

[0017] Repeat the loop steps until there are no other vehicle starting points within the preset value;

[0018] The cyclic steps include:

[0019] Based on the centroid of the polygon formed by all vehicle usage origins, determine the vehicle usage origin closest to the centroid of the polygon within the preset value.

[0020] Based on the centroid of the polygon formed by all vehicle usage origins, determine the vehicle usage origin closest to the centroid of the polygon within a preset value, and determine the aggregation radius of vehicle usage origins of the same category type to identify vehicle usage requests of the same category type.

[0021] In conjunction with the first aspect, in the second possible implementation, determining the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, and the usage time includes:

[0022] Based on the distribution of vehicle usage time, vehicle usage time periods are formed;

[0023] Based on the vehicle usage time period, the current vehicles waiting to be swapped are sorted by swapping priority for the first time to obtain the first swapping priority sequence. The closer the vehicle usage time period, the higher the swapping priority.

[0024] A second battery swapping priority ranking is performed based on the number of vehicles currently waiting to swap batteries within the same usage time period to obtain a second battery swapping priority sequence. The more vehicles currently waiting to swap batteries, the higher the battery swapping priority.

[0025] The third battery swap priority ranking is performed based on the number of vehicle requests corresponding to the same vehicle usage time period and the preset range of the number of vehicles waiting to be swapped, resulting in a third battery swap priority sequence. The more vehicle requests there are, the higher the battery swap priority.

[0026] The battery swapping priority of the current vehicle to be swapped is determined based on the first battery swapping priority sequence, the second battery swapping priority sequence, or the third battery swapping priority sequence.

[0027] The battery swapping priority of the current vehicle is determined based on the first, second, or third battery swapping priority sequence. This priority is then determined according to the user's vehicle usage needs, thereby providing the user with a vehicle with sufficient battery power and improving vehicle utilization.

[0028] In conjunction with the first aspect, in a third possible implementation, the method further includes:

[0029] The parking spots and the number of parking spaces within the preset range are determined based on the collection center.

[0030] The vacancy ratio is determined based on the available parking capacity and the current number of parking spaces.

[0031] The scheduling priority of the parking point is determined based on the number of vehicle requests corresponding to the collection center, the battery swapping priority, and the vacancy ratio.

[0032] Vehicles are dispatched according to the priority of parking spots, which effectively avoids vehicles remaining unlocked and unused for extended periods, thereby improving vehicle utilization.

[0033] In conjunction with the third possible implementation of the first aspect, in the first possible implementation, determining the scheduling priority of the parking point based on the number of vehicle requests corresponding to the collection center, the battery swapping priority, and the vacancy ratio includes:

[0034] Based on the vacancy ratio, the parking spots are sorted by scheduling priority for the first time to obtain a first scheduling priority sequence, wherein the higher the vacancy ratio, the higher the scheduling priority;

[0035] Based on the number of vehicle requests at parking spots with the same vacancy rate, the parking spots are sorted by scheduling priority for the second time to obtain a second scheduling priority sequence, wherein the more vehicle requests there are, the higher the scheduling priority.

[0036] Based on the same vacancy ratio and the battery swapping priority corresponding to the preset range of vehicle usage requests, the parking points are sorted for a third time to obtain a third scheduling priority sequence, wherein the higher the battery swapping priority, the higher the scheduling priority.

[0037] The scheduling priority of the parking point is determined according to the first scheduling priority sequence, the second scheduling priority sequence, or the third scheduling priority sequence.

[0038] Based on the scheduling priority of each parking spot, vehicles are dispatched to the parking spots to ensure that each parking spot can provide a sufficient number of vehicles for users to unlock and use, thereby improving vehicle utilization.

[0039] In conjunction with the first aspect, in the fifth possible implementation, before determining the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, and the usage time, the following is also included:

[0040] The vehicle usage request is assigned to the second user terminal of the battery swapping personnel;

[0041] The relative distance between the second user terminal and the vehicle to be swapped is determined based on the location information of the second user terminal and the location information of the vehicle to be swapped.

[0042] The step of determining the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting for battery swapping, and the usage time includes:

[0043] The battery swapping priority of the current vehicle to be swapped is determined based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting for battery swapping, the usage time, and the relative distance.

[0044] The battery swapping personnel plan the battery swapping routes for the vehicles to be swapped based on their swapping priority, effectively preventing the vehicles requested by users from having insufficient battery power to support their journey to the destination.

[0045] In conjunction with the first aspect, in the sixth possible implementation, after receiving the confirmed battery swap reservation information sent by the first user terminal and sending a locking command to the vehicle to be swapped, the method further includes:

[0046] If a battery swap success message is received from the vehicle to be swapped, a battery swap success reminder instruction is sent to the user's first user terminal.

[0047] If a cancellation request for a reserved vehicle is received from the first user terminal, an unlock command is sent to the vehicle to be swapped and the user's preset virtual items are deducted.

[0048] A battery swap success notification is sent to the user's primary user terminal, indicating that the vehicle requesting unlocking has sufficient battery power to reach the destination. If the current user abandons the unlocking reservation, an unlock command is sent to the vehicle waiting for battery swapping, releasing the lock on the vehicle and allowing other users to request unlocking of the vehicle, thus improving vehicle utilization.

[0049] Secondly, this application provides a battery swapping device for shared vehicles, applied to a server, the device comprising:

[0050] The request receiving module is used to receive vehicle requests from all first user terminals within a continuous time period, wherein the vehicle request includes vehicle usage time, vehicle usage start point and vehicle usage destination;

[0051] The classification module is used to classify all the car-use requests according to the car-use origin to obtain multiple classification types. Among them, the aggregation radius of the car-use origins of car-use requests of the same classification type forms a car-use origin range set within a preset value, and the car-use origin range set has a set center.

[0052] The current parking quantity determination module is used to determine the current parking quantity within a preset range based on the collection center;

[0053] The module for determining the number of vehicles currently waiting to have their batteries swapped is used to determine the number of vehicles currently waiting to have their batteries swapped based on the collection center, the vehicle usage destination, and the current number of parked vehicles.

[0054] The battery swapping priority determination module is used to determine the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, and the usage time.

[0055] The estimated battery swapping time determination module is used to determine the estimated battery swapping time based on the battery swapping priority, and send the estimated battery swapping time to the first user terminal;

[0056] The locking command sending module is used to send a locking command to the vehicle to be swapped if it receives confirmed reservation vehicle information.

[0057] Thirdly, this application provides a computer device, which includes a memory and a processor. The memory stores a computer program, which, when executed by the processor, implements the battery swapping method for shared vehicles as described in the first aspect.

[0058] Fourthly, this application provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the battery swapping method for shared vehicles as described in the first aspect. Attached Figure Description

[0059] To more clearly illustrate the technical solution of the present invention, the accompanying drawings used in the embodiments will be briefly described below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope of protection of the present invention. In the various drawings, similar components are numbered similarly.

[0060] Figure 1 A flowchart of a first battery swapping method for shared vehicles provided by an embodiment of the present invention is shown;

[0061] Figure 2 A flowchart of a second battery swapping method for shared vehicles provided in an embodiment of the present invention is shown;

[0062] Figure 3 A flowchart of a third battery swapping method for shared vehicles provided in an embodiment of the present invention is shown;

[0063] Figure 4 A schematic diagram of the structure of a battery swapping device for shared vehicles provided in an embodiment of the present invention is shown. Detailed Implementation

[0064] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments.

[0065] The components of the embodiments of the invention described and illustrated herein can typically be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0066] In the following, the terms “comprising,” “having,” and their cognates, which may be used in various embodiments of the invention, are intended only to indicate a particular feature, number, step, operation, element, component, or combination thereof, and should not be construed as excluding, firstly, the presence of one or more other features, numbers, steps, operations, elements, components, or combinations thereof, or adding the possibility of one or more features, numbers, steps, operations, elements, components, or combinations thereof.

[0067] Furthermore, the terms "first," "second," and "third" are used only to distinguish descriptions and should not be interpreted as indicating or implying relative importance.

[0068] Unless otherwise specified, all terms used herein (including technical and scientific terms) shall have the same meaning as commonly understood by one of ordinary skill in the art to which the various embodiments of the invention pertain. Terms (such as those defined in commonly used dictionaries) shall be interpreted as having the same meaning as in their contextual meaning in the relevant technical field and shall not be interpreted as having an idealized or overly formal meaning, unless clearly defined in the various embodiments of the invention.

[0069] Example 1

[0070] Please see Figure 1 , Figure 1 A flowchart of a first battery swapping method for shared vehicles provided by an embodiment of the present invention is shown. Figure 1 The battery swapping method used in shared vehicles is applied to servers, including the following steps:

[0071] Step 110: Receive vehicle usage requests from all first user terminals within a continuous time period.

[0072] It's important to understand that the continuous time period is set based on actual needs and is not limited here. The first user terminal can be any terminal device used to send a vehicle request, where the vehicle request includes the usage time, the starting point, and the ending point. Based on all vehicle requests received from the first user terminals within the continuous time period, the user's vehicle usage demand within the continuous time period is determined, and the number of users in the area who need to unlock vehicles is determined.

[0073] Step 120: Classify all the vehicle usage requests according to the vehicle usage origin to obtain multiple classification types.

[0074] Retrieve all ride-hailing origins within a continuous time period, using each origin as a center. Group ride-hailing origins within a preset radius into ride-hailing requests of the same category, forming a set of ride-hailing origin ranges with a set center.

[0075] As an example, the aggregation radius of the origin of ride requests of the same category type is determined as follows:

[0076] Determine the first starting point for vehicle requests of the same category;

[0077] Taking the first vehicle usage starting point as the center, determine the second vehicle usage starting point that is closest to the first vehicle usage starting point within the preset value;

[0078] Taking the center of the first vehicle usage starting point and the second vehicle usage starting point as the center, determine the third vehicle usage starting point that is closest to the center of the first vehicle usage starting point and the second vehicle usage starting point within the preset value;

[0079] Repeat the loop steps until there are no other vehicle starting points within the preset value;

[0080] The cyclic steps include:

[0081] Based on the centroid of the polygon formed by all vehicle usage origins, determine the vehicle usage origin closest to the centroid of the polygon within the preset value.

[0082] It's important to understand that the first starting point for a ride request of the same category is determined based on actual demand and is not limited here. Using the first starting point as the center, we obtain a second starting point that meets the criteria, and / or a third starting point and more starting points that meet the criteria, until no more starting points meet the criteria, i.e., no other starting points within the preset value. Using the centroid of the polygon formed by all starting points as the center, we determine the starting point closest to the centroid of the polygon within the preset value, and determine the aggregation radius of the starting points for ride requests of the same category to identify ride requests of the same category.

[0083] Step 130: Determine the current number of parking spaces within a preset range based on the set center.

[0084] Upon receiving a car-hailing request from a first user terminal, the system retrieves the collection center corresponding to the request. It then determines the preset range of the corresponding collection center and the current number of parked cars within that preset range where the user requesting the car is located.

[0085] As an example, the method also includes:

[0086] The parking spots and the number of parking spaces within the preset range are determined based on the collection center.

[0087] The vacancy ratio is determined based on the available parking capacity and the current number of parking spaces.

[0088] The scheduling priority of the parking point is determined based on the number of vehicle requests corresponding to the collection center, the battery swapping priority, and the vacancy ratio.

[0089] Each parking spot has a set capacity. The vacancy ratio is determined based on the capacity and the current number of vehicles parked, and this ratio is used to determine whether vehicles at the parking spot are idle for extended periods. The scheduling priority of each parking spot is determined based on the number of vehicle requests from the central hub, battery swapping priority, and vacancy ratio. Vehicles are then dispatched according to this priority, effectively preventing vehicles from remaining unlocked and used for extended periods and improving vehicle utilization.

[0090] In an optional example, determining the scheduling priority of the parking spot based on the number of vehicle requests corresponding to the collection center, the battery swapping priority, and the vacancy ratio includes:

[0091] Based on the vacancy ratio, the parking spots are sorted by scheduling priority for the first time to obtain a first scheduling priority sequence, wherein the higher the vacancy ratio, the higher the scheduling priority;

[0092] Based on the number of vehicle requests at parking spots with the same vacancy rate, the parking spots are sorted by scheduling priority for the second time to obtain a second scheduling priority sequence, wherein the more vehicle requests there are, the higher the scheduling priority.

[0093] Based on the same vacancy ratio and the battery swapping priority corresponding to the preset range of vehicle usage requests, the parking points are sorted for a third time to obtain a third scheduling priority sequence, wherein the higher the battery swapping priority, the higher the scheduling priority.

[0094] The scheduling priority of the parking point is determined based on the first scheduling priority sequence, the second scheduling priority sequence, or the third scheduling priority sequence.

[0095] Based on the vacancy ratio, parking spots are sorted by scheduling priority for the first time to obtain a first scheduling priority sequence. The higher the vacancy ratio of a parking spot, the higher the demand for parking, and the higher the corresponding scheduling priority, so as to avoid insufficient vehicles for users to unlock when they arrive at the parking spot.

[0096] For parking spots with the same vacancy rate, a second scheduling priority sequence is obtained by ranking the parking spots according to the number of vehicle usage requests. The more vehicle usage requests, the higher the scheduling priority, ensuring that a sufficient number of vehicles are available for users to unlock and use at each parking spot. A third scheduling priority sequence is obtained based on the battery swapping priority corresponding to a preset range of vehicle usage requests. The higher the battery swapping priority, the higher the scheduling priority, ensuring that unlocked vehicles have sufficient battery power to travel to the user's destination.

[0097] The scheduling priority of parking spots is determined based on the first, second, or third scheduling priority sequence. Vehicles are then dispatched to each parking spot according to its priority to ensure that each spot has a sufficient number of vehicles available for users to unlock and use, thus maximizing vehicle utilization.

[0098] Step 140: Determine the current number of vehicles waiting to be swapped based on the collection center, the vehicle destination, and the current number of parked vehicles.

[0099] Based on the location corresponding to the collection center and the location corresponding to the vehicle destination, the distance to the destination is obtained. Based on the distance to the destination, the number of currently parked vehicles within the preset range, and the current driving distance of each vehicle, the number of vehicles currently waiting to be swapped within the preset range is determined. The current driving distance of each vehicle can be obtained from the vehicle's current battery level, which will not be elaborated here.

[0100] Step 150: Determine the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, and the usage time.

[0101] Specifically, if a vehicle waiting to be unlocked will not be requested for an extended period, it can be classified as having a low battery swapping priority. If a vehicle is requested to be unlocked for a short period and battery swapping is not performed in time, the battery level of the vehicle will be insufficient to sustain the vehicle until its destination when the user requests unlocking it.

[0102] Based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting for battery swapping, and the usage time, the battery swapping priority of the vehicles currently waiting for swapping is determined. Based on the battery swapping priority of the vehicles waiting for swapping, the order of battery swapping and the swapping route are determined to ensure that the battery level of the vehicle requested by the user is sufficient to support travel to the destination.

[0103] As an example, determining the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting for battery swapping, and the usage time includes:

[0104] Based on the distribution of vehicle usage time, vehicle usage time periods are formed;

[0105] Based on the vehicle usage time period, the current vehicles waiting to be swapped are sorted by swapping priority for the first time to obtain the first swapping priority sequence. The closer the vehicle usage time period, the higher the swapping priority.

[0106] A second battery swapping priority ranking is performed based on the number of vehicles currently waiting to swap batteries within the same usage time period to obtain a second battery swapping priority sequence. The more vehicles currently waiting to swap batteries, the higher the battery swapping priority.

[0107] The third battery swap priority ranking is performed based on the number of vehicle requests corresponding to the same vehicle usage time period and the preset range of the number of vehicles waiting to be swapped, resulting in a third battery swap priority sequence. The more vehicle requests there are, the higher the battery swap priority.

[0108] The battery swapping priority of the current vehicle to be swapped is determined based on the first battery swapping priority sequence, the second battery swapping priority sequence, or the third battery swapping priority sequence.

[0109] The usage time period is set based on actual demand and is not limited here. Specifically, if the current time is 5:00, based on the distribution of usage time, two separate usage time periods are created: 5:31 to 6:30 and 6:31 to 7:30. The minimum time interval between the current time and the first usage time period is 31 minutes, and the minimum time interval between the current time and the first usage time period is 91 minutes. To avoid vehicles requesting unlocking during the first usage time period having insufficient battery power to reach their destination, the closer the usage time period, the higher the battery swapping priority; that is, the first usage time period corresponds to a high battery swapping priority.

[0110] The system first obtains the number of vehicles currently waiting for battery swapping within the same usage time period. Then, it performs a second priority ranking based on this number, resulting in a second priority sequence. The more vehicles waiting for swapping in a given hub, the longer the swapping time, and the higher the probability of a user unlocking a vehicle, thus giving it a higher priority. Next, it performs a third priority ranking based on the number of usage requests within the same usage time period and a preset range of vehicles currently waiting for swapping, resulting in a third priority sequence. The more usage requests in a given hub, the higher the probability of a user unlocking a vehicle, and the higher its priority. Finally, it determines the current priority of a vehicle waiting for swapping based on the first, second, or third priority sequence. Based on the user's usage needs, it determines the current priority of the vehicles waiting for swapping, thereby providing users with vehicles that have sufficient battery power.

[0111] Please refer to the following: Figure 2 , Figure 2 A flowchart of a second battery swapping method for shared vehicles provided by an embodiment of the present invention is shown. As an example, before determining the battery swapping priority of the vehicles to be swapped based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently awaiting battery swapping, and the usage time, the method further includes:

[0112] Step 151: Assign the vehicle use request to the second user terminal of the battery swapping personnel.

[0113] It should be understood that the second user terminal can be any terminal device used to receive vehicle usage requests; there are no restrictions here. The battery swapping personnel obtain information about the vehicles to be swapped based on the usage requests received at the second user terminal.

[0114] Step 152: Determine the relative distance between the second user terminal and the vehicle to be swapped based on the location information of the second user terminal and the location information of the vehicle to be swapped.

[0115] The system receives location information from the second user terminal and determines the relative distance between the second user terminal and the vehicle to be swapped based on the location signal of the second terminal and the location information of the vehicle to be swapped. The time it takes for the swapping personnel to travel to the vehicle varies depending on the relative distance between the second user terminal and the vehicle to be swapped.

[0116] Step 150 includes:

[0117] Step 153: Determine the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, the usage time, and the relative distance.

[0118] Based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting for battery swapping, usage time, and relative distance, the battery swapping priority of the vehicles waiting for swapping is determined. Battery swapping personnel then plan the swapping routes for the vehicles waiting for swapping according to their priority, effectively preventing users from requesting unlocked vehicles with insufficient battery power to travel to their destination.

[0119] Step 160: Determine the estimated battery swapping time based on the battery swapping priority, and send the estimated battery swapping time to the first user terminal.

[0120] The battery swapping time varies depending on the vehicle's priority. Specifically, a higher priority vehicle is expected to have a longer swapping time, while a lower priority vehicle is expected to have a shorter swapping time. The estimated swapping time is determined based on the priority and sent to the first user terminal. The user then uses the estimated swapping time received from the first user terminal to determine whether to request unlocking the vehicle.

[0121] Step 170: If the confirmed battery swap reservation information is received from the first user terminal, a locking command is sent to the vehicle to be swapped.

[0122] After receiving the estimated battery swap time, if the user confirms their request to unlock the vehicle to be swapped, the first user terminal sends a confirmation message for the battery swap reservation. Based on the received confirmation message, the system identifies the vehicle to be swapped that needs to be locked and sends a locking command to it. Once the user confirms the unlocking of the vehicle, a locking command is sent to it to prevent other users from unlocking and using the vehicle before the user unlocks it or before the battery is replaced.

[0123] Please refer to the following: Figure 3 , Figure 3A flowchart of a third battery swapping method for shared vehicles provided by an embodiment of the present invention is shown. As an example, after receiving confirmation of a battery swapping reservation information from the first user terminal and sending a locking command to the vehicle to be swapped, the method further includes:

[0124] Step 180: If a battery swap success message is received from the vehicle to be swapped, a battery swap success reminder instruction is sent to the user's first user terminal.

[0125] If the server receives a successful battery swap notification from the vehicle to be swapped, it confirms that the battery swapping personnel have completed the battery replacement. A successful battery swap notification is then sent to the user's primary user terminal, indicating that the vehicle requested to be unlocked has sufficient charge to travel to the destination.

[0126] Step 190: If a request to cancel the vehicle reservation is received from the first user terminal, an unlock command is sent to the vehicle to be swapped and the user's preset virtual items are deducted.

[0127] If the current user abandons the vehicle reservation, a cancellation request is sent to the server via the first user terminal. Based on the cancellation request, the server sends an unlock command to the vehicle to be swapped and deducts the user's preset virtual items. These preset virtual items can be the deposit paid by the user for the vehicle reservation, or a voucher used for the reservation; no specific limitation is made here.

[0128] If the current user abandons the vehicle unlocking reservation, an unlock command is sent to the vehicle waiting for battery swapping to unlock it, so that other users can normally request to unlock the vehicle waiting for battery swapping, thereby improving the utilization rate of the vehicle.

[0129] This application provides a battery swapping method for shared vehicles, applied to a server. The method includes: receiving vehicle usage requests from all first user terminals within a continuous time period; classifying all vehicle usage requests according to the vehicle usage origin to obtain multiple classification types; determining the current number of parked vehicles within a preset range based on a set center; determining the current number of vehicles awaiting battery swapping based on the set center, the vehicle usage destination, and the current number of parked vehicles; determining the battery swapping priority of the vehicles awaiting battery swapping based on the number of vehicle usage requests corresponding to the set center, the current number of vehicles awaiting battery swapping, and the usage time; determining the estimated battery swapping time based on the battery swapping priority and sending the estimated battery swapping time to the first user terminals; and if a confirmation of battery swapping reservation information is received from the first user terminals, sending a locking command to the vehicles awaiting battery swapping. By swapping the batteries of the vehicles according to their priority, the method avoids vehicles requested for unlocking by users having insufficient battery power to reach the user terminals, thereby improving vehicle utilization and ultimately increasing vehicle revenue.

[0130] Example 2

[0131] Please see Figure 4 , Figure 4 A schematic diagram of the structure of a battery swapping device for shared vehicles provided in an embodiment of the present invention is shown. Figure 4 The battery swapping device 200 for shared vehicles is used in the server, and the battery swapping device 200 for shared vehicles includes:

[0132] The request receiving module 210 is used to receive vehicle requests from all first user terminals within a continuous time period, wherein the vehicle request includes vehicle usage time, vehicle usage start point and vehicle usage destination.

[0133] The classification module 220 is used to classify all the car-use requests according to the car-use origin to obtain multiple classification types. Among them, the aggregation radius of the car-use origins of car-use requests of the same classification type forms a car-use origin range set within a preset value, and the car-use origin range set has a set center.

[0134] The current parking quantity determination module 230 is used to determine the current parking quantity within a preset range based on the collection center;

[0135] The current number of vehicles waiting to be swapped is determined by module 240, which is used to determine the current number of vehicles waiting to be swapped based on the collection center, the vehicle destination and the current number of parking spaces.

[0136] The battery swapping priority determination module 250 is used to determine the battery swapping priority of the current battery swapping vehicle based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, and the usage time.

[0137] The estimated battery swapping time determination module 260 is used to determine the estimated battery swapping time based on the battery swapping priority, and send the estimated battery swapping time to the first user terminal;

[0138] The locking instruction sending module 270 is used to send a locking instruction to the vehicle to be swapped if it receives confirmed reservation vehicle information.

[0139] As an example, the battery swapping device 200 for the shared vehicle also includes:

[0140] The first vehicle usage starting point determination module is used to determine the first vehicle usage starting point for vehicle usage requests of the same category.

[0141] The second vehicle usage starting point determination module is used to determine the second vehicle usage starting point that is closest to the first vehicle usage starting point within the preset value, with the first vehicle usage starting point as the center.

[0142] The second vehicle usage starting point determination module is used to determine, within the preset value, a third vehicle usage starting point that is closest to the center of the first vehicle usage starting point and the second vehicle usage starting point, with the center of the first vehicle usage starting point and the second vehicle usage starting point as the center;

[0143] The step loop module is used to repeatedly execute loop steps until there are no other vehicle start points within the preset value;

[0144] The cyclic steps include:

[0145] Based on the centroid of the polygon formed by all vehicle usage origins, determine the vehicle usage origin closest to the centroid of the polygon within the preset value.

[0146] As an example, the battery swapping priority determination module 250 includes:

[0147] The time period submodule is used to generate vehicle usage time periods based on the distribution of vehicle usage time.

[0148] The first battery swapping priority sorting submodule is used to sort the current battery swapping priority of the vehicles to be swapped according to the vehicle usage time period to obtain a first battery swapping priority sequence, wherein the closer the vehicle usage time period, the higher the battery swapping priority.

[0149] The second battery swapping priority sorting submodule is used to sort the battery swapping priorities for the second time based on the number of vehicles currently waiting to be swapped within the same vehicle usage time period, and obtain a second battery swapping priority sequence. The more vehicles currently waiting to be swapped, the higher the battery swapping priority.

[0150] The third battery swapping priority sorting submodule is used to sort the battery swapping priority in the third time according to the number of vehicle requests corresponding to the same vehicle usage time period and the preset range of the number of vehicles to be swapped, so as to obtain the third battery swapping priority sequence. The more vehicle requests there are, the higher the battery swapping priority.

[0151] The first battery swapping priority submodule is used to determine the battery swapping priority of the current vehicle to be swapped based on the first battery swapping priority sequence, the second battery swapping priority sequence, or the third battery swapping priority sequence.

[0152] As an example, the battery swapping device 200 for the shared vehicle also includes:

[0153] The parking spot determination module is used to determine the parking spots and the number of parking spaces that can be accommodated within the preset range based on the collection center;

[0154] A vacancy ratio determination module is used to determine the vacancy ratio based on the number of parking spaces that can be accommodated and the current number of parking spaces.

[0155] The scheduling priority determination module is used to determine the scheduling priority of the parking point based on the number of vehicle usage requests corresponding to the collection center, the battery swapping priority, and the vacancy ratio.

[0156] In an optional example, the scheduling priority determination module includes:

[0157] The first scheduling priority sorting submodule sorts the parking points according to the vacancy ratio to obtain a first scheduling priority sequence, wherein the higher the vacancy ratio, the higher the scheduling priority.

[0158] The second scheduling priority sorting submodule sorts the parking points according to the number of car usage requests at parking points with the same vacancy ratio, and obtains a second scheduling priority sequence. The more car usage requests there are, the higher the scheduling priority.

[0159] The third scheduling priority sorting submodule sorts the parking points according to the battery swapping priority corresponding to the same vacancy ratio and the preset range of vehicle request quantity, and obtains the third scheduling priority sequence. The higher the battery swapping priority, the higher the scheduling priority.

[0160] The scheduling priority submodule is used to determine the scheduling priority of the parking point based on the first scheduling priority sequence, the second scheduling priority sequence, or the third scheduling priority sequence.

[0161] As an example, the battery swapping device 200 for the shared vehicle also includes:

[0162] The vehicle use request allocation module is used to allocate the vehicle use request to the second user terminal of the battery swapping personnel;

[0163] The distance determination module is used to determine the relative distance between the second user terminal and the vehicle to be swapped based on the location information of the second user terminal and the location information of the vehicle to be swapped.

[0164] The battery swapping priority determination module 250 includes:

[0165] The second battery swapping priority submodule is used to determine the battery swapping priority of the current vehicle to be swapped based on the number of vehicle usage requests corresponding to the collection center, the number of vehicles currently waiting to be swapped, the usage time, and the relative distance.

[0166] As an example, the battery swapping device 200 for the shared vehicle also includes:

[0167] The reminder instruction sending module is used to send a battery swap success reminder instruction to the user's first user terminal if it receives battery swap success information from the vehicle to be swapped.

[0168] The unlock command sending module is used to send an unlock command to the battery swapping vehicle and deduct the user's preset virtual items if it receives a request from the first user terminal to cancel the vehicle reservation.

[0169] The battery swapping device 200 for shared vehicles is used to perform the corresponding steps in the battery swapping method for shared vehicles described above. The specific implementation of each function will not be described in detail here. In addition, the optional examples in Embodiment 1 are also applicable to the battery swapping device 200 for shared vehicles in Embodiment 2.

[0170] This application also provides a computer device, which includes a memory and a processor. The memory stores a computer program, and when the processor executes the computer program, it implements the battery swapping method for shared vehicles as described in the above embodiments.

[0171] This application also provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the battery swapping method for shared vehicles as described in the above embodiments.

[0172] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can also be implemented in other ways. The apparatus embodiments described above are merely illustrative; for example, the flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that, as an alternative implementation, the functions marked in the blocks may occur in a different order than those marked in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and combinations of blocks in the block diagram and / or flowchart, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0173] In addition, the functional modules or units in the various embodiments of the present invention can be integrated together to form an independent part, or each module can exist independently, or two or more modules can be integrated to form an independent part.

[0174] If the aforementioned functions are implemented as software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a smartphone, personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0175] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present invention should be included within the scope of protection of the present invention.

Claims

1. A battery swapping method of a shared vehicle, characterized by, The method applied to a server comprises: receiving use-car requests of all first user terminals in a continuous time period, wherein the use-car request comprises a use-car time, a use-car starting point and a use-car ending point; classifying all the use-car requests according to the use-car starting points to obtain multiple classification types, wherein the aggregated radius of the use-car starting points of the use-car requests of the same classification type forms a use-car starting point range set within a preset value, and the use-car starting point range set has a set center; determining a current parking quantity within a preset range according to the set center; determining a current number of vehicles to be replaced with electricity according to the set center, the use-car ending point and the current parking quantity; wherein the step of determining the current number of vehicles to be replaced with electricity comprises: obtaining a route to the use-car ending point according to the position corresponding to the set center and the position corresponding to the use-car ending point; determining the current number of vehicles to be replaced with electricity within the preset range according to the route to the use-car ending point, the current parking quantity within the preset range and the current drivable distance of each vehicle, wherein the current drivable distance of each vehicle is obtained according to the current electricity quantity of the vehicle; determining a replacement priority of the current vehicles to be replaced with electricity according to the number of use-car requests corresponding to the set center, the current number of vehicles to be replaced with electricity and the use-car time; wherein the replacement priority is used to determine the order and route of vehicle replacement to ensure that the electricity quantity of the vehicle requested to be unlocked can support driving to the use-car ending point; determining a predicted replacement time according to the replacement priority, and sending the predicted replacement time to the first user terminal; if the information of determining the replacement reservation sent by the first user terminal is received, sending a locking instruction to the vehicle to be replaced with electricity; the method further comprises: determining a parking point and a containable parking quantity within the preset range according to the set center; determining an empty ratio according to the containable parking quantity and the current parking quantity; determining a scheduling priority of the parking point according to the number of use-car requests corresponding to the set center, the replacement priority and the empty ratio; wherein the determination of the scheduling priority of the parking point according to the number of use-car requests corresponding to the set center, the replacement priority and the empty ratio comprises: performing a third scheduling priority sorting of the parking point according to the replacement priority corresponding to the same empty ratio and a preset use-car request quantity interval to obtain a third scheduling priority sequence, wherein the higher the replacement priority is, the higher the scheduling priority is; determining the scheduling priority of the parking point according to the third scheduling priority sequence. 2.The battery swapping method of a shared vehicle according to claim 1, characterized in that, The aggregated radius of the use-car starting points of the use-car requests of the same classification type is determined in the following manner: determining a first use-car starting point of the use-car requests of the same classification type; determining a second use-car starting point closest to the first use-car starting point within the preset value with the first use-car starting point as the center; determining a third use-car starting point closest to the center of the first use-car starting point and the second use-car starting point within the preset value with the center of the first use-car starting point and the second use-car starting point as the center; The loop step is repeatedly performed until no other starting point of use of the vehicle within the preset value; The loop step comprises: According to the center of mass of the polygon formed by all starting points of use of the vehicle, the starting point of use of the vehicle closest to the center of mass of the polygon is determined within the preset value. 3.The battery swapping method of a shared vehicle according to claim 1, characterized in that The method further comprises: According to the distribution of the use time, a use time period is formed; According to the use time period, the first battery replacement priority of the current battery replacement vehicle is sorted to obtain a first battery replacement priority sequence, wherein the closer the use time period is, the higher the battery replacement priority is; According to the number of the current battery replacement vehicles in the same use time period, the second battery replacement priority is sorted to obtain a second battery replacement priority sequence, wherein the more the number of the current battery replacement vehicles is, the higher the battery replacement priority is; According to the number of use requests corresponding to the same use time period and the preset current battery replacement vehicle quantity interval, the third battery replacement priority is sorted to obtain a third battery replacement priority sequence, wherein the more the use requests are, the higher the battery replacement priority is; The battery replacement priority of the current battery replacement vehicle is determined according to the first battery replacement priority sequence, the second battery replacement priority sequence or the third battery replacement priority sequence. 4.The battery swapping method of a shared vehicle according to claim 1, characterized in that, The method further comprises: According to the vacancy ratio, the first dispatch priority of the parking point is sorted to obtain a first dispatch priority sequence, wherein the higher the vacancy ratio is, the higher the dispatch priority is; According to the number of use requests of the parking point with the same vacancy ratio, the second dispatch priority of the parking point is sorted to obtain a second dispatch priority sequence, wherein the more the number of use requests is, the higher the dispatch priority is; The dispatch priority of the parking point is determined according to the first dispatch priority sequence or the second dispatch priority sequence. 5.The battery swapping method of a shared vehicle according to claim 1, characterized in that, Before the battery replacement priority of the current battery replacement vehicle is determined according to the number of use requests corresponding to the collection center, the number of current battery replacement vehicles and the use time, the method further comprises: The use request is distributed to a second user terminal of a battery replacement personnel; According to the position information of the second user terminal and the position information of the battery replacement vehicle, a relative distance between the second user terminal and the battery replacement vehicle is determined. The battery replacement priority of the current battery replacement vehicle is determined according to the number of use requests corresponding to the collection center, the number of current battery replacement vehicles, the use time and the relative distance. If the lock instruction is received from the first user terminal, the method further comprises: 6.The battery swapping method of a shared vehicle according to claim 1, characterized in that, ​ If the vehicle-to-be-charged sends the information of successful battery swap, send the information of successful battery swap to the first user terminal of the user; If the first user terminal sends the request of canceling the reserved vehicle, send the information of unlocking to the vehicle-to-be-charged and deduct the preset virtual goods of the user.

7. A battery swapping device for a shared vehicle, characterized by, The application is applied to a server, and the device comprises: A request receiving module is configured to receive all use-vehicle requests of first user terminals in a continuous time period, wherein the use-vehicle request comprises a use-vehicle time, a use-vehicle starting point and a use-vehicle ending point; A classification module is configured to classify all the use-vehicle requests according to the use-vehicle starting points, so as to obtain multiple classification types, wherein the use-vehicle starting points of the use-vehicle requests of the same classification type form a use-vehicle starting point range set within a preset value, and the use-vehicle starting point range set has a set center; A current parking quantity determining module is configured to determine a current parking quantity within a preset range according to the set center; A current vehicle-to-be-charged quantity determining module is configured to determine a current vehicle-to-be-charged quantity according to the set center, the use-vehicle ending point and the current parking quantity, wherein the step of determining the current vehicle-to-be-charged quantity comprises: obtaining a route to the use-vehicle ending point according to the position corresponding to the set center and the position corresponding to the use-vehicle ending point; determining the current vehicle-to-be-charged quantity within the preset range according to the route to the use-vehicle ending point, the current parking quantity within the preset range and the current drivable distance of each vehicle, wherein the current drivable distance of each vehicle is obtained according to the current power of the vehicle; A battery swap priority determining module is configured to determine a battery swap priority of the current vehicle-to-be-charged according to the number of use-vehicle requests corresponding to the set center, the current vehicle-to-be-charged quantity and the use-vehicle time, wherein the battery swap priority is used to determine the sequence and route of battery swap, so as to ensure that the power of the vehicle requested to be unlocked can support the driving to the use-vehicle ending point; A predicted battery swap time determining module is configured to determine a predicted battery swap time according to the battery swap priority and send the predicted battery swap time to the first user terminal; A locking instruction sending module is configured to send a locking instruction to the vehicle-to-be-charged if the information of determining the reserved vehicle is received. The device is further configured to: Determine a parking point and a receivable parking quantity within the preset range according to the set center; Determine an empty ratio according to the receivable parking quantity and the current parking quantity; Determine a dispatch priority of the parking point according to the number of use-vehicle requests corresponding to the set center, the battery swap priority and the empty ratio; The determination of the dispatch priority of the parking point according to the number of use-vehicle requests corresponding to the set center, the battery swap priority and the empty ratio comprises: According to the battery swap priority corresponding to the same empty ratio and a preset use-vehicle request quantity interval, the parking point is sorted for a third time to obtain a third dispatch priority sequence, wherein the higher the battery swap priority is, the higher the dispatch priority is; The dispatch priority of the parking point is determined according to the third dispatch priority sequence.

8. A computer device, comprising: The computer device comprises a memory and a processor, the memory stores a computer program, and the computer program realizes the power exchange method of the shared vehicle according to any one of claims 1 to 6 when executed by the processor.

9. A computer-readable storage medium, characterized in that, The computer readable storage medium stores a computer program, and the computer program realizes the power exchange method of the shared vehicle according to any one of claims 1 to 6 when executed by the processor.

Images