EP1190363A2 - Procede et dispositif pour la conception d'un systeme technique - Google Patents

Procede et dispositif pour la conception d'un systeme technique

Info

Publication number
EP1190363A2
EP1190363A2 EP99963273A EP99963273A EP1190363A2 EP 1190363 A2 EP1190363 A2 EP 1190363A2 EP 99963273 A EP99963273 A EP 99963273A EP 99963273 A EP99963273 A EP 99963273A EP 1190363 A2 EP1190363 A2 EP 1190363A2
Authority
EP
European Patent Office
Prior art keywords
parameter vector
technical system
determined
search direction
parameters
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP99963273A
Other languages
German (de)
English (en)
Inventor
Astrid Frankl
Stefan SCHÄFFLER
Reinhart Schultz
Klaus Weinzierl
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Siemens Corp
Original Assignee
Siemens AG
Siemens Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG, Siemens Corp filed Critical Siemens AG
Publication of EP1190363A2 publication Critical patent/EP1190363A2/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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
    • G05B13/00—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion
    • G05B13/02—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric
    • G05B13/0205—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric not using a model or a simulator of the controlled system
    • G05B13/024—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric not using a model or a simulator of the controlled system in which a parameter or coefficient is automatically adjusted to optimise the performance

Definitions

  • the invention relates to a method and an arrangement for designing a technical system.
  • a convex combination of the target variables is the sum of all target variables, each multiplied by a factor, whereby each factor is greater than or equal to zero and the sum of all factors is one.
  • three target variables zl, z2 and z3 are given, the associated factors are ⁇ l, ⁇ 2 and ⁇ 3.
  • the Konvexkombina 'tion KK is thus given as
  • the object of the invention is to provide a method and an arrangement for designing a technical system, parameters of the system being determined which are optimal with regard to a plurality of predetermined target functions. All target functions are included according to the partial vector order.
  • the technical system comprises several k target functions
  • the objective functions should be maximized. If one of the objective functions is to be minimized, it is converted into an objective function to be maximized by multiplication by "-1".
  • the statements made here can be applied to both cases, maximization and minimization, in any composition.
  • a search direction z is determined for the parameter vector x in such a way that the target functions, in particular all target functions, are improved by a step along the search direction.
  • a parameter vector that lies on a path determined by the search direction is used for the design of the technical system.
  • the gradients of the (in particular all) target functions are calculated for the parameter vector x and the search direction is determined by the following relationship:
  • Another development consists in that convex combinations of the gradients are determined, the convex combination which has the smallest distance from the zero point being determined.
  • ⁇ is a step size and j is an iteration step.
  • the next parameter vector is set equal to the parameter vector x and branched to the step in which the gradients of the target functions . be determined. This ensures that, along a path that comprises several parameter vectors in accordance with the iterations of the method, the next parameter vector in each case from iteration step to iteration step has a qualitatively improved design (a higher quality) than its predecessor technical system, especially with regard to all target sizes.
  • the step size ⁇ can be adjusted depending on the iteration step. For example, it is possible to shorten the step size every m steps, in particular to halve it (bisection).
  • the quality for the design of the technical system is evaluated depending on each target function.
  • Each value assignment of the parameters (referred to as the value of the parameter vector x) gives a value for the quality for each target function.
  • the objective functions can be understood as competing with one another.
  • a high quality of one objective function usually corresponds to a low quality at least one other objective function.
  • target functions, especially competing target functions are:
  • a minimization or a maximization can take place differently, depending on the respective objective function: In the example, the system efficiency has to be maximized and the investment costs have to be minimized. A gradient of the objective function shows in which direction an improvement (maximization or minimization) occurs.
  • values for the parameter vector are determined, which are each efficient.
  • An efficient value assignment of the parameter vector means that no parameter of the Parameter vector can be changed without there being a deterioration in the quality of at least one target function. Such a value of the parameter vector is called an efficient point or a pareto-optimal point.
  • a technical system can be a process engineering system or another system that has to be designed or adjusted with regard to different parameters.
  • the parameters of the parameter vector x can be design parameters or operating parameters of the technical system. Operating parameters characterize possible adjustable quantities, while design parameters describe in particular physical dimensions of the technical system and can usually only be adapted or changed with great effort during operation.
  • the termination condition can be that a predetermined number of iterations has been carried out. In this case it is ensured that the method terminates after a certain time and that the parameter vector last determined represents a suitable approximation for the efficient point sought.
  • a particularly preferred termination condition is the state in which no new search direction can be found, which would improve the target function. This is preferably the case when the zero point is in the range of the convex combination of all gradients.
  • Another development consists in normalizing the gradients to the length of the shortest gradient.
  • a new design of the technical system or an adaptation of an existing one can be made using the parameter vector determined with the described method technical system. In both cases it is a draft (once as a regeneration and once for adaptation) in the sense of the present explanations.
  • the technical system is implemented or set on the basis of the determined parameters. It is advantageous here that the parameters in a parameter vector, which was determined by means of the invention, identify a stable operating point and that the setting of the system to this operating point ensures permanent, safe operation of the system / system.
  • the method described provides an efficient point (parameter vector) after a pass with possibly numerous iterations.
  • the determination of the search direction is overlaid with a stochastic variable.
  • several different efficient points result when the method is used repeatedly.
  • the globally efficient point is determined with a high degree of probability by the superposition with the stochastic variable.
  • Locally efficient points are overcome by the random size, by scattering the random size also examining the surroundings of this supposedly efficient point for further improvement. This leads to a high degree of certainty that there is a further possibility for improvement in the vicinity of a locally efficient point, along which the path to the globally efficient point is pursued.
  • the stochastic superimposition makes it possible to determine several different efficient points which lie along a line in the n-space (n: dimension of the parameter space) and thus at sufficiently repeated repetition of the procedure, this line clearly marked with efficient points.
  • ⁇ denotes a constant that can be specified for scaling and Bt denotes a random number.
  • an arrangement for designing a technical system which has a plurality of predefined target functions, each target function being influenced by a predefined set of n parameters and a value assignment of the n parameters being combined in a parameter vector x.
  • the arrangement comprises a processor unit which is set up in such a way that
  • a) for the parameter vector x gradients of all target functions can be determined; b) a search direction can be determined such that the target functions are improved by a step along the search direction;
  • a parameter vector which lies on a path along the search direction and improves values of all target variables, can be used for the design of the technical system.
  • Fig.l a sequence of a method for designing a technical system
  • FIG. 3 shows a processor unit
  • Fig.l is a block diagram showing steps of a method for designing a technical system.
  • the technical system can be described by two or more target functions, each of which depends on a predetermined set n parameters, which parameters are combined in a parameter vector x.
  • a value assignment of the parameters is referred to as the value of the parameter vector x.
  • This value of the parameter vector x represents a possible assignment of the parameters ⁇ ⁇ , K2, ..., x n
  • the parameters are preferably
  • a start value for the parameter vector X ⁇ is specified.
  • the gradients of the target functions for the parameter vector XJ_ are determined.
  • a convex combination of the gradients is determined on the basis of the directions specified by the gradients. An area described by this convex combination comprises several points
  • step 104 (Parameter vectors) from which the point is determined which is the smallest distance from the zero point.
  • a vector through the zero point and the determined point indicates a direction (cf. step 104) along which a predetermined step width is traversed and the next parameter vector x_i + ⁇ is thereby determined (cf. step 105).
  • step 106 it is checked whether an abort condition is fulfilled. The termination condition is preferably met if a predetermined number of iteration steps have been carried out. Then the method is ended in a step 107, otherwise in a step 108 the next parameter vector Xi + 1 is set equal to the parameter vector X ⁇ and a branch is made to step 102.
  • the convex combination of the gradients overlaid with a stochastic variable is determined in step 103 and thus it is ensured that a scaled random variable influences the direction in each iteration step.
  • a parameter vector xi + i following the parameter vector x is determined in accordance with (4) with optional consideration of the stochastic superimposition of the search direction in accordance with (5).
  • a path (with a specified step size) is traveled from the current parameter vector X ⁇ to the next parameter vector x_ + ⁇ .
  • the individual steps result in a path which leads from the starting point xo to an end point x ⁇ (as the last parameter vector of the method described above) if m iteration steps have been carried out.
  • the convex combination KK used as the search direction is determined by determining the gradients of the target functions.
  • three target functions i ⁇ , f2 and f3 are assumed.
  • the three gradients result numerically or analytically
  • Vf 2 g 2 (7).
  • the direction s along the path is determined by solving the system of (8a), (8b) and (8c), where the Direction s is determined by the zero point and that point from the area of the convex combination which has the shortest distance from the zero point.
  • the Direction s is determined by the zero point and that point from the area of the convex combination which has the shortest distance from the zero point.
  • the liquid pump depends on nine important influencing variables (parameters):
  • Suction slot start horizontal housing displacement, vertical housing displacement, housing radius, hub pitch, housing eccentricity, pressure sickle end,
  • each of the target functions i-iv depend on mostly several of the parameters a) to i).
  • the gradients of the four target functions span a subset in the nine-dimensional parameter space.
  • the search direction results using the above-mentioned method. Along the search direction follows a new value for a parameter vector, for which target function values and their gradients are to be determined.
  • Parameter vector xn is entered.
  • the determination of the search direction s is illustrated in FIG. 2 using the parameter space of small dimension.
  • the gradients gj_, ⁇ 2 and ⁇ 3 of the target functions f ⁇ _, ⁇ 2 unc ⁇ f3 are determined.
  • the gradient g ⁇ points to point 201, ⁇ 2 to point 202 and ⁇ 3 to point 203.
  • the triangular surface, determined by points 201, 202 and 203, includes all points of the convex combination.
  • the point in the area of the convex combination (that is to say in the said triangular area) that is the smallest distance from the starting point xo 205 is to be determined.
  • Point 204 fulfills this condition.
  • Point 204 is perpendicular to the connecting line of points 201 and 203. Point 204 is the next point the path to the efficient point for the underlying technical system. At point 204 the gradients of the target functions are again to be determined and a new search direction is to be determined according to the described scheme.
  • the processor unit PRZE comprises a processor CPU, a memory SPE and an input / output interface IOS, which is used in different ways via an interface IFC: an output is visible on a monitor MON and / or on a printer via a graphic interface PRT issued. An entry is made with a mouse or MAS KEYBOARD.
  • the processor unit PRZE also has a data bus BUS, which ensures the connection of a memory MEM, the processor CPU and the input / output interface IOS.
  • additional components can be connected to the data bus BUS, for example additional memory, data storage (hard disk) or scanner.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Automation & Control Theory (AREA)
  • Medical Informatics (AREA)
  • Development Economics (AREA)
  • Evolutionary Computation (AREA)
  • Game Theory and Decision Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Artificial Intelligence (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne la conception d'un système technique comprenant plusieurs fonctions cibles, consistant à déterminer une direction de recherche le long de laquelle on provoque une amélioration des valeurs des fonctions cibles. Une détermination itérative de la direction de recherche permet d'obtenir un point de travail efficace qui est utilisé pour la conception du système technique.
EP99963273A 1998-12-04 1999-12-01 Procede et dispositif pour la conception d'un systeme technique Withdrawn EP1190363A2 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19856109 1998-12-04
DE19856109 1998-12-04
PCT/DE1999/003799 WO2000034850A2 (fr) 1998-12-04 1999-12-01 Procede et dispositif pour la conception d'un systeme technique

Publications (1)

Publication Number Publication Date
EP1190363A2 true EP1190363A2 (fr) 2002-03-27

Family

ID=7890058

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99963273A Withdrawn EP1190363A2 (fr) 1998-12-04 1999-12-01 Procede et dispositif pour la conception d'un systeme technique

Country Status (2)

Country Link
EP (1) EP1190363A2 (fr)
WO (1) WO2000034850A2 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10052115A1 (de) * 2000-10-19 2002-05-02 Alstom Switzerland Ltd Verfahren zur Herstellung eines Geräts
DE10237335A1 (de) * 2002-08-14 2004-01-08 Siemens Ag Verfahren und Anordnung zum Entwurf eines technischen Systems

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0034850A2 *

Also Published As

Publication number Publication date
WO2000034850A2 (fr) 2000-06-15
WO2000034850A8 (fr) 2002-01-24

Similar Documents

Publication Publication Date Title
DE69122609T2 (de) Interpretationsverfahren für Massenspektren von mehrfachgeladenen Ionen
DE3420576C2 (de) Anordnung zum Reprojizieren von Bildern aus mehreren eindimensionalen Projektionen in der Computer-Tomographie
DE69328589T2 (de) System und Verfahren zur Darstellung von Bezier-Splines-Kurven
EP3785177B1 (fr) Procede et dispositif pour determiner une configuration de reseau d'un reseau neuronal
DE3414875C2 (de) Anordnung zum Reprojizieren von mittels Rückprojektion gewonnenen Bildern
EP3256919B1 (fr) Formation de familles d'équipements pour un système d'usinage comportant une machine-outil
DE69223979T2 (de) Fuzzy-züruckgewinnungsgerät und verfahren dafür
DE3751154T2 (de) Verfahren zur Vorbereitung eines Simulationsprogrammes.
EP1529249B1 (fr) Procede et ensemble permettant la conception d'un systeme technique
DE69733965T2 (de) Intelligentes hypersensorisches verarbeitungssystem
DE3537638C2 (de) Verfahren und Einrichtung zum Reduzieren von Geräuschartefakten
DE102020001541A1 (de) Verfahren zur Transformation erfasster Sensordaten aus einer ersten Datendomäne in eine zweite Datendomäne
DE102020111204B4 (de) Verfahren zum Betreiben eines Steuergeräts für ein Kraftfahrzeug sowie entsprechendes Steuergerät
EP1623287A1 (fr) Conception d'outils et de processus pour technique de formage
EP1154369A2 (fr) Méthode d'analyse d'image cyclique et interactive, système et programme informatiques pour mettre en oeuvre la méthode
WO2000034850A2 (fr) Procede et dispositif pour la conception d'un systeme technique
Nowak Adaptive Linienmethoden für nichtlineare parabolische Systeme in einer Raumdimension.
EP1213685B1 (fr) Procédé de tomographie par ordinateur avec balayage helicoidal
DE102020116013A1 (de) Verfahren zum Bereitstellen eines komprimierten künstlichen neuronalen Netzes mittels eines Autoencoders
DE19827238B4 (de) Verfahren zum Betrieb eines Vektorrechners
DE102022112912A1 (de) Vorrichtung und Verfahren zur rechnergestützen Optimierung einer Gebäude- und Anlageninfrastruktur
WO2000034904A2 (fr) Procede et dispositif de conception d'un systeme technique
DE202019103323U1 (de) Vorrichtung zum Erstellen eines maschinellen Lernsystems
DE102023133902A1 (de) Audiofiltersystem für ein fahrzeug
EP4506867A1 (fr) Procédé et appareil de traitement assisté par ordinateur d'un circuit quantique sur une unité de traitement quantique

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20010427

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20030701

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB