CN116341694A

CN116341694A - Charging planning method and system

Info

Publication number: CN116341694A
Application number: CN202310301320.XA
Authority: CN
Inventors: 浦亚峰; 王荔媛; 严小斌
Original assignee: Shanghai OnStar Telematics Co Ltd
Current assignee: Shanghai OnStar Telematics Co Ltd
Priority date: 2023-03-24
Filing date: 2023-03-24
Publication date: 2023-06-27

Abstract

The application provides a charging planning method and system, comprising the following steps: the method comprises the steps that a server receives a charging preset request sent by a vehicle; acquiring at least one charging station, the service condition of the charging station and the preset condition on the vehicle running path according to the charging preset request; acquiring a target charging station based on the use condition and the preset condition of the charging station; and generating a predetermined order by utilizing the target charging station, and sending the predetermined order to the vehicle. Therefore, through charging reservation, the server can intensively manage the service condition of the charging station, estimate the waiting time of the vehicle, select other proper charging stations under the condition that the waiting time of the current charging station exceeds the preset time, and the charging station does not need manual participation, so that the selection burden of a user is reduced, the waiting time of the user at the charging station is shortened, and the service efficiency of the whole charging station is improved.

Description

Charging planning method and system

Technical Field

The application relates to the technical field of new energy automobiles, in particular to a charging planning method and system.

Background

The electric automobile is favored by people because of the advantages of low automobile cost, small environmental pollution and the like. Accordingly, the user of the electric vehicle has a certain anxiety about the range of the electric vehicle, that is, whether the battery of the electric vehicle can support the anxiety existing to the destination during long distance driving. If the battery cannot support the destination, the user is required to charge the electric vehicle halfway.

When an electric vehicle user charges the electric vehicle, the user needs to select a proper charging station from a plurality of charging stations in the way to charge the electric vehicle, and the selection process often needs to depend on experience judgment of the user. Because the use condition of each charging station cannot be known, the electric automobile user mostly goes to the charging station when the battery power is about to be exhausted. However, if a large number of electric cars are waiting at this time, the user can only waste a large amount of time waiting, and the user cannot go to the charging station even if the other charging stations are idle. Thus, the charging station of the way is low in use efficiency, long in waiting time of the user and poor in experience.

Therefore, how to shorten the waiting time of charging and improve the service efficiency of the charging station is a technical problem that needs to be solved by those skilled in the art.

Disclosure of Invention

In view of this, the embodiments of the present application provide a charging planning method and system, which aims to shorten the waiting time of charging and improve the service efficiency of the charging station.

In a first aspect, an embodiment of the present application provides a charging planning method, including:

the method comprises the steps that a server receives a charging preset request sent by a vehicle, wherein the charging preset request comprises a vehicle driving path and a maximum waiting time, and the maximum waiting time is the maximum value of waiting time accepted by the vehicle;

Acquiring at least one charging station, the service condition of the charging station and the preset condition on the vehicle running path according to the charging preset request;

acquiring a target charging station based on the use condition and the predetermined condition of the charging station, wherein the target charging station is a charging station determined from the at least one charging station so that the actual waiting time of the vehicle is smaller than the maximum waiting time;

and generating a predetermined order by utilizing the target charging station, and sending the predetermined order to the vehicle.

Optionally, the obtaining the target charging station based on the usage situation and the predetermined situation of the charging station includes:

acquiring a charging station queue, wherein the charging station queue is generated by sequencing the at least one charging station according to the sequence from near to far from the vehicle;

acquiring the service condition and the preset condition of the charging piles in the first charging stations, wherein the first charging stations are the charging stations which are ranked first in the charging station queue;

in response to all charging piles in the first charging station being reserved, replacing the first charging station with a second charging station, and returning to execute the reserved condition of acquiring the first charging station, wherein the second charging station is a charging station in sequence after the first charging station in the charging station queue;

And determining that the first charging station is a target charging station in response to at least one charging stake in the first charging station being unscheduled and the use of the unscheduled charging stake causing the actual waiting time of the vehicle to be less than the maximum waiting time.

Optionally, the acquiring the usage condition and the predetermined condition of the charging pile in the first charging station includes:

