EP2735072A1

EP2735072A1 - Providing electrical energy

Info

Publication number: EP2735072A1
Application number: EP11749794.1A
Authority: EP
Inventors: Kolja Eger; Alexander Kepka; Andreas Zwirlein; Georg Von Wichert
Original assignee: Siemens AG
Current assignee: Siemens AG
Priority date: 2011-08-18
Filing date: 2011-08-18
Publication date: 2014-05-28
Also published as: WO2013023701A1; US20190054830A1; CN103891086A; CN103891086B; US20140203779A1

Abstract

The invention relates to the use of electrical energy which has been provided for a session (e.g. for charging an electric vehicle), but not called up (required) and which can be otherwise used for at least one other session. This is advantageous in that the available electrical energy can be divided efficiently between the sessions in accordance with the actual energy required. Another advantage consists in the fact that a plan set prior to this allocation requires only a low, or zero, degree of predictive accuracy since the amounts of assigned electrical energy can be corrected during the charging process. The invention can be used, for example, in electro-mobility and load management when charging a plurality of electric vehicles.

Description

description

Provision of electrical energy The invention relates to a method and a device for providing electrical energy, in particular with regard to the field of electromobility or the charging of electric vehicles. Electromobility requires an infrastructure that allows electric vehicles to be recharged from a power grid. The electric vehicles are preferably connected and charged via charging stations (e.g., publicly available charging stations). Furthermore, there are additional components or functions for authentication, billing and / or monitoring of the loading processes.

In the case of a large number of charging processes, which are initiated at different times, it is problematic to distribute the available electrical energy or the charging current and the network capacities efficiently and fairly.

The object of the invention is to provide an efficient and clean for the supply network approach to charging electric vehicles.

This object is achieved according to the features of the independent claims. Preferred shapes are Out guide insbesonde ^¬ re gathered from the dependent claims.

To solve the problem, a method for providing electrical energy is given,

- in which at least a part of for a session be ^¬ riding detected electrical energy, which was not called off, is provided at least one other session. At the meeting, it is for example, a charge ^¬ process for an electric vehicle. Here, for example, can ei ^¬ ner centralized unit, eg a charge management, a variety of sessions are managed. The provided electrical energy may include, for example, a charging current for the respective session.

This solution has the advantage that freed or unclaimed resources can be allocated to other sessions. Thus, a consumer or a charging station blocked not necessarily the whole energy provided, son ^¬ countries the excess of uncalled energy can be assigned to at least one more meeting. This also has the advantage that a correction of the energies provided is possible and thus, for example, an initial planning of the electrical energies reserved for the individual sessions must have a lower accuracy due to the possibility of correction. In other words, the initial assignment of the resources can have a higher error, which can be corrected successively, for example, during the actually performed loading operations.

An advantage is that a given (power ^¬ or load) profile, which, for example, generated or agreed upon (for example, purchased) was adhered to and / or is used efficiently.

It should be noted here that the term energy in particular includes or relates to: a current, a voltage, a power and / or an energy in the narrower sense.

It should also be noted that the communication between the electric vehicle and the charging infrastructure may be unidirectional or bidirectional. For example, the electric vehicle can explicitly communicate its required energy or desired power consumption of the charging infrastructure. It can also be determined from the behavior of the electric vehicle or a charging station, which electrical energy the Electric vehicle is provided. In particular, it is ei ^¬ ne option that a charging current between the electric vehicle and the charging infrastructure is negotiated. A further development is that the one electrical Ener ^¬ energy that has not been retrieved by the session, completely or substantially completely is another meeting at least provided. Another development is that a portion of the electrical energy that was not retrieved from the session is provided to the at least one other session.

Here, the amount of electrical energy that is provided to the at least one other session can be reduced by a predetermined amount. This allows the meeting shortly to request up to this amount increased elekt ^¬ innovative energy and also to get (safety margin ^¬).

In particular, it is a development that the electrical energy provided to the session depends on a type of session. For example, the type of session may dictate that it is a session that uses a Schuko plug and should only be supplied with a constant electrical energy. Optionally, depending on the type of session, the electrical energy provided can be set to be constant or nearly constant or variable.

It is also a further development, that at least the part of the electrical energy provided for the session, which has not been retrieved, which is a different session provided at least, if at least the part of the non abge ^¬ called electric energy reaches a predetermined threshold or exceeds. Furthermore, it is a further development that at least the part of the electrical energy which has been provided for the session and which has not been called up is made available to the at least one other session if a maximum of the unrequested part of the electrical energy determined at different times exceeds the predetermined threshold value reached or exceeded.

This prevents small amounts of released electrical energy from giving rise to redistribution and thus a large number of inefficient redistributions of small amounts of electrical energy.

In an additional development, at least the portion of the electrical energy provided for the session which has not been retrieved is provided to the at least one other session for a predetermined period of time.

A next development is that

- determined after the expiry of the specified period of time

is that electrical energy required by the session ^¬;

- if the electric provided to the meeting

Energy is not retrieved, at least part of the electrical energy provided is provided to at least one other session.

In that regard, a predetermined period of time can be determined, after the expiration of a re-allocation of electrical energy.

One embodiment is that a load distribution for at least one session is set by a gradual allocation of electrical energy.

With the gradual allocation of electric power may be a gradual, such as time-graded Zuwei ^¬ solution of the electrical energy to the at least one session act. The progressive allocation (quasi-) can be carried continu ously ^¬ by the electric energy is gradually adapted to the course of time. In the gradual allocation of electrical energy, it is advantageous that a peak load, which could be caused by a new or changed load distribution, is effectively avoided. ^{By way of} example, the respective charge current is communicated to several sessions at least partially at different times.

