ARRANGEMENT FOR OPERATING A TECHNICAL INSTALLATION
20170023962 · 2017-01-26
Inventors
Cpc classification
H02J13/00006
ELECTRICITY
Y04S40/20
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
H02J3/00
ELECTRICITY
G05B2219/34316
PHYSICS
H02J2203/20
ELECTRICITY
Y04S40/12
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y02E60/00
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
International classification
Abstract
The invention provides for an arrangement for operating a technical installation comprising a number of machines, the arrangement comprises a control structure, the control structure being adapted for generating a schedule for sending requests to the machines by means of a simulation and in consideration of expectation values of the machines, for monitoring the operation achieved by switching of the machines, wherein switching of the machines is performed by the machines themselves, in order to achieve a template illustrating the switching of the machines, and for comparing the generated schedule with the template.
Claims
1. Arrangement for operating a technical installation comprising a number of machines, the arrangement comprising: a control structure; the control structure being adapted for generating a schedule for sending requests to the machines by means of a simulation and in consideration of expectation values of the machines, for monitoring the operation achieved by switching of the machines, wherein switching of the machines is performed by the machines themselves, in order to achieve a template illustrating the switching of the machines, and for comparing the generated schedule with the template.
2. Arrangement according to claim 1, adapted for operating a smart grid, wherein the control structure is adapted for monitoring the energy flow achieved by switching of the machines.
3. Arrangement according to claim 1, wherein the control structure is adapted for providing a rank array considering the expectation values of the machines used for generating the schedule.
4. Arrangement according to claim 1, wherein the control is performed with help of a fuzzy logic using the expectation values as input values.
5. Arrangement according to claim 1, comprising a number of agents associated to the number of machines and in connection with the control structure.
6. Arrangement according to claim 1, wherein the control is implemented within one control center forming a central control structure.
7. Arrangement according to claim 1, wherein the control structure comprises a scheduler for generating the schedule.
8. Arrangement according to claim 1, wherein the control center comprises a realization unit for sending requests to the machines, and for monitoring the operation achieved by switching of the machines in order to achieve a template illustrating the switching of the machines, and for comparing the generated schedule with the template.
9. Arrangement according to claim 1, wherein the simulation is performed on a rate basis.
10. Method for operating a technical installation according to claim 9 using an arrangement according to claim 1, comprising the steps of: generating a schedule for sending requests to the machines by means of a simulation and in consideration of expectation values of the machines, and monitoring the energy flow achieved by switching of the machines in order to achieve a template illustrating the switching of the machines, and for comparing the generated schedule with the template.
11. Method according to claim 10, which is adapted for operating a smart grid.
12. Method according to claim 11, comprising the step of providing a rank array considering the expectation values of the machines.
13. Method according to claim 11, wherein an expectation function is generated for each machine.
14. Method according to claim 11, wherein the simulation is performed on a rate basis.
15. Method according to claim 11, wherein the simulation is performed with help of patterns each pattern representing a protocol comprising an array of requests.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0098] In the drawings,
[0099]
[0100]
[0101]
[0102]
[0103]
[0104]
[0105]
[0106]
[0107]
[0108]
[0109]
[0110]
DETAILED DESCRIPTION
[0111] The figures are described cohesively and in overlapping fashion, the same reference numerals denoting identical parts.
[0112]
[0113] In a first step 16, a rank array is generated, e.g. by the scheduler, considering the expectation functions 14. This rank array expresses the internal demands, i. e. the wants and demands of the machines.
[0114] In a second step 18, a scheduler generates a schedule using internal and external information. To verify the schedule a simulation is performed to ensure that the external demands can be fulfilled, at least a portion or rate, e.g. 80% of the demand, can be satisfied.
[0115] In a third step 20, a realization unit sends out requests to the machines based on the schedule. The machines receiving a request can follow this request or not. Therefore, the machines can switch on or switch off, e.g. on a minute-by-minute basis.
[0116] In a fourth step 22, the realization unit monitors the smart grid and the machines to record switching on and switching off performed by the machines. Thus, it is possible to generate a actual schedule which can be compared with the schedule generated in step 20 obtaining a deviation 24. The result can be compared 26 with the expectation values 14. Furthermore, it is possible to predict this A 24 by considering the expectation functions.
[0117] Finally, step 22 helps to generate and update historical data 28 which can be used in steps 16 and/or 18.
[0118] The steps above are merely numbered for illustration purposes. However, the method proposed can start at any point on the circle. As an adaptive method, the method can start at step 18 for example using default values for the rank array for generating the schedule.
[0119]
[0120]
[0121]
[0122]
[0123] A graph 130 shows the time dependent course 132 of the expectation value illustrating an expectation function. Values can be between 1 and +1, for example.
[0124]
[0125]
[0126] In a first step 180, a number of patterns is generated. Each pattern is an operating schedule for operating the smart grid for the considered time period divided in time steps. Each pattern can be a realistic operating schedule considering runtime requirements of the machines provided by the agents, for example.
[0127] In a second step, the patterns are evaluated successively until there is a pattern fulfilling the demands. This pattern is selected in a final step 184 and forms the basis for a schedule comprising the requests sent to the machines.
[0128] During simulation, it is to be evaluated whether the demands for energy consumption and/or energy production can be fulfilled. The demands and a demand template, respectively, can be determined with help of historical operating schedules and current information. The simulation using the rank array checks the ability of fulfilling the demands.
[0129] Furthermore, the reliability of the machines can be considered. This reliability can already be considered in the prognosticated expectation functions. Moreover, the reliability, i. e. the probability that the machine will follow, can be considered by examining the behavior of the machine in former time periods and/or in comparing historical prognosticated expectation functions with historical expectation functions. Additionally, external circumstances can be considered.
[0130]
[0131] In a next step 230, the patterns generated in step 220 are evaluated considering external demands 232 like demands relating to the energy to be provided or consumed. A possible external demand could be provide as much energy as possible. Furthermore, historical data 234 is considered. Historical data 234 can be related to the reliability of the machines, historical data to circumstances etc. The patterns are evaluated in consideration of the information provided.
[0132] Finally, in step 240, one pattern is selected that can be the best fitting or the first pattern to fulfill the requirements, particularly, the external demands 232. This pattern forms the basis for the schedule used or corresponds to the schedule used.
[0133]
[0134] In a next step 202, the scheduler regards the expectation values 204, 206, 208 which can be never switch on 204, it would be nice to switch on 206, and please switch on 208. Historical data can be considered. At the end the scheduler generates a rank array 210 which is used in simulation.
[0135]
[0136] The rank array 258 and second external demands 260, e.g. regarding the demands regarding energy provision and consumption, are used in a simulation 262 to select a schedule 264 comprising the requests 268 to be sent to the machines. A recorder 270 within the control structure, e.g. within the realization unit, compares the requests 268 with responses 272 and records 280 these responses and the differences between requests 268 and responses 272.
[0137]
[0138] Thus, a two-dimensional rank array comprises a data set to machines and time steps for one time period. A three-dimensional rank array comprises a number of data sets to the machines and time step for one time period. Therefore, the fuzziness of circumstances and behavior of the machines, e.g. expressed by historical data, can be considered.
[0139] In one embodiment, the scheduler sends special offers to the machines to try to influence their decisions, e.g. a special offer regarding the price for energy to be consumed or to be provided.
[0140] Furthermore, the scheduler can send a request connected with an amount of energy to be consumed or provided, i. e. the scheduler can send requests to a machine defining in time steps the amount of energy to be consumed or to be provided. Additionally, the expectation values associated with the machines can consider amounts of energy. For example, in time step n generator can have an expectation value of 0.5 for 20 kW and an expectation value of 0.3 for 40 kW. That means that in time step n the generator would prefer to provide 20 kW instead of 40 kW.
[0141] The arrangement for operating a smart grid and the method for operating the smart grid described herein propose a new approach to consider the wants of the members in this smart grid and to fulfill the demands. The arrangements provides a schedule comprising requests sent to the machines. However, these requests are subdominant. The machines are not committed to the requests, rather the machines can switch and provide or consume energy according to their wants.
[0142] As the willingness for providing or consuming energy by the machines is calculated in advance and communicated to the arrangement with help of expectation values, the chance for a working schedule is high. In case one or more of the machines do not follow, a Fill routine helps to compensate this. In case of extensive changes in external circumstances and/or demands, the Reschedule routine helps to generate a new schedule suitable for the new situation.
[0143]
[0144] The expectation value for the shown floor conveyor 402 could be a probability of 0.7 to turn left and of 0.1 to turn right at time point t.sub.1. Expectation values represent the likelihood of a special behavior of a machine, here the floor conveyor 402, at a defined time point in the future.
[0145] The control structure 404 simulates operation of a technical installation, here the factory floor, comprising a number of machines, here the floor conveyors 402, and calculates behaviors or action of the machines to achieve a wanted result or, e.g. at least 80% of a wanted result. The wanted actions of the machines are translated in requests 410 sent to the floor conveyors 402. Each floor conveyor 402 can independently decide to follow this request or not and usually sends back a signal representing its will to the control structure 404. The control structure 404 evaluates the responses of the floor conveyors 402 and decides, usually on basis of a simulation, whether it is necessary to send new requests to the floor conveyors 402.