acquiring a first charging pile queue, wherein the first charging pile queue is generated by sequencing charging piles in the first charging station according to the sequence from small to large of the residual charging time;

acquiring a preset condition of a first charging pile, wherein the first charging pile is a charging pile which is sequenced first in a first charging pile queue;

responding to the preset condition of the first charging pile as preset, replacing the first charging pile by a second charging pile, and returning to execute the preset condition of acquiring the first charging pile, wherein the second charging pile is a charging pile which is ordered after the first charging pile in the first charging pile queue;

and responding to the fact that the preset condition of the first charging pile is not preset, acquiring the service condition of the first charging pile, wherein the service condition of the first charging pile comprises the residual charging time of the first charging pile, and calculating the actual waiting time based on the residual charging time of the first charging pile, wherein the actual waiting time is the residual waiting time of the charging pile when the vehicle reaches the first charging pile.

Optionally, after the calculating the actual waiting time, the method further includes:

calculating iteration waiting time based on the residual charging time of the first charging pile again in response to the change of the residual charging time of the first charging pile, wherein the iteration waiting time is the residual waiting time of the charging pile when the vehicle reaches the first charging pile after the change of the residual charging time of the first charging pile;

and in response to the iteration waiting time being greater than the maximum waiting time, returning to execute the obtaining charging station queue.

Optionally, the generating a predetermined order with the target charging station includes:

acquiring the number of the vehicle, the number of the target charging station and the number of the first charging pile;

calculating a vehicle estimated arrival time and a vehicle estimated charging time, wherein the vehicle estimated arrival time is the time required by the vehicle to reach a target charging station, the vehicle estimated charging time is the time obtained by subtracting the vehicle estimated arrival time from the remaining charging time of the first charging pile and adding the time required by the vehicle to obtain the time;

and generating a preset order with generation time and number according to the number of the vehicle, the number of the target charging station, the number of the first charging pile, the expected arrival time of the vehicle and the expected charging time of the vehicle.

acquiring a charging queue corresponding to the first charging station, wherein the charging queue is a queue of historical orders ordered from small to large according to the expected charging time, and the historical orders are preset orders of other vehicles at the charging station;

based on the charging queue corresponding to the first charging station, obtaining the service condition and the preset condition of the charging pile in the first charging station;

after the generating the predetermined order with the target charging station, the method further comprises:

and updating the charging queue corresponding to the target charging station by utilizing the preset order.

In a second aspect, an embodiment of the present application provides another charging planning method, including:

the vehicle sends a charging preset request to a server, wherein the charging preset request comprises a vehicle driving path and a maximum waiting time, and the maximum waiting time is the maximum value of the waiting time accepted by the vehicle;

and receiving a predetermined order sent by the server.

Optionally, before the vehicle sends the charging reservation request to the server, the method further includes:

responsive to the remaining range of the vehicle being less than a preset threshold, checking whether a vehicle navigation path exists;

And responding to the existence of the vehicle navigation path, taking the vehicle navigation path as a vehicle driving path, and generating a charging preset request according to the vehicle driving path.

In a third aspect, an embodiment of the present application provides another charging planning method, including:

the charging station periodically transmits the usage and the predetermined condition to the server.

In a fourth aspect, embodiments of the present application provide another charge planning system, including:

a server, at least one vehicle, and at least one charging station;

the server is used for receiving a charging preset request sent by the vehicle; acquiring at least one charging station, the service condition of the charging station and the preset condition on the vehicle running path according to the charging preset request; acquiring a target charging station based on the use condition and the preset condition of the charging station; generating a predetermined order with the target charging station, and transmitting the predetermined order to the vehicle; the charging reservation request includes a vehicle travel path and a maximum waiting time, the maximum waiting time being a maximum value of waiting times accepted by a vehicle, the target charging station being a charging station determined from the at least one charging station such that an actual waiting time of the vehicle is smaller than the maximum waiting time;

The vehicle is used for sending a charging reservation request to the server; receiving a preset order sent by the server;

the charging station is used for periodically sending the use condition and the preset condition to the server.

