A method for electric vehicle charging path planning combined with cloud queuing

Abstract

The present invention discloses a method for planning charging routes for electric vehicles in combination with cloud queuing, including: obtaining the distribution of charging stations and driving data of electric vehicles (current location, destination, remaining battery power, etc.) through a cloud platform, and the navigation system plans a drivable route based on the current location and destination, and records the route that the electric vehicle can travel to the destination with the remaining battery power, and finally sends all of them to the driver, who chooses one of the routes to travel according to his or her preferences and makes a charging reservation as needed. The method of the present invention can plan all feasible routes for electric vehicles, provide drivers with multiple options, so that drivers can make choices based on actual needs, reduce the difficulty of charging electric vehicles, and improve the use efficiency of each charging pile in the charging station.

Description

Technical Field

[0001] The present invention relates to the field of electric vehicles and computer communication technology, and in particular to a method for planning an electric vehicle charging path in combination with cloud queuing. Background Art

[0002] Cars are an indispensable means of transportation in daily life. For traditional fuel vehicles, energy replenishment is convenient and quick, and traditional fuel vehicles have a longer driving range after replenishing once. On the other hand, even if the energy is about to run out, with the current deployment of gas stations, traditional fuel vehicles can also quickly find gas stations for replenishment under the guidance of the existing navigation system, so that there is no need to consider energy replenishment too much when planning routes.

[0003] In recent years, the popularity of electric vehicles in daily life has been increasing. Unlike traditional fuel vehicles, electric vehicles require a long time to replenish their energy, and their driving range after charging is far less than that of traditional fuel vehicles. As the popularity of electric vehicles increases, charging congestion is likely to occur, which increases the waiting time for electric vehicle charging and increases the time cost of electric vehicle travel. Summary of the invention

[0004] The technical problem to be solved by the present invention is to provide an electric vehicle charging path planning method combined with cloud queuing in view of the defects involved in the background technology.

[0005] The present invention adopts the following technical solutions to solve the above technical problems:

[0006] A method for planning an electric vehicle charging path combined with cloud queuing includes the following steps:

[0007] Step 1), perform path planning based on the current position and destination of the electric vehicle, obtain all feasible paths, and sort them from small to large according to the time it takes the electric vehicle to travel to the destination at a preset speed threshold V, and obtain a set of feasible paths {L1, L2, L3, ..., LN}, where N is the total number of feasible paths, and let i=1;

[0008] Step 2), taking the power battery consumption rate of the electric vehicle when traveling at a speed V as a reference, calculating the theoretical battery power E01 required for the electric vehicle to travel from the current position to the destination along the path Li at the power consumption rate, and judging whether the remaining power Esoe1 of the power battery of the electric vehicle is less than the theoretical power E01;

[0009] Step 2.1), if the remaining power Esoe1 is less than the theoretical power E01, the driver is reminded that the vehicle needs to be charged during this trip, and step 3 is executed);

[0010] Step 2.2), if the remaining power Esoe1 is greater than or equal to the theoretical power E01, execute Step 8);

[0011] Step 3), determine whether there is an available charging station on the path Li;

[0012] Step 3.1), if there is an available charging station on the path Li, execute Step 4);

[0013] Step 3.2), if there is no available charging station on the path Li, execute Step 9);

[0014] Step 4), determine whether there is an idle charging pile at the charging station at the current moment;

[0015] Step 4.1), if there is no idle charging pile at the charging station at the current moment, execute Step 5);

[0016] Step 4.2), if there is an idle charging pile at the charging station at the current moment, compare the sizes of T3 and Tmax. T3 represents the time required for the electric vehicle to travel from the current position to the charging station at speed V, and Tmax represents the maximum free idle reservation time allowed for the charging pile at the charging station;

[0017] Step 4.2.1), if T3 < Tmax, make a free reservation and execute Step 7);

[0018] Step 4.2.2), if T3 ≥ Tmax, make a paid reservation, reserve an idle charging pile until the electric vehicle arrives, and execute Step 7);

[0019] Step 5), compare the sizes of T1 and T2 + T3. T1 represents the charging time required to meet the travel of the charging vehicle, and T2 represents the charging time of the charging vehicle at the current moment;

[0020] Step 5.1), if T1 ≤ T2 + T3, execute Step 6);

