EP2104014B1 - Apparatus and method for optimizing measurement points for measuring object to be controlled - Google Patents

Apparatus and method for optimizing measurement points for measuring object to be controlled Download PDF

Info

Publication number
EP2104014B1
EP2104014B1 EP09155647A EP09155647A EP2104014B1 EP 2104014 B1 EP2104014 B1 EP 2104014B1 EP 09155647 A EP09155647 A EP 09155647A EP 09155647 A EP09155647 A EP 09155647A EP 2104014 B1 EP2104014 B1 EP 2104014B1
Authority
EP
European Patent Office
Prior art keywords
measurement points
performance data
optimization
dna
arrangement
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.)
Expired - Fee Related
Application number
EP09155647A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP2104014A1 (en
Inventor
Yuji Yasui
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.)
Honda Motor Co Ltd
Original Assignee
Honda Motor Co Ltd
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 Honda Motor Co Ltd filed Critical Honda Motor Co Ltd
Publication of EP2104014A1 publication Critical patent/EP2104014A1/en
Application granted granted Critical
Publication of EP2104014B1 publication Critical patent/EP2104014B1/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
    • F02—COMBUSTION ENGINES; HOT-GAS OR COMBUSTION-PRODUCT ENGINE PLANTS
    • F02D—CONTROLLING COMBUSTION ENGINES
    • F02D41/00—Electrical control of supply of combustible mixture or its constituents
    • F02D41/02—Circuit arrangements for generating control signals
    • F02D41/14—Introducing closed-loop corrections
    • F02D41/1401—Introducing closed-loop corrections characterised by the control or regulation method
    • F02D41/1406—Introducing closed-loop corrections characterised by the control or regulation method with use of a optimisation method, e.g. iteration
    • F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
    • F02—COMBUSTION ENGINES; HOT-GAS OR COMBUSTION-PRODUCT ENGINE PLANTS
    • F02D—CONTROLLING COMBUSTION ENGINES
    • F02D41/00—Electrical control of supply of combustible mixture or its constituents
    • F02D41/24—Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means
    • F02D41/2406—Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means using essentially read only memories
    • F02D41/2425—Particular ways of programming the data
    • F02D41/2429—Methods of calibrating or learning
    • F02D41/2432—Methods of calibration
    • F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
    • F02—COMBUSTION ENGINES; HOT-GAS OR COMBUSTION-PRODUCT ENGINE PLANTS
    • F02D—CONTROLLING COMBUSTION ENGINES
    • F02D41/00—Electrical control of supply of combustible mixture or its constituents
    • F02D41/24—Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means
    • F02D41/2406—Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means using essentially read only memories
    • F02D41/2425—Particular ways of programming the data
    • F02D41/2429—Methods of calibrating or learning
    • F02D41/2477—Methods of calibrating or learning characterised by the method used for learning
    • F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
    • F02—COMBUSTION ENGINES; HOT-GAS OR COMBUSTION-PRODUCT ENGINE PLANTS
    • F02D—CONTROLLING COMBUSTION ENGINES
    • F02D41/00—Electrical control of supply of combustible mixture or its constituents
    • F02D41/02—Circuit arrangements for generating control signals
    • F02D41/14—Introducing closed-loop corrections
    • F02D41/1401—Introducing closed-loop corrections characterised by the control or regulation method
    • F02D2041/1433—Introducing closed-loop corrections characterised by the control or regulation method using a model or simulation of the system
    • F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
    • F02—COMBUSTION ENGINES; HOT-GAS OR COMBUSTION-PRODUCT ENGINE PLANTS
    • F02D—CONTROLLING COMBUSTION ENGINES
    • F02D41/00—Electrical control of supply of combustible mixture or its constituents
    • F02D41/24—Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means
    • F02D41/2406—Electrical control of supply of combustible mixture or its constituents characterised by the use of digital means using essentially read only memories
    • F02D41/2425—Particular ways of programming the data
    • F02D41/2429—Methods of calibrating or learning
    • F02D41/2441—Methods of calibrating or learning characterised by the learning conditions