The embodiment of the application provides a charging planning method and a charging planning system, wherein when the method is executed, a server receives a charging preset request sent by a vehicle, the charging preset request comprises a vehicle driving path and maximum waiting time, and the maximum waiting time is the maximum value of waiting time accepted by the vehicle; acquiring at least one charging station, the service condition of the charging station and the preset condition on the vehicle running path according to the charging preset request; acquiring a target charging station based on the use condition and the predetermined condition of the charging station, wherein the target charging station is a charging station determined from the at least one charging station so that the actual waiting time of the vehicle is smaller than the maximum waiting time; and generating a predetermined order by utilizing the target charging station, and sending the predetermined order to the vehicle. Therefore, through charging reservation, the server can intensively manage the service condition of the charging station, estimate the waiting time of the vehicle, select other proper charging stations under the condition that the waiting time of the current charging station exceeds the preset time, and the charging station does not need manual participation, so that the selection burden of a user is reduced, the waiting time of the user at the charging station is shortened, and the service efficiency of the whole charging station is improved.

Drawings

In order to more clearly illustrate the present embodiments or the technical solutions in the prior art, the drawings that are required for the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a schematic structural diagram of a charging planning system according to an embodiment of the present application;

fig. 2 is a flowchart of a method of charging planning method according to an embodiment of the present application;

fig. 3 is a polling flow chart of a charging planning method according to an embodiment of the present application;

fig. 4 is a flowchart of another method of charging planning method according to an embodiment of the present application;

fig. 5 is a flowchart of generating a charging reservation request according to a charging planning method provided in an embodiment of the present application;

fig. 6 is a flowchart of a method overall of a charging planning method according to an embodiment of the present application;

fig. 7 is a schematic structural diagram of a charging planning device according to an embodiment of the present application.

Detailed Description

With the rapid development of electric vehicles, more and more users choose to purchase electric vehicles when purchasing vehicle products. Compared with the traditional fuel oil vehicle, the electric vehicle has great advantages in terms of vehicle cost and environmental pollution. However, the electric vehicle has a disadvantage in that anxiety of mileage of a user, that is, anxiety of whether a battery of the electric vehicle can support existence of arrival at a destination during long distance driving, is easily caused. Although the prior art solves this problem by providing a larger capacity battery for a vehicle, improving the efficiency of use of the battery, recovering kinetic energy, shortening the charging time period, etc., it is costly and has little effect. If the battery cannot support the electric vehicle to reach the destination, that is, if the maximum travel distance provided by the electric power of the battery provided by the vehicle is smaller than the distance required to drive, the electric vehicle needs to be charged by the user halfway.

In general, this is the case when the user is driving, depending on the information points in the map product, the "static" information of the plurality of charging stations of the route is obtained, without taking into account the interaction between the charging stations and the vehicle. For how to select a suitable charging station, most of the experience of the user is relied on, requiring the user to look at nearby charging stations in the map during driving, or to charge after estimating how many kilometers the vehicle is about to travel before starting driving, and to go to which charging station. This results in that even if some of the charging stations are idle, some of the charging stations are busy, and the user cannot predict the usage of the charging station selected in advance, and most of the charging stations will be moved to when the battery is about to run out. However, if a large number of electric cars are waiting at this time, the user can only waste a large amount of time waiting, and the user cannot go to the charging station even if other charging stations are idle. Thus, the charging station of the way is low in use efficiency, long in waiting time of the user and poor in experience.

The charging planning method and system are used for shortening the waiting time of charging and improving the service efficiency of the charging station.

It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.

Referring to fig. 1, a charging planning system includes: a server, at least one vehicle, and at least one charging station.

The vehicle is used for sending a charging reservation request to the server; and receiving a predetermined order sent by the server. As a possible implementation, each vehicle includes a vehicle entertainment communication module (TBOX) that can acquire GPS signals (including GPS signals of a vehicle driving path), vehicle information (including a number of the vehicle), automatically generate a charge request, and communicate with a server through a mobile cellular network. Furthermore, the driver may preset the customization requirements (including maximum waiting time) to the TBOX in advance.

