SELF-OPTIMIZING METHOD AND MACHINES

Abstract: Method and machines for self-optimizing, dynamically and in real time, relative to a specific performance characteristic in response to variations on a precribed number m of variables. This method comprises selecting a statistical design; repeatedly and at n time instants adjusting conditions of the m variables according to the design and simultaneously recording the n values of the performance characteristic; analyzing the n sets of data to determine the functional relationship between the m variables and specific performance characteristic and also the optimum combination of the variables; and setting the conditions of the variables at the thus-determined combination before the optimum combination changes. Self-optimizing machines of various types are also disclosed.

Description: 4- Description Self-Optimizing Method and Machines Technical Field My invention relates to self-optimizing method and machines and particu- larly to method and machines for self-optimizing dynamically and in real time. Backσround Art This is a continuation-in-part of my pending U.S. application serial No. 275,758 filed June 22, 1981, which was a continuation-in-part of my then U.S. pending application Serial No. 69,297 filed August 24, 1979, now abandoned. Optimization techniques vary greatly. In the U.S. patent prior art, Hardaway's extreme parameter search control system (3,466,430) adjusts one parameter or variable at a time. Russo (3,576,976) provides a control « system having a pattern recognition network in combination with a linear regression network. Smith's (3,694,636) programmed digital computer pro¬ cess control also employs least squares regression fitting of collected data. Barron (3,460,096 and 3,519,998) uses his self-organizing control system to perform search within the multi-variable parameter space. But the microprocessor technology was not developed. Thus , none of these of these patented inventions deal with the unique problems addressed in this application, i.e., self-optimizing method and machines operative in real time with nanosecond speeds together with modern statistical designs (the prior art being totally silent on this necessary technique) for optimiz- ing simultaneously large number of variables (7, 63, 511, 40000,...) with¬ in minutes or fractional seconds. There simply was no microprocessor in 1966-67 to fit into a car or patient's body, or a drill that was power-thrifty and can make billions of decisions within minutes or shorter times, even if the necessary statistical designs to be described were used. But these patents do provide the background for the use of control systems, actua¬ tors, calculators, timing circuits, Dft converters, storage memory, sen- sors , comparators , logic devices , sign detectors , . . . which are often use¬ ful in the practic of this invention. Using statistical methods , the present inventor published a paper on 'Worksheet Gives Optimum Conditions" in Chemical Engineering magzine on April 7, 1958 for optimizing relative to up to seven variables. He also published a paper on 'A Sequential Method for Screening Experimental Vari¬ ables" in the Journal of American Statistical Association, Vol. 57, pp 455- 477, 1962. I hereby incorporate by reference and make as part of this disclosure my aforementioned and pending U.S . patent applications and published papers , and also the above-identified U.S. patents. Automatic machines are very common. Numerically controlled machining or drafting and parts assembling have already made their great impacts. Automatically controlled car speed, room or house heating or cooling , home appliances , industrial processing equipment , and many other tools , equip¬ ment or machines are becoming increasing popular. All these automatic machines use the rapidly developing microelectronics , particularly micro¬ processors . * Unfortunately and contrary to long-felt need , these machines are not smart. They cannot self-optimize , dynamically and in real time, some desired performance characteristics such as fuel economy, accuracy, safe¬ ty, product yield or purity, total cost, environmental impact, or a combina¬ tion thereof. The reasons are not difficult to see. In the case of car speed control, 'representative" sample cars are first selected and tested in limited and arbitrary ways within narrow experimental ranges . Predic¬ tion equations or response surfaces are then determined based on the "average" results for programming onto the microprocessor, with hopes of success but disregard of sampling, extrapolation, and other errors . Car speed depends not only on such obvious variables as temperatures , forces , pressures, speeds , and various settings on the car; but also on many other usually neglected yet critical factors such as type and amount of gas and oil, load on the car, wind type , direction or velocity, rain or snow, driver habit and condition, road age , slope and condition, age and condition of car and engine , and the like, which often change continuously. The effect OMPI of these and many other variables , factors , or parameters have never been completely determined . These effects may also change from one month, week , day , or even instant to another. In addition, these variables may interact strongly. Many of these variables may not be known or suspected . Reliable optimization must, therefore, be done continuously and instan¬ taneously, on the particular machine of interest. Also , there are definitely a large number of variables or parameters that may or may not be present, important, or critical. This large number may be .7 , 31, 63 , 127 , 200 , or 40000. All must be investigated . Missing merely one or a few of the criti- cal variables may make the optimization inefficient or useless . Yet the very many variables and their interactions , and the yet more tests to be normally performed would make the task seemingly impossible. The number n of tests to test m variables at only two levels or conditions each would require n = 2 m tests . For m = 7 , 31, 63 , 127 , and 200 , n = 128 , 2.148 x lO 9 , 9.223 x 10 18 , 1.701 x 10 38 , and 1.606 x 10 60 , respectively. Even with nano -second calculating speeds , the last threem's or n's require over 2.925 x 10 , 5.394 x 10 24 , and 5. 093 x 10 46 years , respectively. To compound the dilemma , the fact is that no two cars , machines , equipment, materials , parts , persons , environment, .. . are identically the same, differing by parameters which may or may not be critical. Variable tolerances exist on the many (within-specification) car or machine components . These compo¬ nents interact . The chance combinations of which machines having what critical component combinations are totally unknown and unpredictable . This is yet another reason why true and meaningful optimization must be done on the very particular car or machine itself. In addition, the levels or conditions of these many variables must be set at the unique combination of their respective optimal values , at the very instant the functional rela¬ tionship is determined and before this relationship changes . Further, because the car or other machine is in a dynamic environment, these tests , determinations , and variable settings must also be done dyna¬ mically, to be periodically checked and/oτ adjusted every hour, minute , or even fractional second , as is needed. Such requirements nullify any pre¬ set programs and can be met only with systematic statistical designs to¬ gether with the most modern microprocessors i Disclosure of the Invention My present invention provides a method for self-optimizing a machine , dynamically and in real time, by selecting an efficient, statistical design; adjusting the conditions of the m variables according to the design matrix; performing the necessary tests; collecting and recording the many sets of data on the conditions and values of the performance characteristics to be optimized; analyzing the data on the very machine itself to determine the functional relationship between the variables and the performance charac¬ teristics; computing with better than nanosecond calculating speeds the unique combination, for a particular time instant, machine condition, envi¬ ronment, or service requirement, of the many variables which instantaneous -ly optimizes the desired performance characteristics; setting these many variables at their respective optimum values or conditions; and periodical¬ ly checking and readjusting for optimization for the subsequent time in- stants . Different machines for various industries and operating on the basis of this self -optimizing method are also disclosed. Brief Description of»Drawinqs In the drawings: Fig. 1 shows the flow chart of the self-optimizing method; Fig. 2 shows a self -optimizing furnace for a special iron-base alloy; Fig. 3 shows a self-optimizing car according to the invention; Fig. 4 shows a flowchart of the self-optimizing method employed for an automatic manufacturing system; and Fig. 5 shows a flowchart of a self-optimizing method by means of a se- quential screening method . Best Modes for Carrying Out the Invention The method and machines of the invention is of general applicability for self-optimizing many and various machines, dynamically and in real time, and with lightening speeds in the dealing of tens , hundreds , thousands , or more variables requiring billions or more calculations steps . The various steps in a typical self-optimizing method is shown in the flowchart given as Fig. 1. The following example illustrates in detail the application of this self-optimizing method. The example relates to Example IJUREA 1 given in my previously mentioned, worksheet paper. The design matrix, MTXDSN (J,I), however, has been modified for ease of programming. Table 1 and 2 show the design matrix and program listing, respectively. The de¬ sign matrix is an 8 (or 2 ) x 7 (2^-1) matrix for dealing with up to m = 7 vari 5 ables in n = 8 tests. It can be built from a 4 x 3 matrix (as shown by the heavy line) which, in turn, can be built from a 2 x 1 matrix. The k values in these three matrices are: 3, 2, and 1, respectively. To determine the first column in a new design matrix k' =k + 1, the low-level condition (or level l) is put down in the first 2 tests, followed by high-level condition 10 (or level 2) in the last 2 tests, as shown in the do loop (with statement num -ber 27) of the program listing of Table 2. After copying the old matrix for the lower left quarter of the new matrix (as shown in Tables 1 and 2), the other 2 k - 1 columns, i.e. , columns JJK = 2 k_1 + JJ, JJ = 1 to NIM (=NI = k-1 2 - l) are obtained, for a given test number J, by comparing the condi- 5 tions or levels in columns JJ and NI. If these two columns have the same - condition 1 or 2, this new JJK column has condition 1, otherwise 2, that is: if the sum of these two levels (l or 2) is odd or even, respectively. While this design matrix (ϊable l) can be used to test m = 1, 3, 7 = 2 - 1 varia- bles in n= 2 =2, 4, 8 tests, the last 8x7 matrix can be easily expanded 0 according to the above principle or the program (Table 2) to handle m =15, 31, 63, 127, 255, 511, 1023, ... = 2 - 1 variables in n = m + 1 tests. The example given deals with a machine 20 in the form of a furnace to make special iron-base alloy. The furnace is self-optimized relative to a specific performance characteristic, i.e., hot tensile strength in 1,000 5 psi (or 5.89 x 10 newtons/m 2 ), of the resultant alloy produced on the fur¬ nace in response to variations in a fixed number (i.e. , m = 7) of variables (i.e. , A trhough G for, respectively, the seven chemical elements Cr, Ni, Mo, V, Nb, Mn, and C). This machine or furnace has a built-in micro¬ processor 28 which, given the base level (e.g. , 4% for Cr) and unit of 0 change (e.g. , 1% for Cr) for the variables, automatically computes the de¬ sired levels, i.e., for a two-level factorial experiment, the high level, hilo(l,2) = 5( ), and low level, hilo (l,l) = 3(%) for the first variable Cr. For the other variables, m =2 to 7, the base levels are: base (i) =2, 0.1, 0.02, 0.1, 0.4, and 0.4 (%) respectively; while the unit of change: Unit O PI (i) = 1, 0.1, 0. 02 , 0.1, 0.1, and 0.1 (%) , respectively. The complete m x 2 hilo matrix can thus be completed. The design matrix selected by the microprocessor according to the pre- viously listed program will have an n = 2 k = 2 , = 8. At two levels each, this normally requires 2 = 128 tests . The designed experiment is thus a • 7 A 1/2 ~ = 1/2 = 1/16 fractional replicate experiment. That is , only one out of every 16 tests is to be actually run. The savings are very substantial. With larger n and m, the savings are even greater. In fact, such designed experiments may turn impossible tasks into easily manageable experiments . Seven {~ ~ a) actuators or alloy elements feeders 21-27 are provided, one for each element. These actuators are sequentially actuated 8 =n) times , being controlled (as to feeding times or rates) by the same microprocessor 28 through the interconnecting line 19 in Fig. 2. These actuators adjust simultaneously the 7 variables (i.e . , elements Cr, Ni, . ..) . according to the design matrix, mtxdsn(8, 7) and high-low level matrix, hilo(7 f 2). For example , the first test (i=i) requires all elemental additions at their low levels, i.e . , hilo(i, l) , i=4 to 7, or 3% Cr, 1% Ni, . .. The self-optimizing machine or furnace then makes 8 melts or tests according to the design ma¬ trix (Table l) to complete the factorial experiment. One or more test sam- pies as sampled by sampler 29 are automatically prepared from each of the 8 melts for testing on a hot tensile testing device 39. The 8 test results are recorded and stored in the memory section (not shown) of the micro¬ processor, and statistically analyzed by the microprocessor to determine the functional relationship between the seven elements or variables on the hot tensile , performance characteristic pfmcha(j) , j = 1 to 8. From this relationship the optimizing tests are designed and tested along the steepest ascent path as determined by the base levels , base(i) , effects , effect(i) , and units of change , unit(i) . Various ways of considering that optimization has been achieved are given in the last group of comment statements (begin -ning with "C" in the listing) . The 7 actuators are then adjusted under the control of the microprocessor 28 to be set at their respective , thus-deter¬ mined levels along the steepest-ascent path. This procedure completes the self-optimizing process on this machine or furnace. The statistical analysis on the performance characteristic data , pfmcha( yields the main effects of the m variables , effect (i) , and also their inter¬ actions , couple (i,j) . These main effects , when multiplied by the respecti units of change, unit (i) , give directly the partial derivatives, change (i) , if the constant, constn, is 1.0. These partial derivatives , relative to the m variables or elemental concentrations , do not include the interactions . In some cases , complete fractional factorial experiments need or cannot be done . Proper sensors are then provided at strategic locations to sense simultaneously the levels of all the variables at various time instants and also to record the performance characteristic (i. e. , hot tensile strength in the above example) . A mass spectrograph or microprobe, for example , may be installed on the machine to analyze samples at selected time intervals a to the concentration of the seven selected elements. A regression equation can then be determined which expresses the functional relationship between the seven elements and the hot tensile strength . From this relationship , the partial derivatives and steepest-ascent path can also be determined . For programming the microprocessor 28 in the determination of the regression equation, see , e . g.*, Russo'ε patent 3 , 576, 976. Industrial Applicability In the above example , the self-optimizing machine is a furnace for pro¬ ducing special alloy steels . Very minor and simple modifications of the above machine yield a drug-searching or dispensing machine self-optimized to dispensing the optimum combination of drugs such as Cr, Ni, Mo, V, Nb , Mn, C (or others including not only chemical elements but minerals , plants, and living or killed bacteria) through feeders 21-27 into a drug-feeding de¬ vice in the form of a hypodermic needle or mouth-feeder. A tester 39 work¬ ing in conjunction with a sampler 29 may be used to examine the medical conditions of the human or animal patient so fed. Such conditions include functions of the vital organs; chemistry of the sampled blood , urine , and other fluids; or other physiological data to be optimized . Like in the pre¬ vious furnace case, the actuators 21-27 , sampler 29 , and testing device 39 are all connected to the microprossor 28 to be controlled thereby. To search or screen thousands of drugs for a few that can cure a critical diεease such as cancer, Li's previously-mentioned , sequential screening technique may be used. In this technique, the best way to screen m drugs for a few (p) critical ones in c cycles should have the same number of tests, i.e. , (mp c ) , in each cycle. For example, to screen 10000 drugs or chemicals in c = 4 cycles for an estimated p = 10 critical drugs , each cycle requires 56.2 tests (i.e . , one cycle may require 57 tests) all fed through separate bins through feeders . Ten or less of the 56.2 tests will show posi tive or negative effects . The other tests of the first cycle, i.e . , 46.2 in number, will show no effect and all the drugs in these tests (46.2 x 10000 /56.2 = 8220.6) will not be tested any more. The 1779.4 drugs will be screened in the second cycle also in 56.2 tests , each with 31.7 drugs and so on until all the four cycles are completed. The total number of tests required is at most only 4 x 56.2 = 224.8 representing a saving of 97.752% . It was shown that even if the estimate of p is off, this total number is still about the same. Further, If the negatively-affecting drugs are also discard -ed together with the other insignificant drugs, the total number of tests is still smaller and saving even greater. The flowchart of this optimizing method is given in Big. 5. Note that for each of the 10000 drugs , the hilo matrix values may be simply no and yes (for levels 1 and 2, respectively) , low and high or, moiε specifically, 5 and 10% of the fatal dosage for the particular drug . One can thus also determine the effect (i) , i = 1 to 10000; change (i) , i = 1 to 10000; . .. and the method of steepest ascent can also be used here. For application of the self-optimizing method on a car, the specific per- formance characteristic may be fuel economy or minimum time of trip, within certain constraints as to fuel consumption, engine wear, speed limits, driver's fatigue, . .. The variables , besides those already mentioned , may include: air-fuel ratios , fuel ignition conditions, exhaust design, and the like. Here , the sensors sense the pressures , temperatures , times , forces , fluid levels , flow rates , voltages , currents , . . . , while the actuators actuate timers , metering devices , voltage regulators , force applicators , . . . All these sensors and actuators are commercially available and may be suit¬ ably connected to the machine and its microprocessor and to each other if needed as well as to memory devices , as per conventional electronic con- I trol technology. Other applications of the self -optimizing method and machines include those for building heating and/or cooling control, home appliances , manufacturing systems , industrial processing equipment, R & D machine , electrical tools, service equipment, transportation vehicles , smart weapons . . . The specific performance characteristics and selected variables for different applications are different, thereby requiring different sensors and actuators (also mostly commercially available) . But the design of the self- optimizing machine is similar, and the same microprocessor, interconnec- tions , statistical designs , optimizing schemes, . . . , are still useful. Fig. 3 shows such a self-optimizing car 30 having a microprocessor 31, an engine or power unit 32 , and sensors 33 and 34 which sense the voltage and flow rates (e .g. , of fuel or oil) . The sensed signals are sent to the microprocessor by signal-transmitting lines 35. For simplicity of illustra- tion, other sensors for, e. g. , pressures , times , currents , . . . , are not shown. The microprocessor 31 analyzes all the sensed and transmitted data in real time and then directs the various actuators , i.e. , the voltage regu- tor 36 and flow metering actuator 37 (other actuators not shown) to set these various parameters or variables to their respective optimizing levels for these particular time instants , as dynamically determined by the micro¬ processor 31 from the real-time , fast delivered data involving possibly thou¬ sands or millions of bits of data each second . Fig. 4 shows the flowchart of an automatic manufacturing system. Here , seven (7) categories of information, or values of parameters , are collected . These categories include: equipment, materials , parts , personnel, envi¬ ronment, preliminary design, and rules and regulations . The equipment category alone, e.g . , may include hundreds of large or small machines , each containing one or more pos sibly important or critical parameters , such as tool material, type, and rake angles , or lubricants type and flow rates. Rules and regulations may be of the city, state, federal, or international type. For completely automatic or personless manufacturing system, the personnel category may be deleted. After rapidly collecting and instantly analyzing all the input data , the microprocessor continuously and automatically design (CAD) , and directs OMPI the optimized design to be made (CAM) , sampled (CAS) , and tested (CAT) . A continuous and automatic reanalysis and optimizing (CAO) , based on given optimizing criteria on selected combination of weighed performance charac¬ teristics . This Is followed by an optimizing check based on the same crite- ria. This optimization check results either in a redesign (CAD) or produc¬ tion, with automatic , continuous , and 100% rechecking of product quality, production speed or cost, . . . , for further optimization evaluations . Note that the human interacts with the system only once, at the very beginning to supply a very minor portion (i.e. , one of seven categories) of the data input for the very first preliminary design. After this the human is totally out of the picture. In fact, any already-working, automatic manufac¬ turing system may directly transmit the preliminary design information to other similar systems for their first preliminary designs. In this case, there is no need for any humans . The system transfers its "intelligence" to other systems reliably, accurately, inexpensively, and orders of magnitude fester. A flowchart similar to that of Fig. 4 may be used for mineral or oil drill¬ ing operations . Here, the equipment may refer to the drilling platform, drilling machine, . . „; the materials to the lubricants , . . .; the parts to the drill bits, . . .; the personnel to the crew make-up; the environment to the rock type , dip , inclination, hardness , . . . Other industrial, business , household, military, medical, . . . applications of the same flowchart are also possible. The invention is not to be constued as limited to the particular forms disclosed herein, since these are to be regarded as illustrative rather than restrictive. For example, the optimizing procedure given involves only linear or main effects of the variables, according to a simple mathematical m model: pfmcha = « ή aj X£ (XQ = l) . Interactions , couple (i) , are also found according to the listed program in Table 2 , so that a better model of the type rr. m m pfmcha = ^f^ a.x. + . * b X j X, can readily be programmed to replac the one given for the determination of the steepest ascent path . Still other models may involve non-linear effects such as + . .. The partial derivatives ^ cmch /^x. can still easily be obtained and used for optimization as per, e. g. , Hardaway' s patent (3 , 465 , 430) . The advantages offered by the invention are many: 1. The optimization is done dynamically and in real time , on the particu- and relevant machine of interest and with the very materials , parts, person¬ nel, environment, . . . employed for the given operation. There are no error due to sampling and extrapolation (from machine to machine , part to part, . . and time instant to time Instant); 2. The optimization is done systematically, efficiently, reproducibly, and not by random trial-and-error. Efficient statistical designs , in particu¬ lar, increase the experimental range (e.g . , number of parameters) and reduc the number of required tests, calculating steps , computing time, . . . , by many orders of magnitude, thereby enabling real-time optimization; 3. The self -optimizing machines do not just merely passively adapt or adjust to changes in one or two environmental parameters; they actively and continuously seek (by computing and setting at) the instantaneous opti- mum combination of many parameters in several different categories; 4. The performance of the self-optimizing machines is either at the very optimum, or is always improving with time; 5. Human contro}, guidance , intervention, . . . are eliminated because it is not only undesirable but impossible due to the extremely limited human memory (dedicated) and speed of memory recall, reading , comparing, correlating , calculating , commanding, . . . Intelligence" transfer is now from machine to machine; 6. Various applications in different industries would relieve the mono¬ tonous and tedious work not only of the blue-collar workers , but even white workers including engineers, scientists , researchers , managers , skilled technicians , and physicians; 7. Smart, self-optimizing machines , long wanted everywhere and worked on by many for years , become realizable for the first time . Table 1: Design Matrix to Handle up to 7 Variables . k=l 2 3 n= 1 1 1 1 1 1 1 1 2 2 1 2 1 2 1 2 3 1 2 2 1 1 2 2 4 2 2 1 1 2 2 1 5 1 1 1 2 2 2 2 6 2 1 2 2 1 2 1 7 1 2 2 2 2 1 1 10 8 2 2 1 2 1 1 2 m= 1 Table 2: Program Listing for the Self-Optimizing Method. Dimension mtxdsn (512,511), pfmcha (512), effect (511), base (511), unit 15 1 (511), cnange (511), set (511), couple (511,511), hilo (511,2) C Use larger dimensions for arrays or matrices for n^512 and k?*9 constn = 1.0 C Or any value to facilitate new settings , set (i) C Find test number n from k,i.e. , n = 2 given m 20 n= 1 k = 0 20 k= k+ 1 n=n* 2 if (n- 1 -m) 20, 21, 21 2521 xn = n C Determine first column in design matrix, mtxdsn (j ,i) do 25 j =1, n, 2 JP = J + 1 mtxdsn (j,l) =1 3025 mtxdsn (jp, l) = 2 C Determine columns i = 2 to k in design matrix ni = 2** (M) nim = ni - 1 do 27 j =1, ni jni = j + ni 5 mtxdsn (j,ni) = 1 27 mtxdsn (jni,ni) = 2 C Determine columns jj = ni to n-1 in design matrix do 28 j =1, n do 28 jj =1, nim 10 jjk = jj + ni k = mtxdsn (j,jj) + mtxdsn (j, ni) 28 mtxdsn (jjk, j) =k -k 2 * 2 + 1 C namely, if both mtxdsn (j,jj) and mtxdsn (j, ni) are 1 or 2, mtxdsn (jjk, C j) = 1; otherwise mtxdsn (jjk, j) = 2 15 26 continue C See if optimizing cycle number, ncycie, exceeds specified cycle number, C ncycsp. If so, optimizing has been completed, all variables and m C actuators are th£n set at the optimized values or conditions. If not, go C to step 29 20 ncycie = 0 24 ncycie = ncycie + 1 if (ncycie -ncycsp) 22, 22, 29 29 stop C Determine high and low levels for the m variables. 2522 do 23 i=l, m hilo (i,l) =base (i) -unit (i) 23 hilo (i,2) =baεe (i) + unit (i) C Use actuators as controlled by microprocessor to adjust the m variables C to their respective high (level 2) or low (level l) conditions according to 0 C design matrix, mtxdsn (j, i). Perform the n tests in n consecutive time C instants. Collect and store data in microprocessor for the following C data analyses to determine the functional relationship, i.e. , effects C and interactions of variables, effect (i) and couple (i, l) , respectively. C Data used are the stored performance characderistic, pfmcha(j), j=4,n. Oi do 31 i = 1, m effect (i) = 0. do 32 j =1, n k = mtxdsn (j,i) xk = k xk= 2. * xk -3. 32 effect (i) = effect (i) + xk * pfmcha (j) effect (i) + effect (i) /xn 31 changed) = effect (i) * unit (i) * constn C Determine interactions between variables A and B, I.e., couple (ia,ib). do 33 ia =1, m couple (ia, ib) = 0. do 34 ib = 1 , m do 34 j =1, n kab = mtxdsn (j, ia) + mtxdsn (j, ib) xkab = kab - kab /2 * 2 + 1 xkab = xkab * 2. - 3. 34 couple (ia, ib) =^ouple (ia, ib) + xkab * pfmcha (j) 33 couple (ia, ib) = couple (ia, ib) / xn C Testing along steepest ascent path from base levels, base (i), with si- C multaneous, successive incremental changes, change (i), on all m var- C iables to optimize performance characteristic, pfmopt. If new pfmopt C exceeds previous, stored pfmopt, i.e., pfmstr, continue on steepest C ascent path. If not, either: l) pause; 2) change base (i) to set (i), i.e. , C base (i) = set (i); or 3) halve change (i); and go to step 24. C Alternately, if pfmcha becomes less than pfmstr, make change (i) = C - change (l)/2., i.e., halve change (i), and reverse sign to go back C along the steepest ascent path with closer steps. Stop when 3 (or 5 or C other number) reversals and halvings have taken place, with a program C similar to Hardaway's three reversals before switching parameters. C This program listing is not given here. j = 0 pfmopt = 0. 46 set (i) =base (i) 44 j = j + 1 if (j -1000) 41, 41, 43 41 pfmstr = pfmopt 5 do 42 i =1, m 42 set (i) = set (i) + change (i) C Perform test to obtain new pfmopt, for comparison with pfmstr. if (pfmopt -pfmstr) 44, 44, 41 C To minimize pfmopt, replace the series of number in above by "41,41,44". 10 43 do 45 i =1, m base (l) = set (i) 45 unit (i) =unit (i) /2. go to 24

