METHOD FOR CONTROLLING AN ACTIVE CONTROL SYSTEM AND SYSTEM USING SUCH METHOD

Abstract: Method for controlling a control arrangement controlling a predetermined system (10), the control arrangement comprising a controller (6), M output sensors (4) providing an output signal vector y(t), L control actuators (2) controlled by a control signal vector u(t) provided by the controller (6) and N reference signal generators (8) for providing a reference signal vector z(t) to the controller (6). The method comprises the step of minimizing a criterion function J defined as a mixture of energy of an observed output signal vector epsilon >1<(t) and energy of a control error signal vector epsilon >2<(t), by recursively updating the controller coefficients in w(t) proportional to the observed output signal vector epsilon >1< and proportional to the control error signal vector epsilon >2<.

Description: Method for controlling an active control system and system using such method The present invention relates to a method for controlling a control arrangement controlling a predetermined system, the control arrangement comprising a controller, M output sensors providing an output signal vector y(t), L control actuators controlled by a control signal vector u(t) provided by the controller and N reference signal generators for providing a reference signal vector z(t) to the controller, L, M, N being positive integers, the output signal vector y(t) being defined as: y(t) = d(t) + H(q 1 )u(t) with: d(t) = a disturbance signal vector of dimension Mxl; H(q _1 ) = a transfer matrix of the predetermined system of dimension MxL in a backward shift operator q "1 ; the control signal vector u(t) being defined as: u(t) - Φ τ (t).w(t) with: Φ τ (t) = a block diagonal matrix of dimension LxLNI built up of L row vectors φ , each vector φ being the transpose of NIxl vector φ containing the last I samples of the N reference signals z n (t), I being an integer, w(t) = a vector containing all controller coefficients for the controller. Active control systems are generally formed by a number of actuators and sensors. The actuator outputs are controlled by actuator signals from a controller, based on inputs from both sensor signals and reference signals. Generally, the actuator signals are controlled such that desired sensor signals are obtained. In e.g. active sound suppression systems the signal detected by the sensors should be minimal, which is obtained by adapting the actuator signals dependent on the reference signals and sensor signals. However, to obtain such a result, it might be necessary to control the actuators with high amplitude signals. Certain actuators are limited with respect to the amplitude (or energy) with which they are controlled, and controlling the actuators with too high a signal might lead to non-linear behaviour (which is undesirable) or might even damage actuators. Moreover, high amplitude control signals may weaken the robustness of the control method, and small variations in control parameters may lead to serious performance degradation. It is, therefore, an object of the present invention to provide a method for controlling an active control system, in which the combination of the energy from the sensors and the energy to the actuators is optimised. This object is achieved by a method according to the preamble of claim 1, characterised in that the method comprising the step of minimizing a criterion function J defined as a mixture of energy of an observed output error signal vector ε^t) and energy of a control error signal vector ε 2 (t), defined as: ει(t) = P(q 1 ) y(t) ε 2 (t) = QCq '1 ) u(t) with: P(q _1 ) = an MxM dimensional rational weighting matrix of the output sensor signals, Q(q _1 ) = an LxL dimensional rational weighting matrix of the actuator signals, the step of minimising the criterion function J comprising the step of recursively updating the controller coefficients in w(t) proportional to the observed output error signal vector G \ and proportional to the control error signal vector ε 2 . Minimising the criterion function J will provide a robust control method, enabling limitation of the drive signal to actuators while maintaining performance of the control method. In an embodiment of the present method, the output error signal vector ει(t) is equal to ε^t) = P(q _1 ) y(t|w(t)), in which y(t|w(t)) is a prediction output signal vector, corresponding to the output signal vector y(t) of the sensors (4) at time t in the case that the controller coefficients w(t) have been held constant for a period longer than a response time of the predetermined system. If the controller coefficients are time varying (as may occur during adaptation) y(t|w(t)) may differ significantly from the true sensor output y(t). This embodiment requires some additional computational effort, but provides a more stable control method behaviour. In an embodiment of the present method, the contributions to the criterion function J of output error signal vector ει(t) and control error signal vector ε 2 (t) are tuned by nonnegative entries in diagonal matrices K and Λ, respectively in the criterion function J, the criterion function being defined as J = [ ει (t)ε 2 (t)] 7 In this embodiment it is possible to tune the relative importance of each individual output error εi and of each individual control error ε 2 in the criterion function J. A further embodiment of the present method implements the tuning of matrices K and Λ by a supervisory control layer, adapting the nonnegative entries in matrices K and Λ in relation to the transfer function H of the predetermined system and the characteristics of the reference signal vector z(t), the output signal vector y(t) and the control signal vector u(t). This embodiment allows maintaining the desired control behaviour by varying elements in the matrices K and Λ. E.g., changes in the transfer matrix H of the predetermined system or the frequency contents of reference signal vector z(t) may necessitate adaptation of the elements in the matrices K and Λ. The supervisory control layer may be extensively trained beforehand. Although normally the matrices K and Λ are tuned offline, the supervisory control layer may adjust the values of the elements in the matrices K and Λ yielding time variant weight characteristics of matrices K(t) and Λ(t). In a preferred embodiment, the controller coefficients in w(t) are recursively updated according to w(t + 1) = w(t) - γ(t)[F (q ~x , t)K(t)ε x (t) + F 2 (q ~ , t)A(t)ε 2 (t)] in which F^q "1 ^) and F 2 (q -1 ,t) are time-variant rational matrices of dimensions LNIxM and LNIxL, respectively, and γ(t) is a positive scalar used to tune the rate of convergence of the control method. This method allows an adaptation of the scalar γ(t) to influence the convergence behaviour of the control method. In a further embodiment of the present invention, Fχ(t) and F 2 (t) have a structure according to F 1 (t) = F 3 - I (κ(t)Ψ 1 (t)) T ; F 2 (t) = F 3 - 1 (Λ(t)Ψ 2 (t)) T ; and F 3 = E{ψ? (t)K T (t)K(t)^ (t) + Ψ 2 T (t)Λ τ (t) A(t)Ψ 2 (t)} in which Ψ l (t)= PHΦ T (t), and Ψ 2 (t) = QΦ T (t) . In this embodiment, the controller will be stable, and have an optimal convergence and tracking speed, by selecting a specific structure for the transfer matrices Fi(t) and F 2 (t), which control the feedback of errors εj. and ε 2 to the controller coefficients w(t). Preferably, the matrix inversion F 3 _1 is calculated off-line, stored in a memory and retrieved when needed, such that the total real-time computational demand is smaller. Preferably, F 1; F (t), F 3 (t) and its inverse F 3 _1 (t) are tuned simultaneously with the tuning of K and A, as this will maintain the favourable characteristic of convergence rate equalisation and stability of the control method. Also, in a further embodiment, F 3 (t) is preferably updated as function of matrices K and A by using a rank one updating algorithm, e.g. the rank one QR update algorithm as described in G.H. Golub and C.F. van Loon, "Matrix computations", Johns Hopkins University Press, 1996. This is a computationally efficient way for updating F 3 (t). Preferably, the matrix A is tuned versus matrix K to provide a predetermined balance between performance at the output sensors and required control effort. In general, the bigger the values on matrix A, the higher the robustness of the control method, at the expense of performance at the output sensors, and vice versa. According to an embodiment of the method, the values of diagonal entries of matrix A are raised, such that the real parts of the eigenvalues of a matrix A remain greater than zero under changes in the real transfer matrix H, the matrix A being defined as A = EJF, (t)K(t)Ψ, (t) + F 2 (t)Λ(t)Ψ 2 (t)} In this embodiment, the chance of an unstable recursion is diminished and the control system remains very robust. In a further embodiment, the control actuator signals u(t) are limited by setting specific values of diagonal entries of matrix A. This allows a natural convergence of the control method with a certain performance and simultaneously limits drive signals to each of the actuators which require such a restriction. The supervisory control layer may implement the step of tuning the nonnegative entries in matrix K to provide a higher weight to predetermined elements of the output error signal ει(f). This allows a flexible way of taking into account the relative importance of the output signals of the sensors in the predetermined system. In a further aspect, the present invention relates to an active sound suppression system or an active vibration suppression system comprising at least one actuator, at least one sensor for providing an output signal vector y(t), a controller for providing a control signal vector u(t) to the at least one actuator, a reference signal generator for providing at least one reference signal z(t) to the controller, and an update unit, receiving the output signal vector y(t) and providing a controller coefficient vector w(t) to the controller, in which the update unit and controller are arranged to execute the method according to the present invention. For the person skilled in the art, it will be clear that the present method can be advantageously implemented in a software program. The software program will then be run on a computer, interfaced with hardware elements of the present system under control, i.e. the actuators and sensors. The present invention will now be described in a detailed manner with reference to the accompanying drawings, in which: Fig. 1 shows a simplified scheme of an active control system; Fig. 2 shows a diagrammatic view of the control elements of the method according to the present invention. Fig. 1 shows a simplified scheme of an active control system, with an error sensor 4, a control actuator 2 and a reference signal generator or sensor means 8. This simplified scheme can be extended for the more general case of an active control system comprising M output sensors 4, L control actuators 2 and N reference signal generators 8. The output signals from the error sensors 4 at time t are denoted by an Mxl dimensional output signal vector y(t), the control signals to the control actuators 2 at time t by an Lxl dimensional control signal vector u(t) and the reference signals from the reference signal generators 8 at time t by an Nxl dimensional reference signal vector z(t). The actuator 2 is driven by the control signal vector u(t) provided by a controller 6. The input to the controller 6 is formed by the reference signal vector z(t) provided by the reference signal generator 8 and a controller coefficient vector w(t), provided by an update unit 12 and comprising the coefficient for the controller 6. The update unit 12 is provided with the output signal vector y(t). An active control system as described with reference to Fig. 1 can, e.g. be used in an anti-noise system or an anti-vibration system. Speakers or piezo actuators may form the actuators 2, and microphones or accelerometers, velocity sensors or force sensors may form the output sensors 4. Depending on the type of actuator 2, performance limitations exist, e.g. with regard to the maximum control signal to be applied to ensure that the actuator 2 will not be damaged or exhibit non-linear behaviour. Next to the requirement for a minimal signal from the output sensors 4 (minimum noise in the case of the active sound system), a requirement may be added to minimise the actuator signal amplitude or energy. In general, these two requirements are conflicting. At one end, no signal to the actuators 2 will result in no noise cancellation at all, and at the other end, maximum noise cancellation will require unconstrained actuator signals. Fig. 2 shows a diagrammatic view of the control elements of the method according to the present invention. The active control method controls a predetermined system 10, which transforms the output u(t) of the actuator 2 according to a rational transfer matrix H. The predetermined system 10 receives a disturbance signal d(t). The output signal vector y(t) can thus be written as: y(t) = d(t) + H(q- 1 )u(t) (1) where d(t) is an Mxl dimensional vector of desired or disturbance signals and H(q _1 ) is an MxL rational transfer matrix in a backward shift operator q "1 . The control signal vector u(t) is built up of L control signal samples ui, where each uj can be written as the sum of N individual responses to the reference signals: u, (t) = ∑u In (t) (2) n=l where each uι n (t) can be written as a discrete time convolution of reference signal z n (t) and a finite impulse response (FIR) filter with I taps and coefficients wι„(t): u ln (t) = w ln (t)®z n (t) = ∑w lni (t)z n (t-i) (3) i=0 Each signal z n (t) is constructed such that a response of previous values of u(t) in z n (t) is absent or can be neglected. This can be achieved either electronically or by selecting special reference sensors. Equations (2) and (3) can then be written in vector notation as: u 1 (t)= φ τ (t)w 1 (t) (4) where the NI l vector φ contains the last I samples of the N reference signals z n all reference signal samples and w x contains coefficients of the 1-th controller. The overall control signal vector can be denoted as u(t) = Φ τ (t)w(t) (5) in which Φ τ is a block diagonal matrix of dimension LxLNI built up of the row vectors φ τ on the diagonal entries and w is a LNIxl vector containing all controller coefficients. In the active control system, two error signal vectors can be defined as: ε,(t) = P(q- 1 )y(t | w(t)) ε 2 (t) - Q(q- 1 )u(t) where P(q ) is a MxM dimensional rational weighting matrix 14 of the output sensor signals and Q(q ) is an LxL rational weighting matrix 16 of the actuator signals. The signal ε^t) can be denoted as output error and the signal ε 2 (t) as the control error. The transfer matrices P and Q can be viewed as filter operators used for transforming sensor and actuator signals into the desired error signals to be used in the control method. E.g., P could be a filter such that \ (t) represents modal amplitudes. Also, the filter operators can be used to focus on the relevant frequency band of control. Both filter operators P, Q are assumed to be time invariant or slowly time-variant under the authority of a supervisory control layer. The signal y(t|w(t)) stands for the output sensor signal at time t in the case that the controller coefficients w would have been frozen or held constant and equal to w(t) for a period longer than the response time of the system under control. The signal y(t|w(t)) is also referred to as the prediction output signal and can be estimated, e.g. in prediction element 22. A method for providing the prediction output signal has been described in European patent application 94.203 399.4, which is included herein by reference. The signal vector y(t|w(t)) can be written as y(t\w(t)) = d(t) + [H(q- l )Φ τ (t)}. w(t) which can be estimated using the expression If the controller coefficients w(t) are time varying as may occur during adaptation, y(t|w(t)) may differ significantly from the true sensor output y(t). The true sensor output y(t) may be used in equation (5) above, leading to less computational effort at the expense of a higher risk of an unstable control method behaviour. The overall error signal ε is given by the conjunction of the two, yielding ε(t)= [ ε ι (t) ε 2 (t)] τ (6) A criterion function may be defined as the time averaged expectation of a weighted mixture of the output error energy and the control error energy: The MxM matrix K is diagonal with nonnegative entries κ m . It is used to tune the relative importance of each output error contribution, and therefore, indirectly each sensor signal, through εi in the criterion function J. The LxL matrix A is diagonal with nonnegative entries λi. It is used to tune the relative importance of each control error contribution, and therefore, indirectly each actuator signal, through ε 2 in the criterion function J. The matrices K and A are selected off-line in order to create the desired weighting of error signals. Specifically, this may imply: • K can be tuned such that selected output error signals have a higher weight than others in the criterion function. • Specific values on the entries of A can be set to limit the driving signals to the control actuators 2, such that the solution of criterion function (7) has: a) a certain performance and b) a limited driving level to each of the actuators 2 which require such a restriction, for instance to prevent non-linear behaviour or damaging of the actuator 2. • A can be tuned versus K in order to have the desired balance between performance at the output sensors 4 and required control effort. Generally, it holds that the bigger the values in A the higher the system's robustness at the expense of performance at the output sensors 4 and vice versa. The off-line design of K and A may serve well for stationary conditions. In that case there is no need to adapt K and A during control. The power of the criterion function (7) however, is that in the case of system variations K and A can be adjusted to maintain the desired control behaviour. Changes in for instance the transfer matrix H or the frequency contents of z may call for another setting of the κ's and λ's in the weighting matrices. This tuning can be taken care of by a supervisory control layer, possibly trained extensively beforehand. A straightforward example of one of the many functionalities of such a supervisory layer can be found in S.J.Elliott and K.H. Baek, "Effort constraints in adaptive feedforward control", IEEE Signal Processing Letters, 1996, 3, pp 7-9, where the λ's are tuned online in such a way that actuator driving levels do not exceed a given threshold. As stated before this threshold may have been set to avoid non-linear actuator behaviour but it may also be effective to avoid control instability. If for example the characteristics of the system under control H vary with time and do not longer correspond to the nominal model, control instability may occur. By raising the right values in A the supervisory control layer may prevent this instability at the expense of reduced performance at the output sensors 4. In conclusion it should be kept in mind that although K and A are tuned off-line and fixed - denoted as K(0) and Λ(0) - a supervisory control layer may adjust their values yielding time variant weight characteristics: K(t) and Λ(t). The object of the present control system is to minimise the criterion function J. This is achieved by recursively updating the controller coefficients proportional to the sum of (weighted) instantaneous error signals ε^t) and ε 2 (t). This is indicated in Fig. 2 by the processing block 18, transforming the output signal vector ε^t), the processing block 20, transforming the control error signal vector ε 2 (t) and update element 20, updating the coefficients w(t) of controller 6. In mathematical terms, this can be expressed as: w(t + 1) = w(t) - γ(t)[F x (q ~l , t)K(t)ε x (t) + F 2 (q ~l , t)N(t)ε 2 (t)] (8) in which F x and F 2 are time-variant rational matrices of dimensions LNIxM and LNIxL, respectively which control the feedback of errors ε t and ε 2 to the controller coefficients w(t). The parameter γ(t) is a positive scalar which can be used to tune the rate of convergence. Usually, it is made time variant to establish convergence in stationary conditions (small γ) and to allow tracking in non-stationary conditions (high γ). Also for this adaptation, a supervisory control layer may be used to anticipate (external) conditions. The update algorithm, as defined in equation (8), is based on the principle that the controller parameters are adjusted in a way proportional to the observed errors ε t and ε 2 . A stationary point of the algorithm occurs when the mean update equals zero, which leads to the condition: E{F X (t)K(t)Py(t) + F 2 (t)K(t)Qu(t)} = 0 (9) Inserting the equations for y(t) and u(t) for stationary w renders Ε{F, (t)K(t)P[d(t) + HΦ τ (t)w] + F 2 (t)A(t)QΦ τ (t)w}= 0 (10) from which an expression for the stationary point of the update algorithm can be derived: Etø (t)K(t)Pd(t)} = -Etø (t)K(t)PHΦ τ (t) + F 2 (t)Λ(t)QΦ τ (t)}w ∞ (11) where w ∞ denotes the stationary point of the controller parameter vector. A crucial point is the convergence speed of the algorithm towards the final solution w ∞ . The expected rate of convergence can be evaluated as E{w(t + 1)} = E{w(t)} - γ Efc (t)K(t)Pd(t) + F, (t)K(t)PHΦ τ (t) + F 2 (t)A(t)QΦ τ (t)]w(t)} = E{w(t)} - γ E{F, (t)K(t)PHΦ τ (t) + F 2 (t)Λ(t)QΦ τ (t)}E{ (t) - w ∞ } (12) Subtracting w ∞ from both sides and denoting w" as the parameter error vector - w~= w - w ∞ , we arrive at E{iv(t + 1)} = E{/ - γ(t)[F x (t)K(t)PH τ (t) + F 2 (t)A(t)QΦ τ (t)]}E{w(t)} (13) and in short-hand notation E{w(t + 1)} = (I - γ(t)A(t)) E{w(t)} (14) where A = E{F,(t) (t) , (t) + F 2 (t)A(^ 2 (t)}, with Ψ j (t)= PHΦ τ (t) and Ψ 2 (t) = QΦ τ (t) . Equation (14) is a recursive expression for the convergence behaviour of the controller parameter error vector. It is a stable recursion if all eigenvalues of the 'gain matrix' I-γA have a norm smaller than 1; see e.g., G. Strang, "Linear algebra and its applications", Academic Press, 1980, page 202. This means that each eigenvalue of A has to meet the condition: |l-γ eig(A]| < l (15) Realising that the scalar γ is positive this implies for the real part of the eigenvalues of A: Re{eig(A)} > 0 (16) If this condition holds, γ can be scaled such that also condition (15) is obeyed. Parameter γ has to be limited in order to neutralise the effect of the large eigenvalues of A with respect to stability. This, however, slows down the convergence of the modes of A corresponding to small eigenvalues. In other words: the eigenvalue spread in A seriously influences the convergence speed of the recursion (14). This is treated in more detail in for instance S.J. Elliott et al. "The behaviour of a multiple channel active control system", IEEE transactions on signal processing, 40, 1992, pp. 1041-1052. Now by selecting special structures for the update matrices F^t) and F 2 (t) the stability condition (16) is met and moreover the eigenvalue spread of A is minimised. It is know from linear algebra that a real matrix of the form B T B is positive semi-definite, having real, nonnegative eigenvalues. Therefore by letting (K(t)Ψι(t)) τ be part of F^t) and (Λ(t)Ψ 2 (t)) T be part of F 2 (t), matrix A becomes positive semi-definite. Furthermore, the eigenvalues of A can be equalised by selecting the following structure for F x and F 2 : F 1 (t) = F 3 "1 (κ(t)Ψ 1 (t)) T ; F 2 (t) = F 3 - 1 (Λ(t)Ψ 2 (t)) τ with F 3 = E{ψ, τ (t)K T (t)K(t)Ψ, (t) + Ψ 2 T (t)Λ τ (t)Λ(t)Ψ 2 (t)} (17) This specific choice yields A = I and the convergence equation (14) becomes E{w(t + l)} = (l - γ(t))E{w(t)} (18) This means that each filter coefficient has the same rate of convergence. In conclusion update matrices F : and F 2 are chosen such that: • the eigenvalues of A are such that the recursive equation is stable and E{ "(t)} → 0 ; the parameter error vanishes. • the eigenvalue spread of A is minimised (the eigenvalues are equalised), thus allowing optimal convergence and tracking speed. • the stationary point of the update equals the optimum of the criterion function (7) if H can be estimated sufficiently accurate and if γ(t) is vanishing for t-→∞. The implementation of the optimal 'feedback' transfer matrices Fi and F to have convergence rate equalisation requires the following: • calculation of Ψi and Ψ , with P, Q, K and A given, H(q _1 ) estimated off-line and Φ τ measured each sample instant. • Calculation and inversion of F 3 . The inversion of LNIxLNI matrix F 3 usually demands high computational effort, especially when it is part of a real-time update algorithm. To deal with this the following conditions and implementations can be discerned: The first case relates to stationary conditions. Before control, F 3 can be computed, inverted and stored in memory afterwards. For stationary conditions K and A will be held constant (K(t) = K(0), Λ(t)=Λ(0)) and F 3 and its inverse do not need to be updated. Note that in this case the total computational demand is equal to algorithms that lack the convergence rate equalisation, as for instance described in S.J. Elliott et al. "The behaviour of a multiple channel active control system", IEEE transactions on signal processing, 40, 1992, pp. 1041-1052. The second case relates to non-stationary conditions. In this case the supervisory layer may decide to adjust the weights in K and/or A such as to maintain the desired system behaviour. In that case F 3 and its inverse needs to be updated to maintain the convergence rate equalisation characteristic. Since K and A are diagonal matrices updating the inverse of F 3 - and so the feedback matrices F \ and F 2 - can be done in a computationally efficient way. The basic idea behind this is that a change in one of the entries of K or A can be regarded as a rank-one change in F 3 . Suppose for instance that K; is adjusted as follows Ki(t)=Ki(t-l)+Δκ,(t). Then the new F 3 (t) can be written as F 3 (t) = F 3 (t - 1) + (t)ΔK(t)Ψ, }= F 3 (t - 1) + E{[ΔK ; (t)ψ B ] τ [ΔK, (t)ψ H ]} where ψ u is the i-th row of matrix Ψj . This is clearly a rank-one update of F 3 for which a wide variety of computationally efficient inversion methods exist. One of these methods is based on the rank-one QR update algorithm see for instance Golub and Nan Loan, "Matrix computations", John Hopkins University Press, 1996.