[0021] Step 5.2), if T1 > T2 + T3, compare the sizes of ΔT and T0. ΔT = T1 - T2 - T3, and T0 represents the queuing time that the driver can accept after arriving at the charging station;

[0022] Step 5.2.1), if ΔT < T0, make a free reservation and execute Step 7);

[0023] Step 5.2.2), if ΔT ≥ T0, execute Step 9);

[0024] Step 6), determine whether T2 + T3 - T1 < Tmax;

[0025] Step 6.1), if T2 + T3 - T1 < Tmax, make a free reservation and execute Step 7);

[0026] Step 6.2), if T2 + T3 - T1 ≥ Tmax, make a paid reservation, reserve a spare charging pile until the electric vehicle arrives, and execute Step 7);

[0027] Step 7), record the following information of the current path Li: whether the electric vehicle needs to charge on this path, whether it is a free reservation, whether it needs to queue and the length of the queuing time, whether it is a paid reservation, and the estimated time required to reach the destination. Let i = i + 1, and compare the sizes of i and N;

[0028] Step 7.1), if i ≤ N, execute Step 2);

[0029] Step 7.2), if i > N, provide all the recorded paths to the driver;

[0030] Step 8), calculate the theoretical power E02 required from the destination to the nearest charging station, and further determine whether the remaining power Esoe2 of the power battery after the electric vehicle arrives at the destination is less than E02;

[0031] Step 8.1), if Esoe2 is greater than or equal to E02, execute Step 7);

[0032] Step 8.2), if Esoe2 is less than E02, remind the driver that this vehicle has a charging requirement during this trip, and execute Step 3);

[0033] Step 9), let i = i + 1, and compare the sizes of i and N;

[0034] Step 9.1), if i > N, remind the driver that there is no feasible path and recommend other transportation methods;

[0035] Step 9.2), if i ≤ N, execute Step 2).

[0036] Compared with the prior art, the present invention adopts the above technical solutions and has the following technical effects:

[0037] 1. The present invention obtains the distribution of charging stations and the driving data of electric vehicles through the cloud platform, and then conducts global path planning through the navigation system, plans all driving paths that meet the travel needs for the driver, and makes online charging reservations as needed;

[0038] 2. The present invention conducts path planning and online charging reservation in advance at the departure position of the electric vehicle, queues online as needed, and converts a part of the queuing time into the time T3 required to drive from the current position to the charging station, thereby shortening the actual queuing time required after the electric vehicle arrives at the charging station;

[0039] 3. The present invention also includes the charging piles in use into the calculation range, makes the next step of operation planning for the charging piles in use, and improves the utilization efficiency of each charging pile in the charging station. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 It is a schematic diagram of the process of the present invention;

[0041] Figure 2 (a) Figure 2 (b) are schematic diagrams of states with and without charging stations in the route of the present invention;

[0042] Figure 3 (a) Figure 3 (b) are schematic diagrams of states of having and not having free charging piles in the charging station of the present invention;

[0043] Figure 4 (a) Figure 4 (b) Schematic diagram of time comparison when T1>T2+T3 and T1≤T2+T3 respectively. DETAILED DESCRIPTION

[0044] The technical solution of the present invention is further described in detail below in conjunction with the accompanying drawings:

[0045] The present invention can be implemented in many different forms and should not be considered to be limited to the embodiments described herein. On the contrary, these embodiments are provided to make this disclosure thorough and complete, and will fully express the scope of the present invention to those skilled in the art. In the accompanying drawings, components are enlarged for clarity.

[0046] like Figure 1 As shown, the present invention discloses a method for planning a charging path for an electric vehicle combined with cloud queuing, comprising the following steps:

[0047] Step 1), perform path planning based on the current position and destination of the electric vehicle, obtain all feasible paths, and sort them from small to large according to the time it takes the electric vehicle to travel to the destination at a preset speed threshold V, and obtain a set of feasible paths {L1, L2, L3, ..., LN}, where N is the total number of feasible paths, and let i=1;

[0048] Step 2), taking the power battery consumption rate of the electric vehicle when traveling at a speed V as a reference, calculating the theoretical battery power E01 required for the electric vehicle to travel from the current position to the destination along the path Li at the power consumption rate, and judging whether the remaining power Esoe1 of the power battery of the electric vehicle is less than the theoretical power E01;

