Showing papers by "Michel Gevers published in 1990"
TL;DR: In this article, the sensitivity and the roundoff noise gain of the closed-loop transfer function of a system when the state estimate feedback controller is implemented with a finite word length and when the computations are performed in finite precision are derived.
Abstract: Expressions are derived for the sensitivity and the roundoff noise gain of the closed-loop transfer function of a system when the state estimate feedback controller is implemented with a finite word length and when the computations are performed in finite precision. This allows one to compare the sensitivity and noise gain over all equivalent state-variable implementations of the observer plus controller. The set of state-space models minimizing either the sensitivity or the roundoff noise gain is computed. Simulations compare the performance of the optimal implementations with respect to companion forms and a particular delta model. >
77 citations
TL;DR: An expert system for the identification of linear multiple input single output systems in ARARX form, written with the OPS83 rule-based programming language, is presented, showing that the expert system behaves as well as human experts, with considerable savings in time.
58 citations
TL;DR: In this article, Generalized Predictive Control (GPC) is a special case of Receding Horizon Linear Quadratic Optimal Control (LQ) with a view to assessing those of GPC.
21 citations
TL;DR: In this paper, the authors investigate the interconnection between the selection of the control law and the consequent achieved closed loop input signal spectrum presented to the plant and the implied closed loop identification frequency weighting.
9 citations
05 Dec 1990
TL;DR: In this paper, the estimation of time-invariant transfer functions in a deterministic set-up and under the typical situation where the true system has a transfer function that is more complex than the parametrized model transfer function is considered.
Abstract: The author considers the estimation of time-invariant transfer functions in a deterministic set-up and under the typical situation where the true system has a transfer function that is more complex than the parametrized model transfer function. It is shown that, depending on whether the numerator or the denominator of the transfer function model is chosen to be monic, the corresponding least squares estimate will be overbiased or underbiased, in a frequency weighted sense. >
5 citations
TL;DR: In this article, the sensitivity and the roundoff noise gain of the closed loop transfer function of a system with a state estimate feedback controller with a finite word length and when the computations are performed in finite precision are derived.
1 citations
05 Dec 1990
TL;DR: It is shown that identification exercises can effectively be based on variants of the branch-and-bound procedure and that only an easily computable admissible heuristic evaluation function is missing for one to have a true A* procedure.
Abstract: Ways in which advanced search methodologies from artificial intelligence and integer programming can contribute to solve the identification problem are investigated. Several such methods are reviewed, along with techniques that are introduced to increase their efficiency. It is shown that identification exercises can effectively be based on variants of the branch-and-bound procedure and that only an easily computable admissible heuristic evaluation function is missing for one to have a true A* procedure. The major innovation introduced is that a quick exploration of the state space can be made by mapping it at equidistant model structures by adding or deleting many more than one parameter at a time. This method, combined with the use of statistical tests, gives valuable information on subsets in which the best model structure should be searched for and also saves considerable computer time. Once a smaller subset that most probably contains the best model has been identified, it can be mapped in turn at a lower scale and so on until a solution has been found. The typical performances of the branch-and-bound procedure are illustrated on both simulated and industrial data. >
1 citations