The server is used for centrally managing charging resources and specifically comprises receiving a charging preset request sent by the vehicle; acquiring at least one charging station, the service condition of the charging station and the preset condition on the vehicle running path according to the charging preset request; acquiring a target charging station based on the use condition and the preset condition of the charging station; and generating a predetermined order by utilizing the target charging station, and sending the predetermined order to the vehicle.

The server can communicate with the at least one vehicle to receive a charging reservation request sent by the vehicle, and simultaneously, the server is in communication connection with the at least one charging station at any time to acquire the latest charging resource condition. As a possible implementation, the server may communicate with the TBOX, obtain a charging station above the vehicle's direction of travel through a map server, and send a predetermined order to the vehicle through a cellular network.

The charging station is used for periodically sending the use condition and the preset condition to the server. Because different charging stations are distributed around the inter-city road of the country to provide charging service for the vehicle, the charging stations are required to send the service condition and the preset condition of the charging piles in the station to the server at regular intervals.

Therefore, the service efficiency of the charging station under the achievement road can be improved more efficiently and the waiting time of the electric car can be shortened just by supplementing and expanding the charging activity of the electric car under the existing charging device and method, the reasonable utilization of the charging resource can be ensured, and the experience of a user can be improved. The user does not need to be distracted from things except driving behaviors in the driving process, the vehicle and the server judge which charging station is to be used, after the charging station is selected, the user is informed of the distance to be used for charging the charging station in the next driving process in advance, the charging time is estimated, the manual operation burden of the user for selecting the charging station in the driving process is reduced, the charging waiting time is shortened, and the use efficiency of the charging station in the inter-city road is improved.

Referring to fig. 2, fig. 2 is a flowchart of a method for charging planning method applied to a server side according to an embodiment of the present application, including:

step S201: and receiving a charging preset request sent by the vehicle.

After the user sets the travel route, the vehicle will begin to poll for battery conditions, travel paths, and user preset parameters (including maximum waiting time) to determine if the vehicle needs to be charged. When the condition that charging is required is satisfied, the vehicle transmits a charging reservation request to the server.

Wherein the charging reservation request includes a vehicle travel path and a maximum waiting time, which is a maximum value of waiting times accepted by the vehicle.

Step S202: and acquiring at least one charging station, the service condition of the charging station and the preset condition on the vehicle running path according to the charging preset request.

After receiving a charging reservation request sent by a vehicle, a server acquires at least one charging station on a vehicle driving path and the service condition and reservation condition of the charging station so as to find a proper charging station. The use condition of the charging station is the use condition of the charging post in the charging station, namely, whether the charging post in the charging station is used for charging or not is acquired. The predetermined condition of a charging station is whether a charging peg in the charging station has been predetermined by its vehicle, i.e. the other vehicle is going to the charging station for charging.

After the service condition and the preset condition of the charging station are acquired, whether the current vehicle arrives at a certain charging station or not can be estimated, or the time required for waiting for the certain charging station to be idle is required, so that the resource sharing of the charging station and the vehicle is realized, and the interaction between the vehicle and the service condition of the charging station is increased.

As a possible embodiment, the at least one charging station may be preset as a preset number of charging stations nearest to the vehicle, for example, the nearest 5 charging stations on the vehicle travel path are acquired. The specific preset number is not limited herein.

Step S203: and acquiring a target charging station based on the service condition and the preset condition of the charging station.

The server may determine, as the target charging station, one charging station from among the at least one charging stations such that the actual waiting time of the vehicle is smaller than the maximum waiting time, based on the use condition and the predetermined condition of the charging stations. Thus, the user can determine which charging station to go to by setting the travel path.

As a possible implementation manner, after the target charging station is acquired, the waiting time of the vehicle may be predicted according to the use condition and the predetermined condition, and it may be determined whether the waiting time of the vehicle can meet the preset requirement of the user. If yes, sending the estimated waiting time to the vehicle so as to inform the user of the estimated waiting time; if not, the other charging stations are reacquired as target charging stations.

Step S204: and generating a predetermined order by utilizing the target charging station, and sending the predetermined order to the vehicle.

When the server selects a charging station, a predetermined order may be generated using the target charging station and sent to the vehicle to inform the user in advance how much distance to travel next will reach the charging station for charging.