[0049] Step 2.1), if the remaining power Esoe1 is less than the theoretical power E01, remind the driver that the vehicle has a charging requirement during this trip and execute Step 3);

[0050] Step 2.2), if the remaining power Esoe1 is greater than or equal to the theoretical power E01, execute Step 8);

[0051] Step 3), determine whether there is an available charging station on the path Li;

[0052] Step 3.1), if there is an available charging station on the path Li, as shown in Figure 2 (a), execute Step 4);

[0053] Step 3.2), if there is no available charging station on the path Li, as shown in Figure 2 (b), execute Step 9);

[0054] Step 4), determine whether there is a vacant charging pile at the charging station at the current moment;

[0055] Step 4.1), if there is no vacant charging pile at the charging station at the current moment, as shown in Figure 3 (b), execute Step 5);

[0056] Step 4.2), if there is a vacant charging pile at the charging station at the current moment, as shown in Figure 3 (a), compare the magnitudes of T3 and Tmax. T3 represents the time required for the electric vehicle to travel from the current position to the charging station at speed V, and Tmax represents the maximum free idle reservation time allowed for the charging pile at the charging station;

[0057] Step 4.2.1), if T3 < Tmax, make a free reservation and execute Step 7);

[0058] Step 4.2.2), if T3 ≥ Tmax, make a paid reservation, reserve a vacant charging pile until the electric vehicle arrives, and execute Step 7);

[0059] Step 5), compare the magnitudes of T1 and T2 + T3. T1 represents the charging time required to meet the travel of the charging vehicle, and T2 represents the charging time of the charging vehicle at the current moment;

[0060] Step 5.1), if T1 ≤ T2 + T3, as shown in Figure 4 (b), execute Step 6);

[0061] Step 5.2), if T1 > T2 + T3, as shown in Figure 4 (a), compare the magnitudes of ΔT and T0. ΔT = T1 - T2 - T3, and T0 represents the queuing time acceptable to the driver after arriving at the charging station;

[0062] Step 5.2.1), if ΔT < T0, make a free reservation and execute Step 7);

[0063] Step 5.2.2), if ΔT ≥ T0, execute Step 9);

[0064] Step 6), determine whether T2 + T3 - T1 < Tmax;

[0065] Step 6.1), if T2 + T3 - T1 < Tmax, make a free reservation and execute Step 7);

[0066] Step 6.2), if T2 + T3 - T1 ≥ Tmax, make a paid reservation, reserve a vacant charging pile until the electric vehicle arrives, and execute Step 7);

[0067] Step 7), record the following information of the current path Li: whether the electric vehicle needs to be charged on this path, whether it is a free reservation, whether it needs to queue and the length of the queuing time, whether it is a paid reservation, and the estimated time required to reach the destination. Let i = i + 1 and compare the sizes of i and N;

[0068] Step 7.1), if i ≤ N, execute Step 2);

[0069] Step 7.2), if i > N, provide all the recorded paths to the driver;

[0070] Step 8), calculate the theoretical power E02 required from the destination to the nearest charging station, and further determine whether the remaining power Esoe2 of the power battery after the electric vehicle arrives at the destination is less than E02;

[0071] Step 8.1), if Esoe2 is greater than or equal to E02, execute Step 7);

[0072] Step 8.2), if Esoe2 < E02, remind the driver that this vehicle has a charging requirement during this trip and execute Step 3);

[0073] Step 9), let i = i + 1 and compare the sizes of i and N;

[0074] Step 9.1), if i > N, remind the driver that there is no feasible path and recommend other transportation methods;

[0075] Step 9.2), if i ≤ N, execute Step 2).

[0076] Specifically, if the current path meets the travel requirements as known from the previous steps, the path will be recorded and the feasibility of the next path will be calculated until all planned paths are calculated. The recorded feasible paths will be presented to the driver, who can choose one of the paths according to his or her preferences and make reservations at charging stations where charging can be reserved as needed.

[0077] Based on the existing navigation technology, the present invention obtains the distribution of charging stations and electric vehicle driving data through the cloud platform, makes preparations for mid-way charging when planning the driving route, and makes online reservations in advance, which can greatly reduce the time spent on electric vehicle energy replenishment, solve the problem of charging congestion, reduce queuing, and provide the best driving route for drivers.