Definitions

  • the present invention relates to an apparatus and a method for optimizing measurement points for measuring an object to be controlled.
  • Performance characteristic of a certain object to be controlled is automatically measured at predetermined measurement points (a combination of control parameters).
  • the object to be controlled is an internal combustion engine (hereinafter referred to as an engine)
  • various pieces of data and tables necessary for engine control are stored in an in-vehicle controller (referred to as an ECU). To generate such data and tables, performance characteristic of the engine needs to be accurately obtained. Automatic measurement of the engine is thus performed.
  • Japanese Patent Application Laid-Open No. 2000-35379 shows a hardware configuration for automatically measuring performance characteristic of an engine.
  • this document only shows a system configuration for automatically measuring engine performance, with which human labor can be alleviated, but the number of control parameters is enormous and the number of measurement points thus becomes large. Therefore, this configuration cannot meet a recent need for measuring engine performance characteristics in a shorter period of time.
  • JP 2000-35379 discloses an apparatus according to the preamble part of claim 1 and a method according to the preamble part of claim 12.
  • variable devices such as a universal moving valve system, a direct fuel injection system capable of injecting fuel several times in one combustion cycle, and a variable geometry supercharger
  • control parameters is determined in a grid shape as shown in FIG. 1A by the use of the experimental design method, and automatic measurement is performed with the control parameters automatically held at respective set values.
  • an object to be controlled is an engine
  • the characteristic of the object to be controlled has a highly complicated curved surface with projections and depressions against control parameters as shown in FIG. 2 , and its changes are very abrupt.
  • the number of measurement points is significantly reduced by the use of the experimental design method, it becomes impossible to catch the projections and depressions characteristics and peak points of actual engine performance characteristics.
  • actual engine performance characteristic is indicated by the reference numeral 101.
  • Measurement points by the use of the experimental design method are Ua1, Ua2, and Ua3 that the control parameter A may take.
  • performance characteristic indicated by the reference numeral 103 is obtained.
  • the performance characteristic obtained by measurement does not follow the actual performance characteristic.
  • Actual projections and depressions characteristics and a peak point indicated by the reference numeral 105 cannot be obtained by the performance characteristic obtained by measurement.
  • the missed projections and depressions characteristics and the missed peak point are the optimum values of performance data that need to be captured, the measurement is useless since the engine performance cannot be maximized. Accordingly, the technique based on the experimental design method that has been used in automatic measurement devices cannot practically reduce the number of measurement points and cannot shorten measuring time. In other words, when the number of measurement points is reduced, it is likely that an optimum point cannot be picked up, and that projections and depressions characteristics cannot be picked up.
  • an apparatus that can optimize the number of measurement points so as to reduce the number of measurement points to a minimum.
  • the present invention provides an apparatus for optimizing measurement points for measuring performance data of an object to be controlled corresponding to a predetermined control parameter.
  • the apparatus has means for predicting performance characteristic of the object to be controlled corresponding to the control parameter using a model of the object to be controlled and for calculating prediction performance data (RSM_est), means for sampling the prediction performance data at set measurement points and calculating sampled performance data (RSM_nm) based on the sampled prediction performance data, and means for optimizing arrangement of the measurement points so as to minimize an error (Ersm_nm) between the prediction performance data and the sampled performance data.
  • RSM_est prediction performance data
  • RSSM_nm sampled performance data
  • arrangement of measurement points of an object to be controlled i.e. an engine, having performance characteristic showing complicated increase and decrease, corresponding to a control parameter
  • a control parameter i.e. an engine
  • more accurate performance characteristic of the object to be controlled can be obtained.
  • data and tables required for various controls to the object to be controlled are created. Control so as to maximize performance of the object to be controlled can be realized.
  • the object to be controlled is an engine, for example, performance includes emission, fuel economy, power, noise, and vibration (NV). For these parameters performance can be increased.
  • the optimization is also performed for the number of measurement points. Not only arrangement of measurement points, but also the number of measurement points, is optimized. Time to measure performance characteristic of an object to be controlled, such as an engine, having performance characteristic showing complicated increase and decrease, corresponding to a control parameter, can be shortened. More accurate performance characteristic of the object to be controlled can be obtained.
  • the actual object to be controlled is measured at the optimized measurement points to obtain actual performance characteristic of the object to be controlled. As described above, measurement is performed at the optimized measurement points and therefore more accurate performance characteristic of the actual object to be controlled can be obtained.
  • the optimization of arrangement and the number of measurement points is performed by a genetic algorithm (GA).
  • GA genetic algorithm
  • a DNA element having a meaning to reduce the number of measurement points is incorporated into a DNA individual. Therefore, the number of measurement points can be reduced more efficiently.
  • the evaluation function is weighted so as to lower evaluation of the evaluation function with increase in the number of measurement points.
  • the number of measurement points is increased, a possibility that performance characteristic of an object to be controlled can be measured with a higher accuracy becomes higher. Therefore, even if the typical genetic algorithm is performed, it is difficult to efficiently reduce the number of measurement points.
  • the present invention through the evaluation function weighting process, a probability of deriving a solution with a smaller number of measurement points can be enhanced. Thus, the number of measurement points can be efficiently reduced.
  • a DNA individual in a selecting process in the genetic algorithm, is selected in decreasing order of evaluation of the evaluation function for each number of measurement points of each of DNA individuals.
  • the optimization of arrangement of measurement points is performed by an optimization algorithm that calculates arrangement of measurement points for minimizing the error.
  • optimization algorithm for example, the steepest descent method and the least squares method are known. Using such optimization algorithm, arrangement of measurement points can be optimized.
  • the optimization of arrangement and the number of measurement points is performed by repeating a process by the use of the optimization algorithm while the number of measurement points is changed and determining arrangement and the number of measurement points in which the error is minimized after the repetition.
  • both the number of measurement points and arrangement of measurement points cannot be optimized at the same time.
  • the optimization algorithm such as the steepest descent method and the least squares method
  • both the number of measurement points and arrangement of measurement points cannot be optimized at the same time.
  • the optimization algorithm such as the steepest descent method and the least squares method
  • by repeating the process by the use of the optimization algorithm with changing the number of measurement points not only arrangement of measurement points, but also the number of measurement points, can be optimized.
  • performance characteristic of an actual object to be controlled can be obtained with a smaller number of measurement points.
  • a predetermined evaluation function is used for determining arrangement and the number of measurement points in which the error is minimum and the evaluation function is weighted so as to lower evaluation of the evaluation function with increase in the number of measurement points.
  • FIG. 4 is a block diagram of an apparatus for optimizing measurement points according to an embodiment of the present invention.
  • the apparatus can be realized by an arbitrary computer.
  • the computer has a CPU (central processing unit), a storage device (including a memory and a hard disk drive), an input device such as a keyboard and a mouse, and an output device such as a display.
  • Functional blocks shown in the drawing can be realized by executing a computer program stored in the memory by the CPU.
  • an internal combustion engine (hereinafter referred to as an engine) is an object to be controlled.
  • the object to be controlled exhibits performance characteristic according to a control parameter.
  • control parameters such as an amount of lift of an intake valve, a phase of an inlet cam, a negative pressure of an intake pipe, an air-fuel ratio, and a fuel injection amount.
  • performance characteristics such as an engine output torque and emission (an amount of HC and NOx exhausted from the engine).
  • the control parameters are an amount of lift of an intake valve and the phase of an inlet cam, an output torque according to the values of the control parameters can be obtained as performance characteristic of the engine.
  • the present invention is applicable also to other objects to be controlled.
  • a prediction performance unit 11 predicts predetermined performance characteristic of an engine corresponding to a predetermined control parameter using a predetermined engine model and generates a prediction performance model Rsm_est that shows performance data corresponding to the control parameter.
  • the engine model models an actual engine and is generated by an arbitrary appropriate technique.
  • an elementary chemical reaction model zero-dimensional
  • the elementary chemical reaction model describes a chemical reaction in the engine by a combination of a large number of elementary reactions.
  • the engine model may be a one-dimensional or three-dimensional model. An intake and exhaust flow of the engine is subjected to one-dimensional or three-dimensional analysis so as to be modeled.
  • a control parameter and performance data corresponding to the control parameter are obtained as prediction performance data.
  • the relation between both can be represented as the model.
  • This model is called a prediction performance model RSM_est.
  • RSM_est a prediction performance model
  • Such a model can be generated by an arbitrary appropriate technique.
  • performance data corresponding to the control parameter is represented by a response curved surface, which can be the prediction performance model.
  • the Kriging method, a quadratic function curved surface, or a neural network can be used for generating the response curved surface.
  • the value of the performance data corresponding to the values (combination) of control parameters is represented by one lattice point.
  • the prediction performance model can also be represented as an interpolation map having an enormous number of the lattice points.
  • FIG. 5 shows an example of a prediction performance model generated from control parameters A and B and performance data corresponding to the control parameters A and B in a predetermined engine model.
  • the actually measured performance data is used as prediction performance data.
  • the prediction performance model may be generated from the prediction performance data using the response curved surface or the like.
  • the generated prediction performance model RSM_est is stored in the storage device of the computer.
  • a designated measurement point determination unit 12 designates predetermined measurement points.
  • the measurement points designated are called designated measurement points.
  • the designated measurement points can be determined by an arbitrary criterion. In this embodiment, measurement points that are considered to be necessary or desired for controlling an engine are determined to be the designated measurement points.
  • the designated measurement points can be determined as follows:
  • the value 111 (represented by a prediction performance model) of prediction performance data corresponding to the value of the control parameter A is shown.
  • a (i) is the designated measurement point that meets the above-mentioned 1) and is a control parameter value in which the prediction performance data is maximum.
  • a (ii) is the designated measurement point that meets the above-mentioned 2) and is the designated measurement point in which the control parameter value is minimum.
  • a (iii) is the designated measurement point in which the value of the prediction performance data meets a predetermined condition (a condition to take a value X (iii)).
  • a necessary or desired measurement point can be included in optimum measurement points without being excluded.
  • An initial group determination unit 13 determines an initial group (zero-generation) in a genetic algorithm so as to include the designated measurement points as chromosomes (hereinafter referred to as a DNA element) in each DNA individual.
  • the initial group includes a predetermined number of DNA individuals.
  • An optimization unit 15 optimizes arrangement of measurement points (what control parameter values should be combined) using the genetic algorithm.
  • the optimization unit 15 optimizes, not only arrangement of measurement points, but also the number of measurement points, using the genetic algorithm.
  • a sampled performance model generation unit 21 reads a prediction performance model RSM_est from the storage device, samples the prediction performance model RSM_est at control parameter values defined by each DNA individual, and generates a sampled performance model RSM_nm from the sampled prediction performance data.
  • An evaluation unit 22 compares the prediction performance model RSM_est with the sampled performance model RSM_nm and evaluates the sampled performance model RSM_nm using an evaluation function.
  • a DNA update unit 23 performs selection, crossover, and mutation processes in the genetic algorithm so as to leave a DNA individual having higher evaluation.
  • a convergence judgment unit 24 judges whether optimization is converged based on a difference between one having the highest evaluation among DNA individuals in the current generation and one having the highest evaluation among DNA individuals in the previous generation. If it is judged that optimization is converged, control parameter values represented by the DNA individual having the highest evaluation in the current generation are determined to be optimized measurement points. Arrangement and the number of measurement points are optimized in such a way that a error between the prediction performance model RSM_est and the sampled performance model RSM_nm is minimized.
  • a measurement unit 17 automatically measures an actual engine at the optimized measurement points.
  • a known appropriate technique and apparatus can be used for measurement.
  • As known as a bench test there is known an apparatus that measures performance of an engine to be tested by installing the engine on a mounting base (bench) and operating the engine via a connected test apparatus. What test is performed can be controlled by a computer connected to the test apparatus. The computer controls the test apparatus so as to automatically obtain engine performance data at each of the optimized measurement points. The obtained performance data can be fetched in the storage device of the computer and can be displayed on an output device such as a display.
  • a prediction performance model is based on an engine model. Prediction performance data obtained from the prediction performance model imitates the behavior of projections and depressions characteristics or increase and decrease characteristics of actual engine performance. However, prediction performance data has an error in the magnitude of actual performance data. According to the present invention, arrangement and the number of measurement points suitable for the behavior of the prediction performance model are obtained. An actual engine is measured at the measurement points to obtain performance data that follows the behavior and magnitude of the actual engine.
  • the performance data of the engine actually measured at the optimum measurement points can be used, for example, for generating data and tables to be stored in an ECU. Using the data and tables, engine control is executed so as to maximize engine performance.
  • FIGS. 7 to 15 there will be a detailed algorithm according to one embodiment of the present invention, executed by the CPU of the computer, more specifically, by the initial group determination unit 13 and the optimization unit 15 of FIG. 4 .
  • step S11 a generation parameter m showing the generation of a group of DNA individuals in the genetic algorithm is initialized to zero.
  • the designated measurement point determination unit 12 determines designated measurement points of the control parameter B.
  • the control parameter A the three designated measurement points A (i) to A (iii) described with reference to FIG. 6 are used.
  • the control parameter B for example, two designated measurement points B (i) and B (ii) that satisfy the conditions 1) and 2) are used.
  • the number of designated measurement points of the control parameters A is oa.
  • the number of designated measurement points of each of the control parameters can be arbitrarily determined.
  • the number of the kinds of control parameters can be arbitrarily determined.
  • the number of DNA individuals per generation is N.
  • a maximum number of chromosomes (DNA elements) of the control parameter A is pa.
  • a maximum number of DNA elements of the control parameter B is pb.
  • pa shows a maximum number of measurement points of the control parameter A.
  • pb shows a maximum number of measurement points of the control parameter B.
  • the first figure shows the kind of a control parameter
  • the second figure shows a DNA element number
  • the third figure shows a DNA individual number
  • the fourth figure shows a generation number.
  • "A135" represents the first DNA element in the third DNA individual in the fifth generation of the control parameter A.
  • the designated measurement point is included as the fixed DNA element.
  • the designated measurement points of the control parameter A are included in the first to third DNA elements in each of the DNA individuals, and the designated measurement points of the control parameter B are included in the first and second DNA elements in each of the DNA individuals.
  • the remaining DNA elements are generated by random numbers limited within the range in which the control parameters A and B may take. N DNA individuals are generated.
  • the arbitrary DNA element is extracted by a random number.
  • the extracted element is replaced by a value (in this embodiment, "99" that is a value outside the range in which the control parameters A and B may take is used) meaning that the measurement point represented by the element is nullified (or is not used as the measurement point).
  • the DNA element to be nullified is extracted from the DNA elements other than the DNA elements having the defined designated measurement points.
  • DNA elements of A420, B420, and A5n0 are nullified.
  • the number of DNA elements to be nullified in each of the DNA individuals can be arbitrarily determined.
  • the number of DNA elements to be nullified of the control parameter A B need not be equal.
  • the respective maximum numbers of measurement points are pa and pb.
  • the respective maximum numbers of measurement points are (pa -1) and (pb - 1).
  • the respective maximum numbers of measurement points are (pa - 2) and (pb - 2).
  • the total numbers of measurement points that are not replaced in the n-th DNA individual in the m generation are represented respectively by pa_ef_ nm and pb_ef_nm.
  • step S13 a prediction performance model RSM_est stored in the storage device is read.
  • the data is used for the later-described evaluation.
  • va and vb be sufficiently large values, for example, (ten times pa and pb or more) so as to satisfy va » pa and vb » pb.
  • va and vb may be generated by a general experimental design method and random numbers.
  • step S14 an evaluation process of DNA individuals is executed.
  • the evaluation process is shown in FIG. 9 .
  • step S21 a repetition parameter i (identifying the DNA individual number n) is set to zero.
  • step S22 as described above, the total numbers pa_ef_ nm and pb_ef_nm of measurement points that are not nullified by "99" are calculated respectively.
  • a sampled performance model RSM_nm is generated based on the sampled prediction performance data Yapn_bqn_m.
  • the prediction performance model RSM_est is obtained by calculating the relation between the control parameters and performance data corresponding to the control parameters by the computer.
  • the sampled performance model RSM_nm can be generated from the control parameters Apnm and Bqnm and the performance data Yapb_bqn_m corresponding to the control parameters Apnm and Bqnm.
  • the sampled performance model RSM_nm can represent engine performance characteristic that can be realized at the measurement points represented by the current DNA individual.
  • step S25 the sampled performance model RSM_nm is sampled at the same control parameter values Av_r and Bv_s as in step S13 to obtain sampled performance data Vnm_rs.
  • the same control parameter values Av_r and Bv_s as in step S13 are used for comparing the prediction performance model RSM_est with the sampled performance model RSM_nm under the same condition.
  • Nmax pa x pb.
  • W 1, and weighting is not performed.
  • step S26 the weighting function W is calculated.
  • the weighting function W may be calculated according to the above-mentioned equation or may be determined by referring to a table of the weighting function W.
  • FIG. 11 shows an example of the table. As the number of measurement points Ns_nm is increased, the value of the weighting W becomes larger to lower evaluation.
  • the table is stored in the memory, and is referred based on Ns _nm calculated in step S22 to determine the corresponding W.
  • the evaluation function value Ersm_nm reflects an error of the sampled performance model RSM_nm relative to the prediction performance model RSM_est. As the evaluation function value Ersm_nm becomes smaller, evaluation of the DNA individual on which the sampled performance model RSM_nm is based becomes higher. It is evaluated how accurately the measurement point realized by the DNA individual can reproduce the performance data on the prediction performance model.
  • step S28 the repetition parameter i is incremented by one. Steps S22 to S28 are executed for each of the DNA individuals until the value of i exceeds N showing the number of DNA individuals in step S29. If the judgment in step S29 is No, the routine is advanced to step S15 of FIG. 7 to execute a DNA update process. The update process is shown in FIG. 12 .
  • step S31 N DNA individuals are arrayed in increasing order of evaluation function value Ersm_nm.
  • An example of the arrayed results is shown in FIG. 13 .
  • step S32 the individual with the smallest evaluation function value among the N DNA individuals is named as Ersm_best. This is used for the later-described optimization convergence judgment.
  • step S33 DNA individuals are selected in increasing order of the evaluation function value Ersm_nm for each number of measurement points.
  • the maximum value Nmax of the total number of measurement points is pa x pb, as described above.
  • the DNA elements at the designated measurement points are not nullified.
  • the numbers of the non-nullified DNA elements are oa and ob respectively.
  • a possible minimum value Nmin of the total number of measurement points is oa x ob.
  • Nsel ⁇ N
  • step S34 two of the selected Nsel DNA individuals are selected at random and a crossover position is determined by random numbers.
  • a crossover position is determined by random numbers. Referring to FIG. 14 , an example of the two selected DNA individuals and the determined crossover position is shown. In this example, the crossover position is determined between the DNA element of the control parameter A and the DNA element of the control parameter B. The present invention is not limited to such crossover position.
  • the DNA elements existing on the right side from the crossover position are exchanged to generate two new DNA individuals.
  • a predetermined number of Ncros ( ⁇ N) DNA crossover individuals are generated.
  • step S35 one of the selected the Nsel DNA individuals is selected at random and a mutation position is determined by a random number.
  • the mutation position is determined so as to exclude DNA elements at designated measurement points.
  • the value of the DNA element at the mutation position is replaced by a value determined by the random number or the value "99" showing nullification.
  • the value determined by the random number is a value within the range that the control parameters A and B may take. It is preferred to determine, using the random number, which of the value determined by the random number and the value showing nullification is adopted for replacement.
  • a predetermined number Nmut ( ⁇ N) of new DNA individuals are generated.
  • step S36 numbers 1 to N are allocated to the N DNA individuals determined by selection, crossover, and mutation again.
  • N Nsel + Ncros + Nmut.
  • Nsel, Ncros, and Nmut are determined so as to have such relation.
  • the number allocation order may be arbitrary.
  • step S37 the generation parameter m is incremented by one and the routine is advanced to step S16 of FIG. 7 .
  • step S16 an absolute value D_ersm_best of a difference between the best evaluation function value Ersm_best in the current generation calculated in step S32 and the best evaluation function value Ersm_best in the previous generation is calculated.
  • (m - 1) shows the current generation
  • (m - 2) shows the previous generation. This is because the generation parameter m is incremented by one in the update process of step S15 (S37 of FIG. 12 ).
  • the best evaluation function value Ersm_best (m - 1) in the first generation the previous generation does not exist.
  • a predetermined initial value is set to Ersm_best (m - 2).
  • D_ersm_best Ersm_best m - 1 - Ersm_best m - 2
  • step S17 if the difference D_ersm_best is equal to or less than a predetermined value D_ersm_conv, it is judged that optimization is converged and the routine is advanced to step S19. If not, the routine is advanced to step S18 to continue optimization.
  • step S18 if the number of generations m is equal to or less than the predetermined maximum number of generations Mmax, the routine is advanced to step 14 to continue optimization. If the number of generations m is more than Mmax, the routine is advanced to step S19 to complete optimization.
  • step S19 the values of the control parameters A and B defined by the DNA individual realizing the best evaluation function value Ersm_best (m - 1) in the current generation are determined to be optimum measurement points. The optimization is thus completed.
  • the reason why (m - 1) shows the current generation is that, as described above, the generation parameter m is incremented by one in the update process of step S15.
  • the optimum measurement points are measurement points that are determined so as to follow the behavior such as projections and depressions or a peak value (optimum value) of engine performance obtained from the engine model modeling the actual engine at the highest accuracy.
  • the reference numeral 131 denotes actual engine performance characteristic
  • the reference numeral 133 denotes performance data measured at measurement points A1 to A6 arranged with equal spacing by the conventional experimental design method.
  • the reference numeral 131 denotes the same actual engine performance characteristic as in FIG. 16A
  • the reference numeral 135 denotes performance data based on a prediction performance model RSM_est
  • the reference numeral 137 denotes performance data obtained by measurement at measurement points that are optimized according to the present invention.
  • the number of optimum measurement points is reduced to five by the technique of the present invention and optimum measurement points are arranged with unequal spacing.
  • the prediction performance model imitates the behavior of the projections characteristic of the actual engine. Difference is generated in the magnitude of the performance data.
  • the actual engine performance characteristic 131 and the engine performance characteristic 133 measured at the measurement points A1 to A6 are overlapped. With the six measurements points, the projections characteristic in the actual engine performance can be measured with a high accuracy at the measurement points A1 to A6.
  • the engine performance characteristic calculated based on the measurement points A1 to A6 can represent the actual engine performance characteristic with a high accuracy.
  • FIG. 16B the actual engine performance characteristic 131 and the engine performance characteristic 137 measured at the measurement points A1 to A6 are overlapped. According to the present invention, though the number of measurements points is reduced, the engine performance characteristic can be measured at the same accuracy as in FIG. 16A .
  • FIGS. 17A and 17B differ from FIGS. 16A and 16B in that engine performance characteristic shows increase and decrease relatively significantly (for example, ignition time of a gasoline engine and emission of Nox and HC).
  • FIG. 17A six measurement points are arranged with equal spacing by the conventional experimental design method.
  • the increase and decrease characteristic of performance data in a region in which the value of the control parameter A is small cannot be accurately measured.
  • the engine performance characteristic 133 determined based on the measurement points causes a large amount of departure from the actual engine performance characteristic 131 in the region in which the value of the control parameter A is small. To eliminate the error, more measurement points need to be arranged.
  • the number of measurement points is reduced from six to five.
  • the measurement points are arranged with unequal spacing at appropriate positions.
  • engine performance characteristic can be measured with a high accuracy in the region in which the value of the control parameter A is small, without causing a large error between the measured engine performance characteristic 137 and the actual engine performance characteristic 131.
  • a DNA individual need not be selected for each number of measurement points. All the DNA individuals may be arrayed in increasing order of the evaluation function value Ersm_nm. Nsel DNA individuals need to be selected from among them. In the mutation process in step S35, the replacement by the value showing nullification is not performed.
  • arrangement of measurement points suitable for the behavior of the prediction performance model can be obtained via the genetic algorithm. By measuring an actual engine at the measurement points, performance data following the behavior and magnitude of the actual engine can be obtained.
  • optimization is performed using the genetic algorithm.
  • arrangement and the number of measurement points can be optimized at the same time.
  • the genetic algorithm need not be used. The form will be described below.
  • FIG. 18 is a block diagram of an apparatus for optimizing measurement points according to another embodiment of the present invention.
  • the apparatus optimizes arrangement and the number of measurement points using an optimization algorithm different from the genetic algorithm.
  • the apparatus according to another embodiment has a configuration similar to that of FIG. 1 .
  • the same components as in FIG. 1 are indicated by similar reference numerals and the description is omitted.
  • An optimization unit 115 optimizes arrangement of measurement points using the optimization algorithm different from the genetic algorithm.
  • the optimization unit 115 optimizes, not only arrangement of measurement points, but also the number of measurement points.
  • a measurement point set initialization unit 113 sets an initial values of a set of measurement points (hereinafter referred to as a measurement point set) of each control parameter.
  • a sampled performance model generation unit 121 reads a prediction performance model RSM_est from the storage device, samples the prediction performance model RSM_est at control parameter values defined by the measurement point set that is set by the measurement point set initialization unit 113, and generates a sampled performance model RSM_nm from the sampled prediction performance data.
  • An evaluation unit 122 calculates an error between the prediction performance model RSM_est and the sampled performance model RSM_nm to evaluate the sampled performance model RSM_nm.
  • a measurement point set update unit 123 uses the optimization algorithm to execute the optimization algorithm calculating the measurement point set so as to minimize the error and then updates the measurement point set. Unlike the above-mentioned embodiment using the genetic algorithm, the number of measurement points is not changed in the update of the measurement point set.
  • the optimization algorithm the known steepest descent method, least squares method, simplex method, and Karmarkar method can be used.
  • a convergence judgment unit 124 judges whether the error is converged. If the error is not converged, a sampled performance model of the updated measurement point set is generated again to evaluate the measurement point set. If the error is converged, a number-of-measurement points update unit 125 updates the number of measurement points included in the measurement point set. The measurement point set including the updated number of measurement points is repeatedly subjected to the processing by the initial measurement point set setting unit 113, the sampled performance model generation unit 121, the evaluation unit 122, the measurement point set update unit 123, and the convergence judgment unit 124.
  • the number of measurement points included in the measurement point set reaches a predetermined value in the number-of-measurement points update unit 125.
  • An optimum measurement point selection unit 126 selects, from among the evaluated measurement point sets, the measurement point set having the smallest value of the error.
  • the values of the control parameters defined by the selected measurement point set are determined to be optimum measurement points.
  • a DNA element showing measurement point nullification is incorporated into a DNA individual to optimize arrangement and the number of measurement points at the same time.
  • optimum measurement points can be determined.
  • arrangement and the number of measurement points cannot be optimized at the same time.
  • the optimization algorithm determines arrangement of a predetermined number of measurement points so as to minimize an error.
  • FIGS. 19 and 20 there will be described a detailed algorithm according to the embodiment shown in FIG. 18 , executed by the CPU of the computer, more specifically, by the optimization unit 115 of FIG. 18 .
  • Step S111 is similar to step S13 of FIG. 7 .
  • the prediction performance model RSM_est is read from the storage device.
  • an initial value pa_s is set to ia showing the number of measurement points of the control parameter A.
  • an initial value pb_s is set to ib showing the number of measurement points of the control parameter B.
  • the initial values can be set to an arbitrary value (e.g., 3).
  • Aia_ib_n represents a set of measurement points (measurement point set) of the control parameter A
  • Bia_ib_m represents a set of measurement points (measurement point set) of the control parameter B.
  • Aia_ib_n (0) and Bia_ib_m (0) are shown in FIG. 21 .
  • step S115 the optimization algorithm is executed.
  • the optimization algorithm is shown in FIG. 20 .
  • step S121 the repetition parameter i (showing a value identifying the measurement point set) is initialized to zero.
  • Steps S122 to S126 are similar to steps S23 to S27 of FIG. 9 .
  • the total number of measurement points is ia x ib. This is represented by Ns_nm.
  • Ns_nm pieces of prediction performance data Yan_bm can be obtained.
  • a sampled performance model RSM_nm is generated based on the sampled prediction performance data Yan_bm.
  • the prediction performance model RSM_est is obtained by calculating the relation between the control parameters and performance data corresponding to the control parameters by the computer.
  • the sampled performance model RSM_nm can be generated from the control parameters Aia_ib_n and Bia_ib_m and the performance data Yan_bm corresponding to the control parameters Aia_ib_n and Bia_ib_m.
  • the sampled performance model RSM_mn can represent engine performance characteristic that can be realized at measurement points represented by the values of the control parameters A and B of the current (i-th) measurement point set.
  • step S124 the sampled performance model RSM_nm is sampled at the same control parameter values Av_r and Bv_s as in step S111 to obtain sampled performance data Vnm_rs.
  • the same control parameter values Av_r and Bv_s as in step S111 are used for comparing the prediction performance model RSM_est with the sampled performance model RSM_nm under the same condition.
  • the table of the weighting function W in FIG. 11 may be stored in the storage device to refer to the table based on Ns_nm, thereby determining the weighting function W. As the number of measurement points Ns_nm is increased, the value of the weighting W becomes larger to lower evaluation.
  • step S126 using the calculated weighting function W, the evaluation function value Ersm_nm of the sampled performance model is calculated according to the following equation.
  • the evaluation function value Ersm_nm (i) reflects an amount of departure of the sampled performance model RSM_nm determined from the values Aia_ib_n (i) and Bia_ib_m (i) of the control parameters A and B of the current measurement point set from the prediction performance model RSM_est. As the value of the error is smaller, evaluation of the measurement points Aia_ib_n (i) and Bia_ib_m (i) on which the sampled performance model Rsm_nm is based becomes higher.
  • the calculated evaluation function value Ersm_nm (i) is associated with the corresponding measurement point sets Aia_ib_n (i) and Bia_ib_m (j) and is then stored in the storage device such as memory.
  • step S127 using the predetermined optimization algorithm, Aia_ib_n (i+1) and Bia_ib_m (i+1) are calculated. These are used as Aia_ib_n (i) and Bia_ib_m (i) in the next evaluation process (that is, Aia_ib_n (i) and Bia_ib_m (i) are updated).
  • an arbitrary known algorithm that can calculate Aia_ib_n (i + 1) and Bia_ib_m (i + 1) so as to minimize the evaluation function value (error) Ersm_nm can be used.
  • the algorithms based on the steepest descent method, the least squares method, the simplex method, and the Karmarkar method can be used.
  • Aia_ib_n (i + 1) of the control parameter A is typically determined by Aia_ib-n (i) + K x Ersm_nm (i).
  • These algorithms are different in a way to calculate a coefficient K. All algorithms are the same in that the coefficient K is calculated so as to minimize the error Ersm_nm and that the coefficient K is used to calculate Aia_ib_n (i + 1). Either of the algorithms may be used.
  • the equation (1 - 1) shows an equation for calculating Aia_ib_n (i + 1) of the control parameter A.
  • the equation (1 - 2) shows an equation for calculating Bia_ib_m (i + 1) of the control parameter B.
  • KP A and KP B coincide with the coefficient K.
  • ⁇ A and ⁇ B show update gains and can be previously set.
  • KPn (i) and KPm (i) correspond to the coefficient K and are successively calculated.
  • P shows an update gain and can be previously set.
  • ⁇ shows a weighting parameter (0 ⁇ ⁇ ⁇ 1).
  • step S1208 convergence judgment is performed. More specifically, if a difference between the current error value Ersm_nm (i) and the previous error value Ersm_nm (i. - 1) is the predetermined value Drsm_conv or more, it is judged that optimization is not converged.
  • step S129 the repetition parameter i is incremented by one. Steps S122 to S128 are repeated for Aia_ib_n (i + 1) and Bia_ib_m (i + 1) calculated in step S127 (that is, the updated Aia_ib_n (i) and Bia_ib_m (i)). The repetition is performed until the repetition parameter i reaches the predetermined value N in step S130. While the number of measurement points is maintained at the predetermined number, each of the N measurement point sets is evaluated.
  • step S1208 if a difference between the current error value Ersm_nm (i) and the previous error value Ersm_nm (i - 1) is less than the predetermined value Drsm_conv, it is judged that optimization is converged and the routine is returned to step S116 of the process of FIG. 19 .
  • step S116 the number of measurement points ib of the control parameter B is incremented by one.
  • step S117 if the number of measurement points ib does not reach pb (as described above, a maximum number of measurement points of the control parameter B), initialization and optimization of the measurement point set in steps S114 and S115 are performed again while the number of measurement points of the control parameter A is maintained.
  • the number of measurement points of the control parameter B alone is incremented by one.
  • the values of the increased number of measurement points are initialized by a random number (S114) and are then optimized (S115).
  • the number of measurement points of the control parameter A remains the same so as to be initialized again (S114) and is then optimized (S115).
  • step S117 If the number of measurement points ib reaches pb in step S117, the routine is advanced to step S118 to increment the number of measurement points ia of the control parameter A by one. If the number of measurement points ia does not reach pa (as described above, a maximum number of measurement points of the control parameter A) in step S119, the process will be as below. The incremented number of measurement points ia of the control parameter A is maintained. The number of measurement points of the control parameter B is changed from the initial value pb_s to pb (S113, S116). The initialization and optimization of the measurement point set in steps S114 and S115 are performed.
  • step S120 If the number of measurement points ia reaches pa in step S119, an optimum measurement point is determined in step S120.
  • step S120 among the evaluation function values Ersm_nm (i) calculated in step S126 of FIG. 20 and stored in the storage device, Aia_ib_n (i) and Bia_ib_m (i) corresponding to the evaluation function value Ersm_nm (i) having the smallest value are determined to be optimum measurement points. The optimization is thus completed.
  • the designated measurement point determination unit 12 may be provided between the prediction performance unit 11 and the measurement point set initialization unit 113.
  • designated measurement points are determined, and the values of a measurement point set are set by the measurement point set initialization unit 113 so as to include the designated measurement points. More specifically, pa_s and pb_s in steps S112 and S113 of FIG. 19 are set to a value of the number of designated measurement points or more, and in step S114, the value of a measurement point other than the designated measurement points are initialized by a random number. For example, in FIG.
  • Aia_ib_1 to Aia_ib_3 and Bia_ib_1 to Bia_ib_2 are used as values representing designated measurement points, and Bia_ib_3 is initialized by a random number.
  • the measurement point set update unit 123 updates a measurement point set so as to include the designated measurement points. More specifically, the optimization algorithm used in step S127 of FIG. 20 need to calculate Aia_ib_n (i + 1) and Bia_ib_m (i + 1) of measurement points except for the designated measurement points.
  • an apparatus for optimizing measurement points for measuring performance data of an object to be controlled corresponding to a predetermined control parameter predicts performance characteristic of the object to be controlled corresponding to the control parameter using a model of the object to be controlled and calculates prediction performance data (RSM_est).
  • the prediction performance data is sampled at the set measurement points.
  • Sampled performance data (RSM_nm) is calculated based on the sampled performance data.
  • Arrangement of the measurement points is optimized so as to minimize an error (Ersm_nm) between the prediction performance data and the sampled performance data.
  • the number of the measurement points is also optimized.