Claims: Claims 1. A method for dynamically self-optimizing, in real time , a system rela¬ tive to a specific performance characteristic in response to variations on a prescribed number m of performance-affecting variables comprising: designing a statistical test plan in which said m variables are simulta¬ neously and systematically varied in n tests; sequentially setting according to the plan said m variables at their res¬ pective planned values at n successive time instants; sequentially evaluating said performance characteristic at the n succes- sive time instants with said m variables thus set; with better than nanosecond calculating speeds and on this particular system itself determining the real-time , functional relatiohship between said m variables and said performance characteristic and also the optimum com¬ bination of said m variables to achieve the desired , optimized performance characteristic on the system for the particular time instants , and condition, environment, and requirements of the system; and simultaneously setting said m variables at the thus-determined optimum combination sufficiently rapidly before said functional relationship and opti¬ mum combination substantially change . 2. The method as in claim 1 wherein m is no less than 7 and said n suc¬ cessive time instants are within minutes. 3. The method as in claim 1 wherein the test plan is a symmetrical and orthogonal, fractionally replicated factorial design and m is over 15. 4. The method as in claim 1 wherein the test plan is a sequential screen- design and n is a minor fraction of m. 5. The method as in claim 1 including periodically reevaluating said per¬ formance characteristic at time instants within minutes subsequent to said n successive time instants to collect additional data on said variables and performance characteristic; redetermining the new, real— time function¬ al relationships and optimum combinations; and substantially instantly resetting said m variables at the new optimum combinations thereby dynam¬ ically maintaining the system optimized at all subsequent time instants. -gUREΛ c OMPI 6. A machine self-optimized , dynamically and in real time, on a specific performance characteristic relative to a multiplicity of m performance-affect -ing variables comprising: programmed microprocessor (28) having better than nanosecond calcula ting speeds; actuating means (21-27) for sequentially controlling at each of n substan¬ tially consecutive time instants the values of said m variables; means for evaluating said performance characteristic at the same, conse cutive time instants (39); and means for transmitting (19) the n sets of recorded values from said actuat ing and evaluating means into said microprocessor for nanosecond calcula¬ tions to determine the real-time functional relationship between said perform -ance characteristic and said m variables and also of the optimum combina¬ tion of said m variables to achieve the desired, optimized performance characteristic on said machine for the particular time instants and condition, environment, and requirements of said machines; said actuating means (21-27) being directed by said microprocessor to simultaneously εet «aid m variables at the thus -determined optimum com¬ bination substantially rapidly before said functional relationship and opti- mum combination substantially change . 7. The machine as in claim 6 in the form of a drug-dispensing machine self-optimized to dispense the optimum combination of drugs in a substan¬ tially continuous manner into a sick patient and wherein said specific per¬ formance characteristic is the medical condition of the patient including the function of a vital organ of the patient and said m variables are a mul¬ titude of chemicals or drugs to be administered to the patient, the entire machine being integrated into a self-contained unit occupying less than 0.1 cubic meter and implantable inside the body of the patient. 8. The machine as in claim 6 in the form of an integrated and self-con- tained , industrial processing equipment occupying less than 0.1 cubic meter and wherein said specific performance characteristic is the unit cost of pro¬ cessing and said m variables are processing variables while all the n time instants are within minutes. OMPI "" 9. The machine as In claim 6 and in the form of a car wherein said m variables include at least 15 of those selected from the group consisting of: car age and condition, engine speed, temperature, and settings , type and amount of fuel and oil, air-fuel ratios , pressures in the combustion cham- bers, fuel ignition conditions , loading on car, wind type, direction, and velocity, weather conditions , road age , slope and condition, and traffic type and density; said microprocessor being sufficiently light, small (less than 0.1 cubic meter) , and power-thrifty to be usefully installable on the car, and yet having sufficiently large memory and also fast calculating speeds to handle billions of calculating steps for the required, real-time optimization within minutes . 10. The machine as in claim 6 and in the form of a mineral drilling mach¬ ine and wherein said performance characteristic is a unit cost of drilling and said m variables include drilling, personal, and environmental variables; and including means for periodically checking at prespecified time intervals the constancy of the functional relationship; and means for instantly adjust¬ ing said m variables to the new optimum combinations when said functional relationship significantly changes with time.

Inventors: LI CHOU H, LI, CHOU, H.
Applicants: LI CHOU H, LI, CHOU, H.
Application year: 1982
Main classification: G05B13
IPC codes: F02B75, G05B11, G05B13, G06F19, G06Q10