Claims: CLAIMS 1. Method for controlling a control arrangement controlling a predetermined system, the control arrangement comprising a controller (6), M output sensors (4) providing an output signal vector y(t), L control actuators (2) controlled by a control signal vector u(t) provided by the controller (6) and N reference signal generators (8) for providing a reference signal vector z(t) to the controller (6), L, M, N being positive integers, the output signal vector y(t) being defined as: y(t) - d(t) + H(q 1 )u(t) with: d(t) = a disturbance signal vector of dimension Mxl; H(q _1 ) = a transfer matrix of the predetermined system of dimension MxL in a backward shift operator q "1 ; the control signal vector u(t) being defined as: u(t) = Φ τ (t).w(t) with: Φ τ (t) = a block diagonal matrix of dimension LxLNI built up of L row vectors φ τ , each vector φ τ being the transpose of NIxl vector φ containing the last I samples of the N reference signals z n (t), I being an integer, w(t) = a vector containing all controller coefficients for the controller (6), characterised in that the method comprises the step of minimizing a criterion function J defined as a mixture of energy of an observed output error signal vector ε \ (t) and energy of a control error signal vector ε 2 (t), defined as: with: P(q _1 ) = an MxM dimensional rational weighting matrix of the output sensor signals, Q(q _1 ) = an LxL dimensional rational weighting matrix of the actuator signals, the step of minimising the criterion function J comprising the step of recursively updating the controller coefficients in w(t) proportional to the observed output error signal vector ε! and proportional to the control error signal vector ε 2 . 2. Method according to claim 1, in which the output signal vector ε \ (t) is equal to ει(t) = P(q "1 ) y(t|w(t)), in which y(t|w(t)) is a prediction output signal vector, corresponding to the output signal vector y(t) of the sensors (4) at time t in the case that the controller coefficients w(t) have been held constant for a period longer than a response time of the predetermined system. 3. Method according to claim 1 or 2, in which the contributions to the criterion function J of output error signal vector ε^t) are tuned by nonnegative entries in a matrix K of dimension MxM in the criterion function J and the contributions to the criterion function J of control error signal vector ε 2 (t) are tuned by nonnegative entries in a matrix A of a dimension LxL in the criterion function J, the criterion function being defined as with ε(t) = [ε x (t) ε 2 (t)] τ . 4. Method according to claim 3, in which the tuning of matrices K and A is implemented by a supervisory control layer, adapting the nonnegative entries in matrices K and A in relation to the transfer function H of the predetermined system and the characteristics of the reference signal vector z(t), the output signal vector y(t) and the control signal vector u(t). 5. Method according to one of the preceding claims, in which the controller coefficients in w(t) are recursively updated according to w(t + 1) = w(t) - γ(t)[F x (q ~x , t)K(t)ε (t) + F 2 (q ~l , t)A(t)ε 2 (t)] , in which Fι(q _1 ,t) and F 2 (q "1 ,t) are time-variant rational matrices of dimensions LNIxM and LNIxL, respectively, and γ(t) is a positive scalar used to tune a rate of convergence of the control method. 6. Method according to claim 5 in which F^t) and F 2 (t) have a structure according to \τ F, (t) = F 3 - 1 (κ(t)Ψ 1 (t)) T ; F 2 (t) = F 3 -' (A(t) 2 (t)) T F 3 = E{ψ, τ (t)K T (t)K(t)Ψ 1 (t) + Ψ 2 T (t)Λ τ (t)Λ(t)Ψ 2 (t)} and Ψ x (t) = PHΦ T (t) , Ψ 2 (t) = QΦ T (t) . 7. Method according to claim 6, in which the matrix inversion F 3 _I is calculated off-line, stored in a memory and retrieved when needed. 8. Method according to claim 6 or 7, in which F^t), F 2 (t) and F 3 (t) and its inverse F 3 (t) are tuned simultaneously with the tuning of K and A. 9. Method according to claim 8, in which the inverse of F 3 (t) is updated as function of matrix K and A by using a rank one update algorithm. 10. Method according to one of the claims 3 through 9, in which matrix A is tuned versus matrix K to provide a predetermined balance between performance at the output sensors and required control effort. 11. Method according to one of the claims 3 through 10, in which the values of diagonal entries of matrices A are raised, such that the real parts of the eigenvalues of a matrix A remain greater than zero under changes in H, the matrix A being defined as A = E{F 1 (t)Ψ 1 (t)+ F 2 (t)Ψ 2 (t)}. 12. Method according to one of the claims 3 through 11, in which the control actuator signals u(t) are limited by setting specific values of diagonal entries of matrix A. 13. Method according to one of the claims 3 through 12, in which the nonnegative entries in matrix K are tuned to provide a higher weight to predetermined elements of the output error ε^t). 14. Active vibration suppression system comprising at least one actuator (2) at least one sensor (4) for providing an output signal vector y(t); a controller (6) for providing a control signal vector u(t) to the at least one actuator (2); a reference signal generator (8) for providing at least one reference signal z(t) to the controller (6); and an update unit (12), receiving the output signal vector y(t) and providing a controller coefficient vector w(t) to the controller (6), in which the update unit (12) and controller (6) are arranged to execute the method according to one of the claims 1 through 13. 15. Active sound suppression system comprising at least one actuator (2) at least one sensor (4) for providing an output signal vector y(t); a controller (6) for providing a control signal vector u(t) to the at least one actuator (2); a reference signal generator (8) for providing at least one reference signal z(t) to the controller (6); and an update unit (12), receiving the output signal vector y(t) and providing a controller coefficient vector w(t) to the controller (6), in which the update unit (12) and controller (6) are arranged to execute the method according to one of the claims 1 through 13. 16. Computer program product comprising a program having instructions adapted to carry out the method according to one of the claims 1 through 13 when loaded in a computer. 17. Computer readable medium provided with a computer program according to claim 16.

Inventors: DOELMAN NICOLAAS JAN, DOELMAN, NICOLAAS, JAN
Applicants: DOELMAN NICOLAAS JAN, TNO, DOELMAN, NICOLAAS, JAN, NEDERLANDSE ORGANISATIE VOOR TOEGEPAST-NATUURWETENSCHAPPELIJK ONDERZOEK TNO
Application year: 2000
Main classification: G05B13
IPC codes: G05B13