As a possible implementation, referring to fig. 3, the steps S202-S203 may first poll and find the charging station resources as needed, and after determining the charging station, poll and obtain the charging pile information in the determined charging station to determine the appropriate charging pile.

The first charging station polling method comprises the following steps: (1) acquiring a charging station queue, wherein the charging station queue is generated by sequencing the at least one charging station according to the sequence from near to far from the vehicle; (2) acquiring the service condition and the preset condition of the charging piles in the first charging stations, wherein the first charging stations are the charging stations which are ranked first in the charging station queue; (3) in response to all charging piles in the first charging station being reserved, replacing the first charging station with a second charging station, and returning to execute the reserved condition of acquiring the first charging station, wherein the second charging station is a charging station in sequence after the first charging station in the charging station queue; (4) and determining that the first charging station is a target charging station in response to at least one charging stake in the first charging station being unscheduled and the use of the unscheduled charging stake causing the actual waiting time of the vehicle to be less than the maximum waiting time.

For example, a charge station queue is obtained, the charge station queue including three charge stations of M charge stations, m+1 charge stations, m+2 charge stations in a sequential arrangement. M is a charging station 20 km from the vehicle; m+1 is a charging station 60 km from the vehicle; m+2 is a charging station 100 km from the vehicle. The usage and the predetermined situation of the first charging station should be acquired at this time, i.e., the usage and the predetermined situation of the M charging station are acquired.

When all charging piles in the M charging station are reserved, the service condition and the reserved condition of the M+1 charging station are acquired, and the operation is circularly carried out until a certain charging pile is not reserved, wherein the service condition (including the condition of non-use and short residual charging time) of the charging pile can enable the actual waiting time of the vehicle to be smaller than the maximum waiting time. Therefore, charging stations with relatively short distances can be preferentially selected for charging, the vehicle is timely guaranteed to continue to run, the electric quantity is prevented from being too low, other charging stations with relatively short distances are timely obtained when the charging stations with relatively short distances are not available, and the vehicle is fully guaranteed to complete charging operation.

When a certain charging pile in the M charging stations is not preset, the service condition of the charging pile (including the condition of non-use and short residual charging time) can enable the actual waiting time of the vehicle to be smaller than the maximum waiting time, and the M charging stations can be determined to be target charging stations.

Secondly, the charging pile polling method comprises the following steps: (1) acquiring a first charging pile queue, wherein the first charging pile queue is generated by sequencing charging piles in the first charging station according to the sequence from small to large of the residual charging time; (2) acquiring a preset condition of a first charging pile, wherein the first charging pile is a charging pile which is sequenced first in a first charging pile queue; (3) responding to the preset condition of the first charging pile as preset, replacing the first charging pile by a second charging pile, and returning to execute the preset condition of acquiring the first charging pile, wherein the second charging pile is a charging pile which is ordered after the first charging pile in the first charging pile queue; (4) and responding to the fact that the preset condition of the first charging pile is not preset, acquiring the service condition of the first charging pile, wherein the service condition of the first charging pile comprises the residual charging time of the first charging pile, and calculating the actual waiting time based on the residual charging time of the first charging pile, wherein the actual waiting time is the residual waiting time of the charging pile when the vehicle reaches the first charging pile.

For example, when the service condition and the predetermined condition of the charging piles in the M charging stations are acquired, a charging pile queue of the M charging stations may be acquired first, where the charging pile queue of the M charging stations includes N charging stations, n+1 charging piles, n+2 charging piles, and n+3 charging piles that are sequentially arranged.

Then, acquiring whether the N charging piles are reserved or not, if so, acquiring whether the N+1 charging piles are reserved or not, and executing circularly until the charging piles in the N charging station, the N+1 charging piles, the N+2 charging piles and the N+3 charging piles are not reserved, and calculating the actual waiting time corresponding to the charging piles which are not reserved; or when all charging piles are preset, acquiring a charging pile queue of the next charging station M+1 charging station.