EP09155647A 2008-03-21 2009-03-19 Apparatus and method for optimizing measurement points for measuring object to be controlled Expired - Fee Related EP2104014B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2008073169 2008-03-21
JP2008153591A JP4491491B2 (ja) 2008-03-21 2008-06-11 制御対象を計測する計測点を最適化するための装置

Publications (2)

Publication Number Publication Date
EP2104014A1 EP2104014A1 (en) 2009-09-23
EP2104014B1 true EP2104014B1 (en) 2012-12-05

Family

ID=40636693

Family Applications (1)

Application Number Title Priority Date Filing Date
EP09155647A Expired - Fee Related EP2104014B1 (en) 2008-03-21 2009-03-19 Apparatus and method for optimizing measurement points for measuring object to be controlled

Country Status (2)

Country Link
EP (1) EP2104014B1 (ja)
JP (1) JP4491491B2 (ja)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5233660B2 (ja) * 2008-12-24 2013-07-10 トヨタ自動車株式会社 内燃機関の制御パラメータの適合方法
JP5218536B2 (ja) * 2010-12-10 2013-06-26 株式会社デンソー 制御装置
JP2013221482A (ja) * 2012-04-19 2013-10-28 Toyota Motor Corp 気筒間空燃比ばらつき異常検出装置
JP6472371B2 (ja) * 2015-12-08 2019-02-20 株式会社小野測器 エンジン特性試験方法およびエンジン特性試験システム
CN110442931B (zh) * 2019-07-19 2022-05-31 兰州理工大学 一种基于rsm的电机多目标优化设计方法
CN111654413B (zh) * 2020-05-18 2022-07-26 长沙理工大学 一种网络流量有效测量点的选取方法、设备及存储介质
CN113008560A (zh) * 2021-02-24 2021-06-22 中国重汽集团济南动力有限公司 一种高压共轨系统柴油机性能与排放的优化方法
CN117371255B (zh) * 2023-12-06 2024-02-20 华中科技大学 一种旋转声源辐射噪声预测模型的构建方法及应用

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0811902A (ja) * 1994-07-05 1996-01-16 Toppan Printing Co Ltd バッグインボックス用注出チューブ
US6324529B1 (en) * 1996-09-27 2001-11-27 Yamaha Hatsudoki Kabushiki Kaisha Evolutionary controlling system
JP3708715B2 (ja) 1998-07-16 2005-10-19 東京メータ株式会社 内燃機関試験装置
DE19908077A1 (de) * 1999-02-25 2000-08-31 Bosch Gmbh Robert Verfahren und Vorrichtung zum Ermitteln von Kenngrößen einer Brennkraftmaschine
JP2001134783A (ja) * 1999-11-04 2001-05-18 Hitachi Ltd 解析モデル化最適制御装置および最適制御方法
JP2003013794A (ja) * 2001-04-24 2003-01-15 Denso Corp 車両用制御パラメータの適合方法及び適合装置
JP3959980B2 (ja) * 2001-04-26 2007-08-15 三菱ふそうトラック・バス株式会社 実験計画法に基づくデータ解析方法および装置並びに実験計画法に基づくデータ解析プログラムおよび同プログラムを記録したコンピュータ読み取り可能な記録媒体
JP2003242184A (ja) * 2002-02-20 2003-08-29 Mitsubishi Electric Corp 解析モデル最適化装置および最適化方法
DE10209146A1 (de) * 2002-03-01 2003-09-18 Bayer Ag Verfahren und System zur automatischen Planung von Experimenten
JP2004116351A (ja) * 2002-09-25 2004-04-15 Fuji Heavy Ind Ltd 制御パラメータの最適化システム
AT500978B8 (de) * 2003-05-13 2007-02-15 Avl List Gmbh Verfahren zur optimierung von fahrzeugen
JP4453581B2 (ja) * 2004-06-03 2010-04-21 トヨタ自動車株式会社 エンジン制御パラメータの実験計画設定方法、その実験計画設定方法をコンピュータに実行させるためのプログラム、そのプログラムを記録したコンピュータ読取可能な記録媒体およびエンジン制御パラメータの実験計画設定装置
US7499842B2 (en) * 2005-11-18 2009-03-03 Caterpillar Inc. Process model based virtual sensor and method
JP4566900B2 (ja) * 2005-12-09 2010-10-20 株式会社エー・アンド・デイ エンジン計測装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KADU S C ET AL.: "Optimal sensor network design for multirate systems", JOURNAL OF PROCESS CONTROL, vol. 18, no. 6, pages 594 - 609, XP022659116 *