An alternative embodiment is to progressively adjust the load distribution for multiple sessions by sequencing the electrical energies for the multiple sessions.

A next embodiment is that the stepwise allocation of the electrical energy comprises several steps, between which a predetermined period of time lies.

In particular, it is possible to wait between the individual steps until a session has set and / or receives a given (for example lower) electrical energy.

It is also an embodiment that the electrical energy is further reduced or switched off, if after Ab ^¬ running the predetermined period of time, the allocated electrical energy is not set.

A development is that the predetermined time ^¬ duration is constant or variable. In particular, the plurality of steps in such may be separated from each other by moving ^¬ che time periods or by different time durations. An additional embodiment is that the Lastvertei ^¬ ment is set for several sessions by

- be set meetings for which the electrical energy is to be redu ^¬ ed;

- to set the sessions for which the electrical energy is to be increased.

For example, only those La ^¬ destationen be set in a first step, for which the new charging current from the previous charging current to be reduced. In a second step, such charging stations can then be set for which the charging current is to be increased compared to the previous charging current. Preferably, it is previously checked (eg measured) whether the reduced charging current has also been successfully set or achieved.

Another embodiment is that the sessions are set with the increased electrical energy, if a current extracted electrical energy is less than or equal to a target value for the electrical energy.

It is a possibility also that the provided elekt ^¬ innovative energy is a charging current for an electrical load or power consumption of the required electric load.

It is also a further embodiment that the electrical consumer is an electric vehicle. Furthermore, it is a development that the session includes a charging process for an electric vehicle.

The approach described here may be a hardware component and / or software functionality. In particular, a load management for a charging ^¬ system is presented comprising, for example, several charging stations, which are for example part of a public electricity charging station. A load management determines a load distribution in compliance with various conditions, which may be both economic and (network) technical. For example, network bottlenecks can be avoided and at the same time it can be ensured that, for example, a loading process is carried out efficiently and network-friendly.

The above object is also achieved by a device for providing electrical energy with a processing unit which is set up such that

- at least a part of a bereitge for a session ^¬ presented electrical energy that has not been accessed is providing ^¬ bar, at least one other session. One embodiment is that the processing unit of the ^¬ art is configured such that a load distribution for at least one session by a stepwise allocation of electric power is adjustable. One option is that the device is at least partially ^¬ belongs to a loading station of an electric vehicle.

The processing unit mentioned herein that may be embodied in particular as a processor unit and / or an at least partially solid ^¬ wired or logic circuitry, for example, is set up such that the method can be performed as described herein. Said processing unit may be any type of processor or computer or computers with corresponding peripheral systems (SpeI ^¬ cher, input / output interfaces, input-output devices, etc.) or include.

The above explanations regarding the method apply to the device accordingly. The device may be implemented in one component or distributed in several components. The presented solution further comprises a Computerpro ^¬ program product, directly loadable into a memory of a digital computer, comprising program code portions which are suitable to carry out steps of the method described herein.

Furthermore, the above problem is solved by means of a computer-readable storage medium, e.g. any memory comprising computer-executable instructions (e.g., in the form of program code) adapted for the computer to perform steps of the method described herein.

The above-described characteristics, features, and advantages of this invention, as well as the manner in which they will be achieved, will become clearer and more clearly understood in connection with the following schematic description of exemplary embodiments which will be described in detail in conjunction with the drawings. The same or equivalent elements can be provided with the same Bezugszei ^{¬ Chen} for clarity.

Show it:

Fig.l is a schematic diagram for charging electric vehicles via a power grid;

2 is a schematic architecture of a distributed load management that the approach 'choice of a master, "he ^¬ enables or supports;

3 shows an exemplary state diagram for a charging station;

4 shows a schematic representation of an exemplary

Architecture for load management in conjunction with a (e.g., central) charge controller for

Electric vehicles 5 is a diagram showing the timing of different charging processes for three electric vehicles;

6 is a schematic representation for illustrating a change management for the load management.

4 shows a schematic representation of an exemplary load management architecture 401 in conjunction with a (e.g., central) electric vehicle charge controller 407. The charge control device 407 communicates, for example, with at least one charging station (not shown in FIG. 4), wherein at each charging station at least one electrical load is connected to an energy store, e.g. an electric vehicle, can be connected.

The load management 401 includes a load management method

402, a session management 403, a change management 405 for load management, a session control 404 (preferably ^¬ for each session) and a parameterization 406. A session preferably denotes a (charging) operation of an electric vehicle, for example, at the mentioned charging station is connected. The session is also referred to here as session.

In the load management process 402, the session management

403, the change management 405, the session control 404, and the parameterization 406 there are in each case egg ne (functional) component of the load management 401, which may optionally be implemented in software and / or hardware on a device or on several ^¬ ren devices , For the sake of simplicity, reference will be made below to the individual functional components 403 to 406 in the nomenclature presented, without it being indicated in each case that this may be a function or a functional component. In addition, it should be noted that the functional separation according to Figure 4 is a clear representation; a concrete implementation may combine several of these functiona ^¬ len blocks. Thus, it is a possibility that the components 402-406 represent functions of the load management 401, wherein the load management 401 may be implemented on at least one physical component.

For example, the following messages are transmitted between the load management 401 and the load control device 407:

a power request 408 from the charge controller 407 to the session manager 403;

a session end message 409 from the charging control device 407 to the session management 403;