If not, calculating the actual waiting time of the N charging piles, the actual waiting time = the remaining charging time of the charging piles-the time required for the vehicle to reach said first charging pile. And if the actual waiting time is smaller than the maximum waiting time, the charging station (M charging station) where the N charging piles are located is the target charging station.

As a possible implementation manner, for each charging station, a charging queue may be established, for storing the use condition and the preset condition of the charging pile in the charging station, and updating in time after the use condition and the preset condition are changed.

On this premise, acquiring the use condition and the predetermined condition of the charging pile in the first charging station may include: firstly, acquiring a charging queue corresponding to the first charging station, wherein the charging queue is a queue of historical orders ordered from small to large according to the expected charging time, and the historical orders are preset orders of other vehicles at the charging station; and obtaining the service condition and the preset condition of the charging pile in the first charging station based on the charging queue corresponding to the first charging station. In this way, the charging resources can be integrated,

On the premise, after generating a predetermined order with the target charging station, the method further comprises: and updating the charging queue corresponding to the target charging station by utilizing the preset order, so that the state of the target charging station in the charging queue is changed to be preset.

As another possible implementation, any "predetermined" charging behavior has not been honored when the vehicle has not entered the charging station. When any one of the actual redemption occurs, the charge latency of all "scheduled" vehicles under the charging station that have not yet been redeemed is affected. As the sequencing of different vehicles arriving at the charging station is different. Such as: in the same charging station, the late-scheduled vehicle arrives at the charging station earlier than the early-scheduled vehicle for charging. At this time, the server needs to adjust the charging resources in time and report relevant information to inform the affected vehicles.

The above situation requires that the predetermined usage of the charging post is continuously acquired after the target charging station is determined. When the vehicle is actually honored with the "reservation", the resources need to be allocated again to the vehicle that has been "reserved" and the relevant user is notified. The method and the device facilitate the user to judge whether to re-schedule or not, and are beneficial to the user to know the real charging time of the vehicle in real time, so that the anxiety of the user in the charging activity is reduced.

When the remaining charging time of the predetermined charging pile becomes longer, this means that other people use the predetermined charging pile, and need to recalculate the actual waiting time to determine whether the actual waiting time meets the preset requirement of the user. When the preset requirement is met, the recalculated actual waiting time can be sent to the vehicle again; when the preset requirement is not met, the charging station queue needs to be re-acquired, and the target charging station needs to be re-acquired.

The method specifically comprises the following steps: calculating iteration waiting time based on the residual charging time of the first charging pile again in response to the change of the residual charging time of the first charging pile, wherein the iteration waiting time is the residual waiting time of the charging pile when the vehicle reaches the first charging pile after the change of the residual charging time of the first charging pile; and in response to the iteration waiting time being greater than the maximum waiting time, returning to execute the obtaining charging station queue.

As another possible implementation, step S204 may include: (1) acquiring the number of the vehicle, the number of the target charging station and the number of the first charging pile; (2) the estimated time of arrival of the vehicle and the estimated time of charge of the vehicle are calculated. Wherein the vehicle estimated time of charge is the time required for the vehicle to reach the target charging station, the vehicle estimated time of arrival = the remaining time of charge of the first charging peg-the vehicle estimated time of arrival + the time required for the vehicle to charge; (3) and generating a preset order with generation time and number according to the number of the vehicle, the number of the target charging station, the number of the first charging pile, the expected arrival time of the vehicle and the expected charging time of the vehicle. This way, by numbering the orders of the reservations, it is possible to distinguish whether or not it is a reinitiated reservation. It should be noted that, for the re-initiated reservation request, the previous reservation order needs to be cancelled and reserved once again.

In summary, according to the embodiment, through charging reservation, the server can centrally manage the service condition of the charging station, estimate the waiting time of the vehicle, select other suitable charging stations under the condition that the waiting time of the current charging station exceeds the preset time, the whole reserved charging activity does not need manual operation by a driver, the running safety of the vehicle is improved, the operation trouble of the user is reduced, and the manual operation load of the user for selecting the charging stations in the driving process is reduced; the centralized background manages charging station resources under all inter-city roads, and preset charging distribution is carried out according to the charging demands of vehicles, so that the situation that a large number of users wait for charging at the same charging station is greatly reduced, and the use efficiency of the charging station resources is improved; each charging reservation order allocated to the vehicle is within the waiting time range set by the driver, so that the charging waiting time is effectively shortened.