Also Published As

Publication number Publication date
EP2104014A1 (en) 2009-09-23
JP4491491B2 (ja) 2010-06-30
JP2009258068A (ja) 2009-11-05

Similar Documents

Publication Publication Date Title
EP2104014B1 (en) Apparatus and method for optimizing measurement points for measuring object to be controlled
JP4339321B2 (ja) 内燃機関の制御装置
US8612107B2 (en) Method, control apparatus and powertrain system controller for real-time, self-learning control based on individual operating style
US8478506B2 (en) Virtual sensor based engine control system and method
US11060953B2 (en) Engine virtual test environment system and engine management system mapping method
EP1705353B1 (en) Method and device for estimating the inlet air flow in a combustion chamber of a cylinder of an internal combustion engine
US10331810B2 (en) Method for determining a model of an output quantity of a technical system
WO2003065135A1 (en) Control system
Nikzadfar et al. Investigating a new model-based calibration procedure for optimizing the emissions and performance of a turbocharged diesel engine
CN108804850B (zh) 基于空间重构的航空发动机过渡态加速过程参数预测方法
EP1985832B1 (en) Control parameters for searching
CN111337258A (zh) 一种结合遗传算法和极值搜索算法的发动机控制参数在线标定的装置及方法
JP6610770B2 (ja) Ｗｉｅｂｅ関数パラメータ同定装置、方法及びプログラム
US11078856B2 (en) Wiebe function parameter identification method and information processing device
Nishio et al. Optimal calibration scheme for map-based control of diesel engines
US20090204376A1 (en) Method for measuring a nonlinear dynamic real system
Langouët et al. Optimization for engine calibration
CN112782974B (zh) 一种控制参数标定方法
US20220235721A1 (en) Internal combustion engine controller
Burggraf et al. Semi-automatically optimized calibration of internal combustion engines
JP4393239B2 (ja) 内燃機関のための空気質量捕捉装置の少なくとも１つの特性曲線を生成する方法
Brahma et al. Development of the nearest neighbour multivariate localized regression modelling technique for steady state engine calibration and comparison with neural networks and global regression
Kaji et al. Acceleration of experiment-based evolutionary multi-objective optimization of internal-combustion engine controllers using fitness estimation
Fang Optimal test signal design and estimation for dynamic powertrain calibration and control
US11761392B2 (en) Method and system for engine air system control

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: 20090319

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA RS

AKX Designation fees paid

Designated state(s): DE FR

RIC1 Information provided on ipc code assigned before grant

Ipc: B60W 50/04 20060101AFI20110929BHEP

RIC1 Information provided on ipc code assigned before grant

Ipc: B60W 50/04 20060101ALI20120309BHEP

Ipc: F02D 41/24 20060101ALI20120309BHEP

Ipc: F02D 41/14 20060101AFI20120309BHEP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602009011661

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: G05B0023020000

Ipc: F02D0043020000

RIC1 Information provided on ipc code assigned before grant

Ipc: B60W 50/04 20060101ALI20120503BHEP

Ipc: F02D 43/02 20060101AFI20120503BHEP

Ipc: F02D 41/14 20060101ALI20120503BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602009011661

Country of ref document: DE

Effective date: 20130131

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20130325

Year of fee payment: 5

Ref country code: DE

Payment date: 20130314

Year of fee payment: 5

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20130906

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602009011661

Country of ref document: DE

Effective date: 20130906

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602009011661

Country of ref document: DE

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20141128

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602009011661

Country of ref document: DE

Effective date: 20141001

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140331

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20141001