a session update message 410 from the launcher 407 to the session control

404;

a power setting message 411 from the change management 405 to the charge control device 407, in which the electrical energy per session is indicated;

- a message 412 for setting load Manage ment ^¬ parameters, wherein the message is transmitted 412 from the charge controller 407 to the parameterization 406;

a message 413 for updating the load management parameters, the message 413 being transmitted from the parameterization 406 to the charge control device 407. Session Management

The session manager 403 manages the active sessions with their current state. The current state of a session is determined by session control 404. The session management 403 receives the power request 408 so ^¬ as the session end notification 409 from the charging control device 407 and pushes on this basis, a (re) calculation tion of the load distribution in the load management process 402.

Depending on a current status of the meeting shall have the Session Management 403 to discontinue the charging ^¬ stream this session. For example, it may be agreed that a session that is loaded via a plug type "Schuko plug" should only receive a constant charging current. In that regard, the session management 403 of such a meeting also assigns a constant charging current.

Session Supervisor

Each session is connectivity check example of an instance of a sit-monitored 404, and receives from the Ladesteue ^¬ approximate device 407 reporting on the basis of Sitzungsaktualisierungsnach- 410 a current status.

Preferably, 404 unused, e.g. freed-up or freed-up resources are (re) used (reassigned).

For example, by means of a parameter I ^IS, an actual current is passed to the load management 401 via the session update message 410. On the basis of the parameter I ^IS can be determined whether the electric energy ^¬ prepared for an electric vehicle is also retrieved from this electric vehicle (or the charging station for this electric vehicle). If not all the electrical energy provided is retrieved, the remainder can be distributed to other charging stations. Thus, it is possible to use untapped resources efficiently and promptly and to increase thus ^¬ with the efficiency of loading operations. The current measured current value of a session can be transmitted from the charging station to the charging control device 407 and from there to the load management 401. Furthermore, it is possible that the charging station adjusts the current with the the electric vehicle to be loaded or the electric vehicle tells a charging current, which must not be exceeded ^¬ th. This current can be limited by the charge control device 407. The current current provided to the charging station can thus be specified by the charging control device 407 explicitly to the load management 401 in absolute values and / or in the form of changes, for example in units of 0.5A.

If the maximum of reported values for a predetermined time interval below a predetermined maximum bereitge ^¬ set charging current i ^TARGET _{f so} the measured maximum of the charging current (or alternatively a derived therefrom value, for example 110% of the maximum of the measured charging current) is as further Be ^¬ limitation for the session used. Then, a new load distribution is determined, in which the freely usable An ^¬ part of the charging current jA _ -j- TARGE _ -j-IST can be made available to other meetings.

In other words, it is determined which current Ι ^Δ current is not used by an electric vehicle or the associated charging station and thus can be assigned to other charging operations (other sessions). In this case, the charging current I ^{IS can} correspond to the maximum of the charging current measured over a predetermined number of time intervals. In addition, the charging current I ^IS can contain a safety margin: For example, the charging current I ^IS can amount to 110% of the maximum measured charging current. This could be compensated for a slight variation of the attached ^¬ demanded charging current without the need for a new load distribution of resources (ie the current) would be necessary for the meetings.

The frequency of redistribution can, for example, be limited to a (predetermined) level by means of a ^¬ Pa rameters ^Δ ΜΙΝ:

If the difference from the setpoint i ^ARGE nd the maximum is at times ti, t2, ..., _n t is larger than the reported values Pa ^¬ parameters ^Δ ΜΙΝ, ie

-j- TARGET _ ^ _{ jlST _{{ti) f} ^ ST ^ j ^ I ^{I ST} ( _tn )}> Δ "™, a redistribution is performed.

Since the charging station over the Benö ^¬ preferential of an electric vehicle charging current can vary over time, the loading can limitation of the charging current after a predetermined time period are canceled. Then, the maximum of the charging current can be redetermined and possibly another charge current this

Electric vehicle to be provided. The predetermined time period may ^¬ for example by means of a parameter indicating when a renewed determination of the charging current is obtained, are indicated.

FIG. 5 shows three sessions 501 to 503, wherein each session relates, for example, to a charging process for an electric vehicle. Per session 501 to 503 are shown:

- one maximum charging current 504, 507 and 510 each;

- Each requested charging current 505, 508 and 511;

- In each case, an actual charging current 506, 509 and 512. In the example shown, a total charge current of 100A is available, which should be properly divided between sessions 501 to 503. The maximum charging current 504, 507 and 510 is 501 to 503 for all sessions 80A. For example, the requested charging current from the Sit ^¬ wetting 503 511 is reduced from 80A to 50A to a time 513 to a time 514 of the requested charge current 511 is increased again from 50A to 80A. This changeover between 80A and 50A continues for the requested charge current 511 until a time 520, at a time 521 the requested charge current 511 is reduced to 35A, at a time ^¬ point 522 the requested charge current 511 is increased to 40A and to a Time 523 again reduced to 35A. The act The neutral charging current 512 follows the requested charging current 511 by way of example.

Session 502 requests a charge current 508 of 50A at time 513 and a charge current 508 of 20A at time 514. This change continues over times 515-520. At the time 521 of the requested charge current ^¬ 508 is increased to 35A, at the time 522 redu 20A graces ^¬ and increases at the time 523 back to 35A.

Finally, charging current 505 requested by session 501 is at time 521 35A, at time 522 40A, and at time 523 again at 35A. The actual charge current 509 for session 502 is 20A throughout. The actual charge current 506 for the Sit ^¬ Zung 501 follows the requested charge current. This ensures that no more provided in sum as 100A ^¬ the need.

FIG. 5 thus shows by way of example that released resources can be used for other sessions. Thus, from time 516, the charging current of session 502 is reduced by 30A. This charging current may be assigned to session 503, which thus receives a charge current of 80A at time 516 (which otherwise could not be provided).

Change management for load management (load management rollout)

The change management 405 is notified of a new load distribution via the charge control device 407. If changes are implemented immediately, short-term peak loads (peaks) that are undesirable for the power grid can occur.

It is therefore proposed to gradually implement or discontinue the new load distribution. For example, a Changing to a predetermined charging current is not completely but gradually carried out, for example, in the case of a reduction of the charging current (for example electric vehicle) given the consumer a predetermined time period to set the charging current to the redu ^¬ ed value is not for multiple sessions at once and / or ,

For example, this predetermined time period can be set by the charging ^¬ station which is connected to the charging control device 407. If the new reduced charging current is not reached after the lapse of this predetermined period of time, the charging station can be switched off, for example, for a certain duration. Thus, it is possible to effectively avoid unwanted load peaks of the charging current, for example by not communicating all values of the new load distribution at the same time as new nominal values to the charging stations concerned. Instead, the values of the new load distribution, for example, are communicated to the charging stations with a time delay.

6 shows a schematic representation with steps for illustrating the change management for the Lastmana ^¬ gement.

For example, in a step 601, only the ones Ladestati ^¬ values are transmitted for which the new charging current from the previous charging current has been reduced. In a step 602, it can be checked whether the reduction of the charging current from the charging stations is maintained. This can be accomplished by monitoring the actual withdrawn charge current (I ^IS ) provided by the session control 404.

Now, in a step 603, the load management change management 405 may check whether the current current reading (aka TULLE current drawn) is less than or equal to the new setpoint _is ITarget ^ _d>h>

-j-IST <-j- TARGET

In this case, the change of the charging current is considered fulfilled. Now, in a step 604, the charging current for the other charging stations can be increased. This ensures that a reduction of an increase precedes what effectively prevents a load ^peak .

The step-by-step adaptations of the charging currents are preferably carried out in accordance with the new load distribution such that they are not interpreted by the load management method 402 as a reason for determining a changed load distribution (as long as the new load distribution has not yet been fully implemented). This can be achieved, for example, that the transition to the new Lastvertei ^¬ averaging is performed significantly faster than the cycles of calculation of a load distribution by the load management method 402 are. Then there is no or vernachläs ^¬ sigbare view that the load management method calculates 402 a load distribution before the new load distribution was implemented. One variant is that it is ruled out until the complete implementation of the new load distribution by the change management 405 that a load distribution is again determined by the load management method 402. For example, it may be provided that a further load distribution is only calculated if this is indicated by the change management 405, for example by means of a message to the session control 404, the session management 403 and / or the load management method 402. Example ^¬ example may be a marker (flag) active or inactive in the observation unit 404, 403 or 402 for this purpose, which indicates that the current load distribution has not yet been fully converted ^¬ sets. parameterization

The parameterization 406 manages parameters for the load management 401. In particular, the parameterization 406 may set parameters for the load management method 402.

In addition, it can be ensured by the parameterization 406 that parameters with a time dependency (for example, for a given total load profile) to the corresponding ^¬ the date are updated.

Load management method

The following explains how load distribution can be determined. For example, at least a portion of this calculation may be implemented in the load management method 402.

So an efficient and / or fair burden-sharing is he ^¬ ranges, in particular, various boundary conditions ^¬ can be held. For example, at least one of the following conditions is taken into account as boundary conditions:

Each loading session may be defined by an ID (also referred to as an identification or identifier), a charging device (e.g., a charging station) and e.g. be assigned to one or more groups based on a type of contract of a user or a vehicle to be loaded;

- a group of a capacity, for example, a charging capacity ^¬ dictated or otherwise determined to be;

- a boundary of a charging current can be set for a charging process or ^¬ for each loading operation;

- Each charging process, for example, can be supplied with a base charging current or a minimum charging current; - For each charging a weighting factor with regard to a prioritization of the charging be ^{¬ be} true. A local area network station for example, has a multi ^¬ plurality of outlets for the low-voltage network having a plurality of connection points via which, for example, a charging operation of a vehicle can be carried out by means of a charging station. A local network station is connected via (at least) one transformer to a power grid on the medium voltage level. The transformer provides a given maximum charge capacity. This maximum load capacity is to be maintained by the on ^¬ connection points. Furthermore, the power grid via the transformer different types of electricity, such as a cheap electricity and an ecologically produced electricity (hereinafter referred to as "ecological power"), provide ^¬ . The types of electricity can be linked to different prices. For example, it may be a requirement of a customer that the charging process to x% (with x = 0 ... 100) should be done with ecological power. This may be determined by contract and are accordingly taken into ^¬ into account when charging. It is also possible to use this proviso as

Desire to treat and, if the desire can not be met, to an alternative (here, for example, the cheap

Current). In that regard, a customer may for example be assigned to a group that exclusively or preferably carries out charging operations with ecological electricity (the contract type may be linked to the group affiliation).

Fig.l shows a transformer 101, which can be powered by a power grid with ecological flow 102 and with favorable current 103. The transformer 101 is part of a local network station, for example.

