Classifications

• • G—PHYSICS
  • G05—CONTROLLING; REGULATING
  • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
  • G05B19/00—Programme-control systems
  • G05B19/02—Programme-control systems electric
  • G05B19/04—Programme control other than numerical control, i.e. in sequence controllers or logic controllers
  • G05B19/042—Programme control other than numerical control, i.e. in sequence controllers or logic controllers using digital processors
  • G05B19/0426—Programming the control sequence
• • G—PHYSICS
  • G05—CONTROLLING; REGULATING
  • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
  • G05B19/00—Programme-control systems
  • G05B19/02—Programme-control systems electric
  • G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
  • G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
• • G—PHYSICS
  • G05—CONTROLLING; REGULATING
  • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
  • G05B2219/00—Program-control systems
  • G05B2219/20—Pc systems
  • G05B2219/25—Pc structure of the system
  • G05B2219/25387—Control sequences so as to optimize energy use by controlled machine
• • G—PHYSICS
  • G05—CONTROLLING; REGULATING
  • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
  • G05B2219/00—Program-control systems
  • G05B2219/30—Nc systems
  • G05B2219/32—Operator till task planning
  • G05B2219/32015—Optimize, process management, optimize production line
• • G—PHYSICS
  • G05—CONTROLLING; REGULATING
  • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
  • G05B2219/00—Program-control systems
  • G05B2219/30—Nc systems
  • G05B2219/32—Operator till task planning
  • G05B2219/32254—Work sequence, alternative sequence
• • G—PHYSICS
  • G05—CONTROLLING; REGULATING
  • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
  • G05B2219/00—Program-control systems
  • G05B2219/30—Nc systems
  • G05B2219/32—Operator till task planning
  • G05B2219/32291—Task sequence optimization
• • Y—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
  • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
  • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
  • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
  • Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Definitions