Referring to fig. 4, fig. 4 is a flowchart of a method for charging planning method applied to a vehicle side according to an embodiment of the present application, including:

step S401: a charging reservation request is sent to the server.

Wherein the charging reservation request includes a vehicle travel path and a maximum waiting time, which is a maximum value of waiting times accepted by the vehicle. As a possible implementation manner, the charging reservation request may further include a number of the vehicle, a range of the vehicle, and an existing reservation order number of the vehicle (for canceling a previous reservation order).

Step S402: and receiving a predetermined order sent by the server.

After receiving the predetermined order sent by the server, the predetermined order can be displayed to the user, 1. The manual operation burden of the user for selecting the charging station in the driving process is reduced: the whole reservation charging activity does not need manual operation of a driver, so that the running safety of the vehicle is improved, and the operation trouble of a user is reduced.

As a possible implementation, referring to fig. 5, before step S401, the vehicle may first detect whether the remaining range is less than a threshold. Responsive to the remaining range of the vehicle being less than a preset threshold, checking whether a vehicle navigation path exists; and responding to the existence of the vehicle navigation path, taking the vehicle navigation path as a vehicle driving path, and generating a charging preset request according to the vehicle driving path.

In addition, the charging station periodically transmits the usage and reservation of all charging piles in the station to the server. It should be noted that, the charging station queue, the charging pile queue and the charging queue corresponding to the charging station may be transmitted in the form of queues.

In summary, the embodiment can send out the charging reservation request in a reasonable time, so as to reduce resource waste caused by sending out the charging reservation request too early and reduce charging delay caused by sending out the charging reservation request too late.

Referring to fig. 5, fig. 5 is a flowchart of a method applied to a charging planning system according to an embodiment of the present application, including:

s1: the vehicle polling checks the charge request to determine if the vehicle needs to be charged.

If yes, S2 is entered; if not, repeating the step S1.

S2: the vehicle initiates a charging reservation request to the server.

S3: the server dynamically programs the charge request.

Comprising the following steps: firstly, obtaining a charging pile queue and a preset charging queue by inquiring data; and then, the reservation waiting time is calculated in real time by combining the state of the charging pile which is uploaded by the charging pile polling, and whether the reservation waiting time can meet the user requirement is judged.

If yes, updating data, and entering step S4; if not, initiating a re-reservation request, and repeatedly executing S3.

S4: the server replies to the reservation or replying to the reservation.

Comprising the following steps: when the charging plan is obtained for the first time, directly replying to the reservation, and entering S5; when the charging plan is not obtained for the first time (i.e. re-planning), whether the charging station is changed or not can be judged, if yes, the reservation is replied again, and S5 is entered; if not, directly ending.

S5: the vehicle accepts a predetermined reply.

In summary, the collaborative flow of the charging planning method is explained in the system aspect, and under the existing charging device and method, the charging activities of the electric vehicles are supplemented and expanded, so that the service efficiency of the charging stations under the achievement road can be improved more efficiently, the waiting time of the electric vehicles is shortened, the reasonable utilization of charging resources is ensured, and the user experience is improved.

The embodiments of the present application provide some specific implementations of a charging planning method, and based on this, the present application further provides a corresponding apparatus. As shown in connection with fig. 6, an embodiment of the present disclosure provides an apparatus for charge planning, including a processor (processor) 100 and a memory (memory) 101. Optionally, the apparatus may further comprise a communication interface (Communication Interface) 102 and a bus 103. The processor 100, the communication interface 102, and the memory 101 may communicate with each other via the bus 103. The communication interface 102 may be used for information transfer. Processor 100 may invoke logic instructions in memory 101 to perform the charge planning method of the above-described embodiments.

Further, the logic instructions in the memory 101 described above may be implemented in the form of software functional units and may be stored in a computer readable storage medium when sold or used as a stand alone product.