The transformer 101 is connected via a line with three outlets 117, 118 and 119. The outlet 117 is connected via a connection point 104 with a charging station 109, at the an electric vehicle 113 is loaded. The outlet 117 is further connected via a connection point 105 to a charging station 110, at which an electric vehicle 114 is charged. By way of example, the outlet 119 is also connected to the connection points 106 to 108, the connection point 106 being connected to a charging station 111, where an electric vehicle 115 is charged, and the connection point 108 is connected to a charging station 112, to which an electric vehicle 116 is charged.

For example, both the transformer 101 in the local network station and each of the outgoing circuits 117 to 119 provide a maximum capacity which may not be exceeded.

In a (centralized or decentralized) charging system, an identifier (ID) is managed for each loading process. The charging process for an electric vehicle also has a maximum zulässi ^¬ gene charging current I ¹ ^. Achieve those maximum charging current, for example, are as a minimum of the charging limiting sizes: For example, the maximum charging current is limited by ^¬ be

- a maximum load capacity of the cable Zvi ^¬ rule the electric vehicle and the charging station, - a maximum load capacity of the charging station,

- a maximum load capacity of the cable Zvi ^¬ rule the charging station and the disposal.

The smallest of the maximum permissible charging capacities (obviously: the weakest link in the chain) is decisive for the maximum permissible charging current i ¹ .

Preferably, a (temporary) charging is assigned exactly to a contract. The contract indicates whether, e.g. ecological electricity or cheap electricity should be used.

Also mixed forms of types of current are possible. In addition, it should be noted that in the example for the sake of clarity only two types of current are distinguished. Corresponding Many different types of current, for example from different vendors ^¬ union, possibly with different prices, possible. A contract may have a quota linked to the maximum permissible load capacity.

The charging system may receive one profile per group per day, for example, a plurality of values per unit time (e.g., 96 quarter-hourly values per day) may be provided or predetermined.

An example is Darge ^¬ presents with regard to Fig.l:

The electric vehicle 113 receives an identifier ID1 for the charging process, the electric vehicle 114 receives an identifier ID2 for the charging process, the electric vehicle 115 receives an identifier ID3 for the charging process and the electric vehicle 116 receives an identifier ID4 for the charging process. The electric vehicles 113 and 115 with the identifiers ID1 and ID3 are to be charged with ecological electricity 102 and the electric vehicles 114 and 116 with the IDs ID2 and ID4 with favorable electricity 103.

By way of example, the following groups result:

- Group G _ö k _/ charged with ecological electricity

will / should be:

- Group G _gü nst, loaded with low-cost electricity

will / should be:

G _discount = {2, 4};

Group GAbgi loaded at the exit 117

will / should be:

GAbgi = {1 2};

Group GAb _g 2 loaded at the exit 118

will / should be:

GAb _g 2 = {};

Group GAb _g 3 loaded at exit 119

will / should be: GAb _g 3 - {3, 4};

- Group G _Tra f _{0 /} which is loaded on the transformer

will / should be:

^ Transformer ^- {1, 2, 3, 4}.

The curly brackets {...} contain the identifiers of the electric vehicles 113 to 116 affected for the respective group. Alternatively, it is also possible to designate the identifiers ID1 to ID4 as identifiers for the loading operations.

Each group or a selection of the groups has, for example, a capacity limitation C _Gr uppe · Hereinafter is exemplified a central or decen ^¬ trales (see below) Charging System (also referred to as "load management") described with respect to, for example, a corresponding load sharing. The load distribution is preferably carried out taking into account predetermined secondary conditions. The charging system determines, for example, a parameter i ^Tar ^ ^et _f which determines the maximum power consumption (current) per charging or charging station. For example, the charging system may be operated in accordance with or based on the IEC 61851 standard.

By way of example, the charging system may comprise an interface which (implemented for example as a function ^¬ views) the following functions provides:

- energyRequest (): message to load management about another (new) load;

- sessionEnd (): end of a load;

- sessionUpdate (): update status values of a load;

- energySet (): set the parameter i ^ar 9 ^et _a ] _ _se j_ _n

Setpoint by the charging system.

Here, note that the charging process as a sit ^¬ injection (or as a "session") can be described. In the following, an exemplary approach is described, which, for example, enables an efficient and fair distribution of the total capacity via the control of the parameter i ^ar 9 ^et .

Fair load distribution of total capacity

In this scenario, a total capacity C is given. Furthermore, there is only a single group and the number of loads n is known. The setpoint i ^ar 9 ^et for ^ j_ _e load distribution is given by: n The load distribution can be carried out as follows:

(a) A charging station informs the (central) charging system of a status change, e.g. using the above mentioned functions energyRequest (), sessionEnd (), sessionUpdate).

(b) In a next step, the charging system determines a load distribution for each status change and transmits it to the charging station (s).

Fair weighted load distribution

Also in this scenario, the total capacity C is given, there is only a single group and the number of charging ^¬ n is known. For a charging $ € S a Ge ^¬ weighting factor W ji for prioritization is defined. The load distribution can be in the form of a vector be determined. The nominal value of the load distribution i per charging process is given by:

V * £ S

The load distribution is analogous to the steps in the scenario discussed starting vorste ^¬ "Fair load distribution of the total capacity".

For example: With a total capacitance C = 100 and n = 10 charging process ^¬ gears and a weighting of the 10 loading operations according to the following vector w follows from the load distribution vector

Fair load distribution with two constraints

Also in this scenario, the total capacity C is given, there is only a single group and the number of charging ^¬ n is known. The charging current can be individually limited to a maximum charging current I ¹ ^ for each charging process: r AX MAX