[0078] It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as generally understood by those skilled in the art in the art to which the present invention belongs. It should also be understood that terms such as those defined in common dictionaries should be understood to have meanings consistent with the meanings in the context of the prior art, and will not be interpreted with idealized or overly formal meanings unless defined as herein.

[0079] The specific implementation methods described above further illustrate the objectives, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above description is only a specific implementation method of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A method for planning an electric vehicle charging path combined with cloud queuing, characterized in that, it includes the following steps: Step 1), perform path planning based on the current position and destination of the electric vehicle, obtain all feasible paths, and sort them in ascending order of the time required for the electric vehicle to travel to the destination at a preset speed threshold V, to obtain a set of feasible paths {L1, L2, L3,..., LN}, N is the total number of feasible paths, and let i = 1; Step 2), take the power battery power consumption rate of the electric vehicle when traveling at speed V as a reference, calculate the theoretical battery power E01 required for the electric vehicle to travel from the current position to the destination along path Li at this power consumption rate, and determine whether the remaining power Esoe1 of the electric vehicle's power battery is less than the theoretical power E01; Step 2.1), if the remaining power Esoe1 is less than the theoretical power E01, remind the driver that there is a charging requirement during this trip of the vehicle, and execute Step 3); Step 2.2), if the remaining power Esoe1 is greater than or equal to the theoretical power E01, execute Step 8); Step 3), determine whether there is an available charging station on path Li; Step 3.1), if there is an available charging station on path Li, execute Step 4); Step 3.2), if there is no available charging station on path Li, execute Step 9); Step 4), determine whether there is an available charging pile at the charging station at the current moment; Step 4.1), if there is no available charging pile at the charging station at the current moment, execute Step 5); Step 4.2), if there is an available charging pile at the charging station at the current moment, compare the sizes of T3 and Tmax, where T3 represents the time required for the electric vehicle to travel from the current position to the charging station at speed V, and Tmax represents the maximum free idle reservation time allowed for the charging pile at the charging station; Step 4.2.1), if T3 < Tmax, make a free reservation and execute Step 7); Step 4.2.2), if T3 ≥ Tmax, make a paid reservation, reserve an available charging pile until the electric vehicle arrives, and execute Step 7); Step 5), compare the sizes of T1 and T2 + T3, where T1 represents the charging time required to meet the travel of the charging vehicle, and T2 represents the charging time of the charging vehicle at the current moment; Step 5.1), if T1 ≤ T2 + T3, execute Step 6); Step 5.2), if T1 > T2 + T3, compare the sizes of ΔT and T0, where ΔT = T1 - T2 - T3, and T0 represents the queuing time that the driver can accept after arriving at the charging station; Step 5.2.1), if ΔT < T0, make a free reservation and execute Step 7); Step 5.2.2), if ΔT ≥ T0, execute Step 9); Step 6), determine whether T2 + T3 - T1 < Tmax; Step 6.1), if T2 + T3 - T1 < Tmax, make a free reservation and execute Step 7); Step 6.2), if T2 + T3 - T1 ≥ Tmax, make a paid reservation, reserve an available charging pile until the electric vehicle arrives, and execute Step 7); Step 7), record the following information of the current path Li: whether the electric vehicle needs to be charged when traveling on the path, whether it is free to make an appointment, whether it needs to queue and how long it will queue, whether it is paid to make an appointment, and the estimated time to reach the destination. Let i=i+1, and compare the size of i and N; Step 7.1), if i≤N, go to step 2); Step 7.2), if i>N, provide all recorded paths to the driver; Step 8), calculate the theoretical power E02 required from the destination to the nearest charging station, and further determine whether the remaining power Esoe2 of the power battery of the electric vehicle after arriving at the destination is less than E02; Step 8.1), if Esoe2 is greater than or equal to E02, go to step 7); Step 8.2), if Esoe2 is less than E02, remind the driver that the vehicle needs to be charged during this trip, and execute step 3); Step 9), let i=i+1, compare the size of i and N; Step 9.1), if i>N, remind the driver that there is no feasible path and recommend other transportation methods; Step 9.2), if i≤N, execute step 2).

Images