The memory 101 is a computer readable storage medium that can be used to store a software program, a computer executable program, such as program instructions/modules corresponding to the methods in the embodiments of the present disclosure. The processor 100 executes the function application and the data processing by executing the program instructions/modules stored in the memory 101, i.e., implements the charge planning method in the above-described embodiment.

The memory 101 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, at least one application program required for a function; the storage data area may store data created according to the use of the terminal device, etc. Further, the memory 101 may include a high-speed random access memory, and may also include a nonvolatile memory.

Embodiments of the present disclosure provide a computer-readable storage medium storing computer-executable instructions configured to perform the above-described charge planning method.

The disclosed embodiments provide a computer program product comprising a computer program stored on a computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the above-described charge planning method.

The computer readable storage medium may be a transitory computer readable storage medium or a non-transitory computer readable storage medium.

Embodiments of the present disclosure may be embodied in a software product stored on a storage medium, including one or more instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of a method according to embodiments of the present disclosure. And the aforementioned storage medium may be a non-transitory storage medium including: a plurality of media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or a transitory storage medium.

The above description and the drawings illustrate embodiments of the disclosure sufficiently to enable those skilled in the art to practice them. Other embodiments may involve structural, logical, electrical, process, and other changes. The embodiments represent only possible variations. Individual components and functions are optional unless explicitly required, and the sequence of operations may vary. Portions and features of some embodiments may be included in, or substituted for, those of others. Moreover, the terminology used in the present application is for the purpose of describing embodiments only and is not intended to limit the claims. As used in the description of the embodiments and the claims, the singular forms "a," "an," and "the" (the) are intended to include the plural forms as well, unless the context clearly indicates otherwise. Similarly, the term "and/or" as used in this application is meant to encompass any and all possible combinations of one or more of the associated listed items. Furthermore, when used in this application, the terms "comprises," "comprising," and/or "includes," and variations thereof, mean that the stated features, integers, steps, operations, elements, and/or components are present, but that the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof is not precluded. Without further limitation, an element defined by the phrase "comprising one …" does not exclude the presence of other like elements in a process, method or apparatus comprising such elements. In this context, each embodiment may be described with emphasis on the differences from the other embodiments, and the same similar parts between the various embodiments may be referred to each other. For the methods, products, etc. disclosed in the embodiments, if they correspond to the method sections disclosed in the embodiments, the description of the method sections may be referred to for relevance.

Those of skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. The skilled artisan may use different methods for each particular application to achieve the described functionality, but such implementation should not be considered to be beyond the scope of the embodiments of the present disclosure. It will be clearly understood by those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.

In the embodiments disclosed herein, the disclosed methods, articles of manufacture (including but not limited to devices, apparatuses, etc.) may be practiced in other ways. For example, the apparatus embodiments described above are merely illustrative, and for example, the division of the units may be merely a logical function division, and there may be additional divisions when actually implemented, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. In addition, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form. The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to implement the present embodiment. In addition, each functional unit in the embodiments of the present disclosure may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. In the description corresponding to the flowcharts and block diagrams in the figures, operations or steps corresponding to different blocks may also occur in different orders than that disclosed in the description, and sometimes no specific order exists between different operations or steps. For example, two consecutive operations or steps may actually be performed substantially in parallel, they may sometimes be performed in reverse order, which may be dependent on the functions involved. Each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

Claims

1. A method of charging planning, the method comprising:

2. The method of claim 1, wherein the obtaining a target charging station based on the usage and the predetermined condition of the charging station comprises:

3. The method of claim 2, wherein the obtaining the usage and the predetermined condition of the charging stake in the first charging station comprises:

4. A method according to claim 3, wherein after said calculating the actual waiting time, the method further comprises:

5. A method according to claim 3, wherein said generating a predetermined order with said target charging station comprises:

6. The method of claim 2, wherein the obtaining the usage and the predetermined condition of the charging stake in the first charging station comprises:

7. A method of charging planning, the method comprising:

and receiving a predetermined order sent by the server.

8. The method of claim 7, wherein before the vehicle sends a charging reservation request to a server, the method further comprises:

9. A method of charging planning, the method comprising:

10. A charge planning system, the system comprising:

a server, at least one vehicle, and at least one charging station;