The load distribution can for example by means of a so-called ^¬ "Max-Min Flow Control" process carried out (cf .: D. Bertsekas, R. Gallager, "Data Networks", 2nd Edition, Prenti- ce-Hall, 1992, pp 527, 528). For example: With a total capacitance C = 100 and n = 10 and a charging process ^¬ transitions limit the charging current per charge results from a load distribution vector l ^'Tar? ^{": t} to:

Fair weighted and proportional load distribution

Each loading process can be assigned to different groups by an identifier of the charging station and by a contract type. For each group G can be a maximum _capacity. _{., (·;... _"·>} ·, · _<· ·» ':; de ^¬ be finiert for each charging the charging current _(according to the relationship jMAX ^ _/ rMAX e 5) be limited It can also be determined that each La ^¬ destation a base current i at ^least: ^'-: -.. is obtained for charging f, V w _a for a prioritization a weighting factor defined this results in the following maximization problem:.

with the constraints: where R represents a matrix with the loadings and their capacity ^limits , C a vector with all capacity ^limits and I ^TsV % ^{<! i} the load distribution vector. Instead of the logarithm function, any concave function can be used.

Example: Based on the example shown in FIG. 1, there are six further charging processes for the illustrated four charging processes. In total, this results in n = 10 charging ^¬ operations. In addition, the following maximum capacities are specified:

- for the ecological flow: C _ec = 45;

- for the cheap electricity: C _discount = 200;

- for the transformer C _Traf0 = 100;

- for exit 117: ÜAbgi = 40;

- for the finish 118: C _Abg 2 = 100;

- for departure 119: C _outflow 3 = 100; For the charging processes 1 to 10, the following maximum charging currents are specified:

The minimum current per charge is given. From this, the matrix R follows: wherein the columns of the matrix R characterize the loading operations 1 to 10. The vector R _exhaust i indicates that the charging operations 1 to 5 are supplied from the outlet 117, the vector R _{exhaust 3} indicates that the charging operations 6 to 10 are supplied by the outlet 119. Outgoing 118 does not charge in this example. The vector Rir _AFO indicates that the transmembrane ^¬ formator 101 all charging processes 1 to 10 supplied. The vector R _ec indicates that the charging processes 1, 3, 5, 7 and 9 are carried out with ecological current and the vector R _gü n _s t indicates that the charging processes 2, 4, 6, 8 and 10 with cheap electricity.

The vector C results

From this follows for the load distribution vector:

7.4424 ^"

8.8365

7, 424

S, 8365

f ^' tava t 7,4424

10,0000

12, 6729

17.3271

10, 0000

1.0.0000

In this example, the limiting constraints are the maximum allowable currents for the charges 6, 9 and 10, the maximum allowable capacity of the outgoing 117 (CAbgi = 40), the maximum allowable capacity of the transformer 101 (C _Tra f ₀ = 100) and the maximum allowable (or possible) ecological flow (C _ö k = 45).

Furthermore, it is also possible that the individual charging operations additionally receive a prioritization by means of the weighting factor ια _Λ . This prioritization can be considered in addition to the above requirements when determining the load distribution vector: ^' 6, 0000 ^'

6, 0000

9, Ü675

9, 824

6 1.0, 0000

7 1.3, 4176

8 19, 3325

9 10, 0000

10 10, 0000

An advantage of the approach presented here is that a maximum charge current for multiple loads, e.g. for multiple charging stations and / or electric vehicles, centralized or decentralized can be coordinated in compliance with predetermined versatile adjustable side conditions. The secondary conditions may include economic requirements and / or technical specifications. Example: Decentralized load management

Decentralized load management can follow in different ways. In the following, two possibilities will be explained by way of example.

(1) Choosing a Master:

Here, the charging stations or the charging processes, which are, for example, executable functions in a component, select a master that determines the load distribution. Below is assumed as an example that several charging stations act as peers (communicating compo ^¬ components or functions) and organize themselves. This approach is also possible for functions (such as charging processes) which are executed on one or more compo nents ^¬.

If the master fails, this recognize the other Ladesta ^¬ tions, there is a new master determined. This approach has the advantage that the load management is not for the decentralized approach, but can be adopted without changes from the central load management. The complexity which arises from a decen ^¬ spectral implementation, is out of Lastmana ^¬ GEMENT component and can be provided by other components.

(2) Communication without master (also referred to as "gossiping"):

In this case, a coordination without a central In ^¬ punched performed. The charging stations form a peer-to-peer (P2P) network and communicate with other loading stations (peers), that are selected, for example, random (or pseudozufäl ^¬ lig) or after a predetermined scheme.

Here, different estimates can be determined ^¬ to, for example on the current total consumption in the P2P network. Based on these estimates, a load management component of the charging station decides autonomously on the charging current ^{Ί ': ΐ} & ^. In the gossiping method, the load management is distributed (eg by means of a distributed algorithm). This

Step must be done again for each algorithm.

The gossiping method is suitable for large networks where central processing is too time-consuming or where the coordination of central processing alone would lead to a high traffic load.

The approach (1) "Choice of a Master" is described in more detail below. Especially for a small number of charging stations (eg approx. 32), the processing effort for the master is uncritical and does not affect the performance of the components. It is of advantage that a deterministic load ^¬ management can be achieved in which no fluctuations are caused by a convergence behavior. Example of a decentralized load management with "choice of a master"

FIG. 2 shows, by way of example, an architecture of a decentralized load management, which makes or supports the approach "choice of a master".

Preferably, a program is used in the charging stations, which tracks the decentralized approach described here. For example, one and the same program can run on several charging stations, since each charging station (as

Node of a P2P network) is able to take over the function of the master.

The program can use different communication channels, eg wireless or wired communication. Example ^¬ can as the charging stations on the Ethernet 201 and / or via a cellular network 202 (for example, GSM, UMTS, LTE, etc.) communicate with each other using TCP / IP 203rd In the protocol architecture of Figure 2 is above the

TCP / IP layer 203, an overlay network 204 is shown, which manages the logical network above the IP network.

In a P2P network, a large number of peers (in this example: charging stations) may be present with significant dynamics (changes over time). The overlay network 204 can be structured by means of distributed hash tables (so-called "distributed hash tables"). In the example described here, a management of the overlay network 204 in a configuration phase (also referred to as engineering phase or parameterization) can be supported by a central component, ie each peer (charging station). of the P2P network gets a complete list of all peers (charging stations) when it is configured.

Based on the list of all peers, the choice of master 205 is made in each of the charging stations. In a first step, the assumption is made that the lists of peers consignment ^¬ stent. In the case of inconsistent peer lists, these are synchronized. The master is selected based on a peer ID assigned by the central instance. For example, that charging station is selected as the master, which has the smallest peer ID.

If a charging station has determined itself to be the master, it activates a master mode and initializes a load management 206, eg by activating a load management algorithm. The necessary parameters can be set by the central component and may correspond to the Pa ^¬ rametern of the central load management. The master uses for example, the same interface of ^¬ len calls, such as in the central case, for example:

- energyRequest () for new requests,

- sessionEnd () to stop a load,

- sessionUpdate () for updating status values,

- energySet () for setting the desired value of a charging station ^¬.

For the transition calls for example corresponding XML messages can be defined for the decentralized case and USAGE ^¬ be det.

3 shows an exemplary state diagram for a charging station. First, from an initial state 301, a transition to a state 302 for initialization of the charging station takes place. In a subsequent state 303, the overlay network is initialized and in a subsequent state 304, the choice of the master takes place. If the master is selects, branches to a query 305. If the aktuel ^¬ le charging station itself has been selected as the master, execution branches to a state 306, there is carried out an initializing (or conversion) of the current charging station as a master. Subsequently or if the query 305 reveals that the current charging station was not selected as the master, a branch is made into a state 307 in which the charging station (as master or normal peer) is active. An abort causes a change to a state 308, in which the charging station logs off and enters a final state 309 (eg for switching off or servicing the charging station).

The decentralized load management may initially configured ^¬ to. Before a charging station becomes active in a decentralized load management, a connection is made to the central one

Component. For example, an installer after setting up the charging station via a laptop by means of the central component to perform the parameterization of the charging station.

For example, a charging station can log on to the central component and obtain the peer list of available charging stations. The installer can now set (set or update) necessary parameters. This type of parameterization is comparable to the scenario of the central one

Load management. Also, groups with capacity limitations can be set and charging stations can be grouped (added to groups or deleted from groups). After entering the information, the laser is set destation be by example, all parameters for setting in one file and transferred to the La ^¬ destation.

error handling

In the following faults are exemplified and in each case a corresponding error handling pre schla ^¬ gen. Failure of the master

Failure of the Masters is a critical error, and an error treatment is for a fortge ^¬ continued function in a decentralized scenario necessary because without a master load balancing is not possible.

If the master fails, the function of the master is to be taken over by another charging station. The following steps for this are preferably Runaway ^¬ leads:

(i) selecting a backup master as well as redundant SpeI ^¬ assurance of the load distribution of failure of the master;

(ii) detection of the failure of the master;

(iii) Election of a new Master among the requesting ones

Charging stations.

In order not to lose a current load distribution due to the failure of the master, this is e.g. stored in a pre-determined backup master. The backup master can be determined by its peer ID (for example, the second smallest peer ID is used for the backup master).

This approach can be applied by analogy for several backup master: To select multiple failures of masters to ausglei ^¬ chen, a list of a variety of backup masters may be used wherein a master every message from a loading station and to the backup master forwards. This ensures that the state of the master is also replicated to the backup masters.

In this case, it is an option that only the messages and not the complete load distribution information are passed on. is headed. The latter can determine the backup masters themselves based on the transmitted information.

A failure of the master can be detected by the first unanswered request of a charging station. Then the requesting charging station contacts the (ers ^¬ th) backup master and sends to this the unanswered request. The backup master requests from the master a so-called "heartbeat" message (ie information indicating that the master is still active and able to communicate). If the backup master receives the "Heartbeat" message of the Masters, the An ^¬ ask is not edited by the charging station, but to the actual master reference (This can be done well overall, by no action is taken by the backup master, because the backup master assumes that the master will answer the request of the charging station). If the backup master can not reach the master either (ie if there is no "heartbeat" message), it is assumed that the master has failed and the backup master activates its master mode and processes the request for the charging station. Another charging station, whose request remains unanswered by the original master, contacts the new master (formerly: Backup Master), which processes the charging station inquiry directly.

Preferably, in order to initialize the backup master as a new master at this, the status and for load management (list with load distributions) übertra ^¬ gen are.

As an alternative to redundant storage, in order to initialize the backup master as a new master, the complete state for load management can be assigned to it

(List with load distributions) or this can contact all other charging stations and query their condition. Failure of a charging station

If a charging station, which is not the master, falls out of ^¬ , two situations can be distinguished:

(i) The failed charging station had no active one

Charging;

(ii) The precipitated was charging stations in an acti ^¬ ven charging.

In the first case (i) the failure has no effect on the load management and can therefore remain untreated.

In the second case (ii) the failure of the Ladesta ^¬ tion could affect the load management and thus require monitoring of charging stations.

It is also possible that the failure of the charging station has a cause that is indistinguishable from a monitoring: For example, it can not be distinguished whether there is only a communication problem or if the charging station has failed. If only the communication to the charging station has failed, it could carry out a charging process unchanged. In this case, the resources allocated to this charging station can not be redistributed.

One option is not to monitor the charging stations, especially if resource redistribution is to remain unchanged. Thus, an error treatment for the failure of a charging station depending on the application also be omitted. Re-entry of a former master

If a former master becomes active again after his failure, it is preferable to ensure that no conflicts and / or inconsistencies occur.

For example, it is a possibility to assume that a failure of the master is an indication of further failures. It could be provided that the former Mas ^¬ ter not assume its master role again. To ensure this, the former master's peer ID can be changed. For example, the peer ID can be extended by a version number, for example, preceded by the version number prefix the peer ID. The choice of the master continues to be based on the smallest peer ID considering this prefix.

For other charging stations of the former master is marked as either inactive or on renewed request ant ^¬ wortet this (including the new version number) with an update its peer ID. This makes it possible to determine for the requesting charging station that the former master is no longer the current master.

Inconsistent peer lists

To determine the master unique across all charging station, the aforementioned peer list is ver ^¬ spent. Accordingly, this peer list should be kept consistent.

Preferably, the number of charging stations (for example, within a cluster) is small (for example, comprising about 32 La ^¬ destationen) be. Each charging station stores the peer list with the peer IDs of all other charging stations. The peer list can be parameterized by the central component. If a charging station is subsequently added, the peer list is parameterised on the basis of the central component. The new charging station receives the Update ^¬ te peer list and knows all charging stations on the network, but the charging stations know - first of all - not this new

Charging station. Preferably, a synchronization of the peer list on the charging stations is required. Such synchronization can be performed in different ways.

For example, it can be provided that the new charging ^¬ station initially not come as a master in question; this can be ensured by ascending peer IDs, for example, with the new charging station receives the highest ever peer ID and thus currently hardly be a master ^¬ will be selected.

To synchronize the peer lists, the new charging station logs in (eg by means of an oin message) to all other charging stations. Based on this application, the peer list at each charging station can be updated; the recipient adds his peer list to the peer ID and the IP address of the new charging station. Although the invention in detail by a ge ^¬ showed embodiment has been illustrated and described in detail at least, so the invention is not limited to this and other variations can be derived therefrom by the skilled artisan without departing from the scope of the invention.

Claims

Method for providing electrical energy, - in which at least part of an electrical energy ^provided for a session, which was not called up, is made available to at least another session.

Method according to claim 1, in which the electrical energy that was not called up from the session is provided completely or substantially completely to at ^least one other session.

Method according to one of the preceding claims, in which a portion of the electrical energy not retrieved from the session is provided to at least one other session.

Method according to one of the preceding claims, in which the electrical energy provided to the session depends on a type of session.

Method according to one of the preceding claims, in which at least the part of the electrical energy ^provided for the session that was not called up is made available to at least one other session if at least the part of the electrical energy not called up at least reaches a predetermined threshold value.

Method according to claim 5, in which at least the part of the electrical energy provided for the session that was not called up is made available to at least one ^other session when a maximum of the uncalled part of the electrical energy determined at different times exceeds the predetermined threshold value at least achieved.

Method according to one of the preceding claims, in which at least the part of the electrical energy ^provided for the session that was not called up is made available to at least one other session for a predetermined period of time.

Method according to claim 7,

- in which, after the specified period of time has elapsed, it is determined which electrical energy is required by the session;

- in which, if the ^electrical energy provided to the session is not called up, at least part of the electrical energy provided is provided to at least one other session.

Method according to one of the preceding claims,

- in which a load distribution for at least one ^session is set by gradually allocating the electrical energy.

Method according to claim 9, in which the load distribution for several sessions is adjusted step by step ^by setting the electrical energies for the several sessions one after the other.

Method according to one of claims 9 or 10, in which the gradual allocation of the electrical energy comprises several steps, between which there is a predetermined period of time.

Method according to claim 11, in which the electrical energy is further reduced or switched off if the allocated electrical energy is not set after the predetermined period of time has elapsed.

Method according to one of claims 11 or 12, in which the predetermined period of time is constant or variable.

14. The method according to any one of claims 9 to 13, in which the load distribution is set for several sessions by

- the sessions with a reduced electrical

energy can be adjusted;

- the sessions with increased electrical energy are stopped.

15. The method according to claim 14, in which the sessions with the increased electrical energy are discontinued if a currently withdrawn electrical energy is ^smaller or equal to a target value for the electrical energy.

16. The method according to any one of the preceding claims, in which the electrical energy provided is a charging ^current for an electrical consumer or a power consumption of the electrical consumer.

17. The method according to claim 16, in which the electrical

consumer is an electric vehicle.

18. The method according to any one of the preceding claims, in which the session includes a charging process for an electric vehicle.

19. Device for providing electrical energy with a processing unit that is set up in such a way that

- At least part of an electrical energy ^provided for a session that was not called up ^can be made available to at least another session.

Device according to claim 19, in which the processing unit is set up in such a way that load ^distribution for at least one session can be set by gradually allocating the electrical energy.

21. Device according to one of claims 19 or 20, in which the device is at least partially arranged in a charging station of an electric vehicle.