• the invention relates to a method and a device for determining a second switching sequence for a technical system.
• Production systems are understood as systems with a hierarchical structure ( "system to subsystem relations").
• a resource-centric (eg energy centered) Evaluation and optimization of an automated production system requires a state-based modeling of, for example, automation ⁇ s mecanicssystemen including subsystems or automation components which distinguish energy expenditure in various subsystems or production states.
• each automation component between different Be ⁇ operating modes is switchable.
• be time-based or newspaper tattributATOR machines also known as "timed automata" Marked ⁇ net
• the object of the invention is to improve the model-based optimization for the calculation of an energy-optimal switching strategy, in particular taking temporal and resource-specific (eg energetic) aspects into account.
• a method for determining a second switching sequence for a technical system wherein the technical system comprises a plurality of subsystems and each subsystem has at least one first switching sequence, wherein the first switching sequence corresponds to a sequence of possible switching states in the subsystem.
• a first quantity is provided per subsystem, wherein the first quantity comprises the at least one first switching sequence per subsystem.
• the second switching sequence is determined based on the first sets for the multiple subsystems and based on dependencies between the subsystems.
• the proposed method advantageously enables a fast and efficient determination of switching strategies for modular and complex technical systems, such as production systems.
• the proposed ⁇ ne method allows the determination of an improved, such as energy-reduced performance for non-production phases, such as breaks.
• the proposed method aims to determine possible (eg energetically meaningful) switching strategies for subsystems of a technical system, whereby a switching sequence is identified for each subsystem and the identified switching sequences are purposefully adapted in the course of the method taking into account dependencies on switching strategies. be combined, which each allow an energetic Radiover ⁇ hold the system near an optimum operating.
• the second switching sequence each has a first switching sequence from each first set for each subsystem.
• the second Druckse acid sequence is determined based on the first volume and based on the constraints by a plurality is determined by the second sets, each second set each having a first switching sequence per subsystem in each first amount per subsystem having.
• a first evaluation is performed, wherein for the second quantities taking into account the first evaluation, based on dependencies, a second assessment is carried out and in which the ⁇ atom first switching sequences of the second set are determined as a second switching sequence, the second evaluation, a met predetermined criterion.
• the switching sequences of the second set are taken into account in a predetermined order and that those preferably first who have already provided an advantageous result for the ers ⁇ te review.
• the switching sequences of the second set can be taken into account in a sequence which descends with regard to the quality of the first evaluation.
• the predetermined criterion comprises at least one of the following parameters:
• a quality may reflect whether the result of a valuation in terms of the parameter is better or worse compared to a comparison value.
• a comparison value may be the result of another evaluation or the result of a valuation at a previous time.
• At least part of the steps of the method is carried out iteratively until an abort condition is fulfilled when the second evaluation for the second quantities is carried out.
• the method comprises the steps:
• step (C) in which is branched depending on a result of the comparison to step (a) or the last determined first switching sequences of the second set are determined as a second switching sequence.
• the first evaluation is based on at least one of the following parameters:
• An alternative embodiment is that a comparison is carried out as from ⁇ failure criterion between the first rating and the second rating of the second
• a next embodiment is that the termination condition is satisfied when the first rating has a lower quality than the second rating.
• a subsystem can be switched between several operating modes in terms of time and / or cost.
• Zeitattribu- advantage means that switching between two modes can be described zeitab ⁇ pending.
• the lingering in a mode may be described by a period of time. Lingering in one mode is associated with a particular power consumption. This can be expressed by respective Maschinenattribu ⁇ te to a mode.
• An additional embodiment is that the determination of the second switching sequence for the technical system takes place model-based.
• the proposed method for the optimization of automatic ⁇ overbased production systems may include in particular a Modellie ⁇ tion in the form of a time-consuming and pondereattribut striving machine model and / or based on them analysis or optimization ⁇ tion in the form of an optimization problem with constraints to generate switching strategies.
• the optimization does not have to lead to the optimum.
• Decisive are the steps of an optimization to find an improved result, in which a feasible switching strategy with sufficiently good quality is determined.
• Another embodiment is that, when carrying out the second evaluation, the first switching sequences of the second set are converted into an optimization problem with secondary conditions.
• the above object is also achieved by a device for determining a second switching sequence for a technical system
• the technical system has several subsystems,
• each subsystem having at least one first switching sequence, the first switching sequence corresponding to a sequence of possible switching states in the subsystem,
• ⁇ in the first set comprises the at least one first switching sequence per subsystem
• That the second switching sequence is determined based on the first sets for the plurality of subsystems and based on Dependen ⁇ ties between the subsystems.
• 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, eg of any memory, comprising computer-executable instructions (eg in the form of program code) suitable for the computer to perform steps of the method described herein.
• the processing unit mentioned here can be embodied, in particular, as a processor unit and / or an at least partially hard-wired or logical circuit arrangement which is set up, for example, such that the method can be carried out as described herein.
• Said processing unit can be or comprise any type of processor or computer or computer with correspondingly necessary peripherals (input, input / output interfaces, input / output devices, etc.).
• the above explanations regarding the method apply to the device accordingly.
• the device may be implemented in one component or distributed in several components.
• FIG.l an exemplary schematic representation of a production or process system
• FIG. 2 shows an exemplary illustration of resulting switching sequences for a subsystem as a result of a reachability analysis
• FIG. 4 shows, in a model-specific representation, a partial section of switching sequences for a production system taking into account restrictions or dependencies between subsystems;
• 5 is a flow chart of an iterative determination of a
• FIG. 7 shows an exemplary result progression alternative to FIG.
• a technical system Sys is understood as an example of an entirety of industrial production units, in particular with different automation tasks, including their control.
• the technical system can Sys several subsystems (also be characterized as ⁇ subsystems) include.
• the technical system Sys shown in FIG. 1 comprises five subsystems Subl bis Represents 5, wherein each of the subsystems Subl to 5, for example, a manufacturing cell, a transport module only or a Bear ⁇ beitungsstation.
• An energetic Radioverhal ⁇ th and a temporal behavior of the switching subsystems Subl up to Sub5 is PTA-formalization (PTA "Priced Timed Automata", a machine with time attributes and Kostenattribu ⁇ th)).
• Each subsystem Subl to Sub5 is assigned a first set of first switching sequences.
• the subsystem Subl for example, a first set ME1 of three first switching sequences Sl, S2, assigned to S3, via which the subsystem Sub each of an initial or initial operating mode in a target operating mode is convertible.
• the subsystem Sub2 has a first switching sequence S4 in ⁇ way of example as the first amount ME2.
• Subsystem Sub3 comprises first switching sequences S5 and S6 as first set ME3.
• the subsystem Sub4 is assigned a first switching sequence S7 as the first set ME4.
• the subsystem Sub5 has four possible first ones as the first set ME5
• a switching strategy (also referred to as “strategy”) is a set of first switching sequences Sl to Sil (combination of switching sequences or switching sequence combination of the individual subsystems Subl to Sub5 with one switching sequence per subsystem) referred to, which for the system Sys (subsystem comprehensive) feasible
• a first switching sequence S1 to Sil per subsystem Subl to Sub5 is assigned to a switching strategy.
• a combination of first switching sequences Sl to Sil as a solution for the system Sys without consideration of dependencies between the individual subsystems Subl to Sub5 is hereinafter also referred to as a "second amount of first Druckse ⁇ sequences" or referred to as “unconnected shift strategy” or "non ⁇ Thematic switching sequences".
• a second amount of first Druckse ⁇ sequences or referred to as "unconnected shift strategy” or "non ⁇ Thematic switching sequences”.
• Fig.l example two (of a variety mögli ⁇ cher) unconnected switching strategies are shown.
• an unconnected switching strategy identified by a border 110 is assigned the following first switching sequences
• FIG. 1 Another disconnected switching strategy shown in FIG. 1 and identified by a border 120 is assigned to the first switching sequences listed below (the assignment is indicated by dashed arrow lines and bordering of the first switching sequences S3, S4, S5 respectively assigned from each subsystem Subl to Sub5).
• S7, S10 illustrates):
• the first switching sequence S10 of the subsystem Sub5 the first switching sequences Sl to Sil can at least in part ⁇ , dependencies between the subsystems Subl to Sub5 (illustrated in Fig.l by horizontal connecting lines between the first switching sequences S3, S4, S5, S7, S10, and by a Reference symbol const), which are taken into account in the calculation of valid switching strategies for the system Sys.
• a combination of first switching sequences S 1 to S 1 as the solution that can be carried out for the system Sys in consideration of dependencies between the subsystems Subl to Sub 5 will also be referred to below as feasible "connected switching strategy" or "connected switching sequences". For a system Sys, several connected switching strategies can exist or be determined.
• a Viable associated shift strategy represents wel ⁇ che is illustrated in Fig.l by a rectangle 130 for
• an associated switching strategy is determined as the optimum or optimized or improved solution for the system Sys with regard to, for example, the resource or energy requirement
• the respectively assigned first switching sequences are also described as "second switching sequence for the (technical) System "sys be ⁇ draws.
• the proposed solution may use at least one of the following steps:
• Switching sequences for each subsystem Subl to Sub5 are the time information (incrementing of clocks or timers,
• DBM Difference Bound Matrices
• the DBM data representation allows a compact representation of the temporal switching behavior of the subsystems Subl to Sub5.
• a minimum time required may be determined in order to switch one of the subsystems Subl to Sub5 in a predetermined target operating mode.
• the result of the reachability analysis provides the principle (in time) possible first switching sequences Sl to Sil for the individual subsystems Subl to Sub5 ( “first amounts comprising at least a first switching sequence"), wel ⁇ che-optimized the basis for the determination of an improved, or op- Operating behavior of the system Sys form.
• first switching sequences are determined S8 to Sil in which for the example illustrated in Fig.l subsystem Sub5, or the switching of the Sub5 subsystem of an operating mode "1" M Su! 5 again in this operating mode M! Su 5 lasting for 500 time units time interval ermögli ⁇ chen.
• the first switching sequence S8 in this case has a sequence identification sequence id equal to 5 at.
• the first Switching sequence S10 assigned a sequence identification sequence id equal to 1
• the first switching sequence Sil a sequence identification sequence id equal to 4.
• M p Location with a particular operating mode is designated M p, wherein according to Figure 2, the subsystem Sub5 between five operation modes ⁇ 1 to 5 (in the following also with M! Su 5 to M 5 5 denotes Su) is switchable.
• the successive operating modes M p Su 5 to be achieved are to be classified as an ordered sequence. hen.
• the sequence of the respective operating modes M p Su 5 is composed as follows for the first switching sequence S8:
• the first switching sequence S8 starts with an operating mode 1 or M ! Su 5 , then at the time (minTime) 0 Be ⁇ operating mode 4 or M 4 Su 5 is reached.
• an operating mode 5 or M 5 Su 5 and at time (minTime) 58 an operating mode 2 or M 2 Su 5 and then an operating mode 3 or M 3 Su 5 is reached at the time (minTime) 0.
• the first switching sequence S8 ends finally the (earliest) time (MinTime) 78 with the renewed reaching Be ⁇ operating mode 1 or M! Su 5 .
• the first switching sequences S1 to S1 determined in the context of the reachability analysis are transformed in a next step into one or more optimization problems with constraints ("constraint optimization problem", also referred to as "COP").
• constraints optimization problem also referred to as "COP”
• COP soft ⁇ ware based optimization tools
• Interval variables V p Sl form a time duration of the operating mode M p S i of a subsystem Si and represent the decision variables of the COP.
• An existing expiration period D (also referred to as dead-line, possibly according to a time interval, for example an escape interval) is used, a RescueZeitdau he ⁇ hi a first switching sequence SI to Sil (sum of the lengths of the interval variables V p S a first switching sequence SI to Sil of a subsystem S ⁇ ) restrict.
• a sum of the lengths of the Intervallva ⁇ ables V p Sl of a first switching sequence SI are to Sil within the expiry period D, which can also be expressed as ⁇ Inter vallinate:
• a sequence or sequence of operating modes M p s i must be observed, which is also formulated as a restriction.
• subsequent restriction for example defi ⁇ ned that the interval variable V p S i a first Switching sequence Sl to Sil does not intersect with a subsequent interval variable V p + 1 S i of the same first switching sequence Sl to Sil of a subsystem Si: end (V p j ) start (V s ' t )
• Switching sequence Sl to Sil of a subsystem S ⁇ formulated a target ⁇ function whose function value is to be optimized.
• the objective function listed below, for example, defines that the product sum should come from a respective one
• steps (1) to (5) transformation of the PTA model into an optimization problem with constraints (COP) for each first switching sequence Sl to Sil of a sub ⁇ system Si a possible resource or energy needs (such as a minimal or minimum possible resources and energy requirements) are derived.
• COP optimization problem with constraints
• subsystems Subl to Sub5 are respectively assigned first quantities ME1 to ME5 of first switching sequences S1 to Sil.
• the first set ME1 of the first subsystem at Subl ⁇ way of example, the first switch Sl sequences assigned to S3.
• the first set ME2 of the second subsystem Sub2 is / are the first switching sequence S4, the first set ME3 of the third subsystem Sub3 the first switching sequences S5, S6, the first set ME4 of the fourth subsystem Sub4 the first switching sequence S7 and the first set ME5 of the fifth subsystem Sub5 assigned the first switching sequences S8 to Sil.
• Switching sequences Sl to Sil are combined without consideration of dependencies between the subsystems Subl to Sub5, for example all feasible or possible combinations of first switching sequences S1 to Sil to second sets of first switching sequences or to unconnected switching strategies US1 to US8.
• Each unconnected switching strategy US1 to US8 each comprises a first switching sequence Sl to Sil per subsystem Subl to Sub5 from each of the first set ⁇ ME1 to ME5 per subsystem Subl to Sub5.
• Three of the eight feasible unconnected switching strategies US1, US2 and US8 are shown in detail in FIG.
• the unconnected switching strategy US1 follow ⁇ assigned to the first switching sequences:
• the unconnected switching strategy US2 is assigned the following first switching sequences:
• a first evaluation for example, aggregated
• Resource or energy demand in particular a minimum possible resource or energy demand e (USL) to e (US8) are determined.
• the unverbun ⁇ which switching strategies US1 to US8 depending on the je ⁇ Weil certain minimum energy requirements e (USL) to e (US8) (eg ascending or according to a quality criterion) to be sorted.
• each disconnected switching strategy US1 to US8 a feasible connected switching strategy VS1 to VS8 exists and is determined accordingly.
• each A Viable associated shift strategy can be determined in ande ⁇ ren not shown scenarios for only part of the un- associated switching strategies US1 to US8.
• the derivation or determination of the connected switching strategies VS1 to VS8 from the unconnected switching strategies US1 to US8 and the determination of a combination of switching sequences SQ (also referred to as second switching sequence for the system Sys) based on the connected switching strategies VS1 to VS8 as for the system Sys optimized, eg close to an optimum or the optimum corresponding (eg energy-optimized) solution is described below.
• the possible combinations of the first switching sequences S 1 to S 1, taking into account the dependencies between the subsystems Subl to Sub 5, are limited to the effect that no combination of first switching sequences or unconnected switching strategies US 1 to US 8 is included in the set of interconnections. which switching strategies VS1 to VS8 can be adopted, which contradict dependencies (also called constraints).
• the subsystem Subi to be located only in the Radiomo ⁇ dus 3 when the subsystem Sub3 is in the operating mode. 6
• Subl, Sub3) must not be in an operating mode if there is a specific operating mode in another Subsystem Subl, Sub3.
• Subsystem subl should not be in operating mode 2 if Subsystem Sub3 is in operating mode 2.
• FIG. 4 shows a partial section of the first switching sequences S1, S2, S5, S6.
• FIG. 4 shows in the left part the two subsystems Subl and Sub3, wherein for the subsystem Subl a transition from an operating mode M ! Su l in an operating mode M 2 Su l and for the subsystem Sub3 a transition from an operating mode M ! Su 3 is shown in an operating mode M 2 Su 3 .
• the variable sv Su 3 represents a common Variab ⁇ le ("shared variable") according to PTA formalization, wherein the term sv Su 3 ⁇ M 2 Su 3 defines the restriction that a transition of the subsystem Subl of the operating mode M ! Su l after M 2 Su l may take place only if the Subsystem Sub3 is not in the operating mode M 2 Su 3 .
• Switching strategy consists of a combination of switching sequences and in turn each switching sequence of a finite number of interval variables (each with a finite, integer range of values) is constructed, it can be seen that an efficient generation of a high-quality switching strategy opposite to finding a global Op ⁇ is timums.
• FIG. 5 shows in the form of a flowchart an exemplary course of the proposed iterative method (or iterative solution calculation) for a search for an improved switching strategy for the system Sys.
• Basie ⁇ rend displayed on the system shown in Fig.l Sys and starting from the position shown in Figure 3 is in Chart 6 shows a korres ⁇ pondierender result course of the iterative calculation solution in the form of a diagram.
• first all unconnected switching strategies that can be carried out for the system Sys are determined, including the respective (minimum or minimum possible) energy requirement.
• the respective (minimum or minimum possible) energy requirement As already explained for Figure 3, for example, eight ⁇ the unconnected switching strategies US1 to US8 for the illustrated in Fig.l system SYS together with the particular under the first review each minimum energy requirement e (USL) to e (US8) determined.
• the unverbun ⁇ which switching strategies US1 to US8 are plotted in Figure 6 over the X axis.
• the respective minimum energy requirement (in [kJ]) e (USl) to e (US8) is shown with respect to the Y-axis.
• the unconnected switching strategies US1 to US8 are plotted with increasing minimum energy requirement e (USl) to e (US8) sorted over the X-axis.
• E (SQ) preset in the step 400 a solution of te ⁇ rative solution calculation representing shift strategy and second switching sequence SQ with initial values "ZERO" and a power requirement of the solution SQ with the initial value "infinity” Furthermore:
• image for the iterative Solution calculation can optionally be set a termination time (also referred to as "Computungsab ⁇ term"), to reach the search for a better (optimized) switching strategy or solution for the system Sys is performed. Upon reaching or exceeding the termination time (step 410), the search for a possibly better solution is aborted (step 470).
• the associated shift strategy VS1 is then determined in a step 420 for the currently excluded selected unconnected switching strategy US1 taking into ⁇ account the dependencies between the subsystems Subl to Sub5 a current associated shift strategy VS1 along with a minimal or minimum possible energy requirement e (VSI) ,
• FIG. 6 shows the energy demand of the connected switching strategy e (VS1) on the Y-axis, wherein the existence of a connected switching strategy VS1 to VS8 is generally indicated by a filled circle.
• step 430 For the case (step 430) that no associated Wegstra ⁇ strategy VS1 to VS8 exist or can be determined (in Figure 6 is not the case), the iterative method with the next best unconnected switching strategy US2 to US8, ie with the unlinked switching strategy US2 to US8 with the next best minimum energy requirement e (US2) to e (US8) to step 410 continued.
• the energy demand of the current associated shift strategy VSI has a better quality e (VSL) as the Ener ⁇ energy requirement e (SQ) of the current solution SQ (since e "borrowed infinity" (VSL) ⁇ )
• the condition referred to above is met.
• the current associated switching ⁇ strategy VSI as the current solution or as a second Druckse acid sequence SQ as well as the minimum energy requirement e (SQ) of the current solution SQ equal to the minimum energy requirement e (VSI) of the current associated shift strategy VSI set (illustrated in Figure 6 by a dashed line e (SQ)):
• step 450 is skipped and the iterative method is continued with a step 460.
• the minimum energy requirement e (USL) of the unconnected switching strategy US1 is smaller than the minimum Ener ⁇ energy requirement e (SQ) of the current solution SQ so that the iterative process with the next best unconnected switching strategy US2 continues with step 410 becomes. This is after checking a possible achievement of the
• the minimum energy requirement e (US8) of the non-bound ⁇ shift strategy US8 is higher than the minimum energy requirement e (SQ) of the current (previously best) solution SQ.
• a filled circle e.g., e (VSl)
• an unfilled circle e.g.
• Solution or second switching sequence SQ determines and set the minimum energy demand e (SQ) of the current solution SQ equal to the minimum energy demand e (VSl) of the current connected switching strategy VS1 (step 450):
• Switching strategy US1 is less than the minimum Energybe ⁇ may e (SQ) of the current solution SQ (step 460) is the iterative method with the next best unconnected
• not associated shift strategy VS2 can be found for the current disconnected switching rate ⁇ energy US2 ((by a non-filled circle e VS2) illustrated), so that the iterative process (step 430) continues by selecting the next best unconnected switching strategy US3 ,
• an existing (by a solid circle is ⁇ shows) connected shift strategy VS3 and a minimum consumption of energy e (VS3) of the associated switching strategy are determined VS3.
• step 450 the current connected switching strategy VS3 is determined as the current solution or second switching sequence SQ and the minimum energy requirement e (SQ) of the current solution SQ is set equal to the minimum energy requirement e (VS3) of the current connected switching strategy VS3 (in FIG. 7 is illustrated by a dashed line e (SQ):
• the minimum energy requirement e (US5) of the current disconnected switching strategy US5 is compared with the minimum energy requirement e (SQ) of the current solution SQ. Since the minimum energy requirement e (US5) of the unconnected switching strategy US5 is higher than the minimum energy requirement e (SQ) of the current solution SQ, the stop criterion after step 460 is met, so that the current solution SQ and thus the connected solution
• Switching strategy VS3 together with the minimum energy demand e (SQ), ie e (VS3), as the best possible solution ("second switching ⁇ sequence for the system") output and the iterative solution calculation is stopped (step 470)
• Sil to the output associated shift strategy VS3 represent a viable strategy for the system Sys switching with suffi ⁇ accordingly good quality (not necessarily with the best quality) which can be determined in the context of the proposed method in a fast and efficient manner.
• the method described above has for the use ⁇ area of the switching strategies for technical systems, in particular for the switching of systems in low-energy operating modes during breaks in production, several advantageous features listed below.
• the described iterative solution calculation can be ⁇ be true that energy savings associated with the jewei ⁇ time switching operations and switching sequences.
• it can be calculated by means of a model which switching sequences are energetically meaningful and which are not. This preferably has a direct influence on the operation of a production system.
• it is possible to determine, for example, before execution of switching sequences or switching strategies, which This energy saving potential is associated with it.
• an energetic assessment of the production system can be performed at the time the system is built, providing valuable clues to optimal performance and switching behavior for production breaks.
• Calculation of switching instructions for performing / execution of switching strategies In addition to the calculation of the respective aggregate energy demand of a shift sequence or shift strategy also de ⁇ ren specific design is determined. For example, it can be determined when (temporal aspect) a subsystem must be switched in which operating mode. This can also serve as an instruction for an "execution component" (automated or manual), by means of which, based on the calculated switching strategies, the subsystems are put into the corresponding operating modes or switched. Safe (automated) moving or switching the system into different operating modes:
• the switching strategies - as a result of the proposed optimization procedure - contain all temporal, process-related and hardware-specific properties of the subsystems. Based on this, a secure (eg error-free) switching of the individual subsystems from one operating mode to a next operating mode is ensured.
• These strategies can Kunststoffstra ⁇ according automated (for example, software-based) are carried out, or even by a human operator are brought (in the form of written switching instructions) for execution.
• the iterative improvement uses reference values for

Landscapes

• Engineering & Computer Science (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Automation & Control Theory (AREA)
• General Engineering & Computer Science (AREA)
• Manufacturing & Machinery (AREA)
• Quality & Reliability (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Applications Claiming Priority (4)

Publications (1)

Family

ID=48856598

Family Applications (1)

Country Status (1)

Cited By (2)

Citations (4)

• 2013
  • 2013-07-16 WO PCT/EP2013/065014 patent/WO2014040776A1/fr not_active Ceased

Patent Citations (4)

Non-Patent Citations (2)

Similar Documents

Legal Events