The problem of adaptively controlling a linear multivariable plant according to a quadratic cost functional defined over a control horizon of arbitrary length is discussed. In this context, the proposed algorithm, ref...
详细信息
The problem of adaptively controlling a linear multivariable plant according to a quadratic cost functional defined over a control horizon of arbitrary length is discussed. In this context, the proposed algorithm, referred to by the acronym MUSMAR, is shown to be a natural generalization of standard self-tuning controllers. By increasing the control horizon length, the MUSMAR closely approximates a steady-state LQG controller inheriting the intrinsic robustness of LQG design. Analysis and simulations give evidence of several attractive features of the MUSMAR self-tuner when applied to plants for which standard adaptive controllers fail to converge or yield an unacceptable performance.
Three parameter motion model can better describe the motion trajectory of picture element in video sequence. Combining the features of block process and recursive estimation, a block recursive algorithm is proposed to...
详细信息
Three parameter motion model can better describe the motion trajectory of picture element in video sequence. Combining the features of block process and recursive estimation, a block recursive algorithm is proposed to calculate these three motion parameters with compensating the variety of block position to get better stability. To get the simplification requirement for hardware implementation, the representation accuracy of displaced frame difference and gradient that are given is analyzed, From these analysis we propose a quantized block recursive algorithm with quantized grandient to reduce the computational complexity. With this simplification the quantized motion estimation algorithm could get sufficient computational speed to meet the requirement of real time application with the least accuracy loss.
This paper is concerned with an iterative learning control law which enables us to find a control input that generates the desired output exactly over a finite time interval through the repetition of trials. We derive...
详细信息
This paper is concerned with an iterative learning control law which enables us to find a control input that generates the desired output exactly over a finite time interval through the repetition of trials. We derive a sufficient condition for nonlinear systems to achieve the desired output by the iterative learning control. Based on this result, we show that the direct transmission term of the plant plays a crucial role in the error convergence of the learning process. Further, we identify the class of plants to which the learning control law is applicable.
Methods based on the Fourier technique are widely used for real-time determination of the basic waveforms of signals. The paper presents possibilities for the recursive implementation of these methods. recursive algor...
详细信息
Methods based on the Fourier technique are widely used for real-time determination of the basic waveforms of signals. The paper presents possibilities for the recursive implementation of these methods. recursive algorithms have the same properties (frequency characteristics, response time) as nonrecursive ones, but they reduce the time of calculation very efficiently. The methods presented can be applied to the control and protection of electrical power systems.
In this paper we consider a special class of linear control systems represented by the standard singularly perturbed system matrix and with the control input matrix having three different nonstandard forms. Many real ...
详细信息
In this paper we consider a special class of linear control systems represented by the standard singularly perturbed system matrix and with the control input matrix having three different nonstandard forms. Many real systems (such as hydropower plants, systems with only few actuators) possess the control structure studied in this paper. The obtained results are quite simplified (comparing to the standard singularly perturbed control systems), and in one case the optimal solution of the algebraic Riccati equation is completely determined in terms of the reduced-order algebraic Lyapunov equations. The proposed method is successfully applied to the reduced-order design of optimal controllers for the real hydropower plant of the Serbian power system.
作者:
MOORE, JBBOEL, RKDepartment of Systems Engineering
Research School of Physical Sciences Australian National University Canberra ACT 2601 Australia Visiting Research Fellow (NFWO)
Department of Systems Engineering Research School of Physical Sciences Australian National University on leave from an NFWO (Belgium National Foundation for Scientific Research) Research Fellow position at the Rijksuniversiteit Gent Belgium
The challenge taken up in this paper is to devise a parameter identification algorithm for linear, discrete-time, stochastic plants which exploits the strengths of both the extended least squares (ELS) and the recursi...
详细信息
The challenge taken up in this paper is to devise a parameter identification algorithm for linear, discrete-time, stochastic plants which exploits the strengths of both the extended least squares (ELS) and the recursive prediction error (RPE) parameter estimation methods. The focus is on adaptive control of parameterized state space models which exploit a priori plant information in that the unknown parameter vector θ r is of lower dimension than that for a corresponding input-output model parameterized by θ. A triple parameter estimation scheme consisting of ELS, RPE and a hybrid of the two, denoted HPE, is proposed. The purpose of the HPE scheme is to permit information flow from the ELS to RPE algorithms so as to effectively project RPE into a stability domain, and to have it avoid local prediction error index minima that are not the global minimum.
In this paper five different recursive identification methods will be analyzed and compared, namely recursive versions of the least squares method, the instrumental variable method, the generalized least squares metho...
详细信息
In this paper five different recursive identification methods will be analyzed and compared, namely recursive versions of the least squares method, the instrumental variable method, the generalized least squares method, the extended least squares method and the maximum likelihood method. They are shown to be similar in structure and need of computer storage and time. Making use of recently developed theory for asymptotic analysis of recursive stochastic algorithms, these methods are examined from a theoretical viewpoint. Possible convergence points and their global and local convergence properties are studied. The theoretical analysis is illustrated and supplemented by simulations.
We investigate the problem of translating expressions optimally, i.e. such that at running time they need as few memory cells as possible and that they can be evaluated fast. An efficient (recursive) algorithm is pres...
详细信息
We investigate the problem of translating expressions optimally, i.e. such that at running time they need as few memory cells as possible and that they can be evaluated fast. An efficient (recursive) algorithm is presented (there is always one based on “trial and error”-methods) for the case of independent inputs and operators to an expression. This includes the case that the result of an operation needs not only one but an arbitrary nonnegative number of auxiliary memory cells which may be determined at compile-t
Hidden Markov models (HMMs) are flexible, well-established models useful in a diverse range of applications. However, one potential limitation of such models lies in their inability to explicitly structure the holding...
详细信息
Hidden Markov models (HMMs) are flexible, well-established models useful in a diverse range of applications. However, one potential limitation of such models lies in their inability to explicitly structure the holding times of each hidden state. Hidden semi-Markov models (HSMMs) are more useful in the latter respect as they incorporate additional temporal structure by explicit modelling of the holding times. However, HSMMs have generally received less attention in the literature, mainly due to their intensive computational requirements. Here a Bayesian implementation of HSMMs is presented. recursive algorithms are proposed in conjunction with Metropolis-Hastings in such a way as to avoid sampling from the distribution of the hidden state sequence in the MCMC sampler. This provides a computationally tractable estimation framework for HSMMs avoiding the limitations associated with the conventional EM algorithm regarding model flexibility. Performance of the proposed implementation is demonstrated through simulation experiments as well as an illustrative application relating to recurrent failures in a network of underground water pipes where random effects are also included into the HSMM to allow for pipe heterogeneity.
There exist many problems regarding process control in the process industry since some of the important variables cannot be measured online. This problem can be significantly solved by estimating these difficult-tomea...
详细信息
There exist many problems regarding process control in the process industry since some of the important variables cannot be measured online. This problem can be significantly solved by estimating these difficult-tomeasure process variables. In doing so, the estimator is in fact an appropriate mathematical model of the process which, based on information about easy-to-measure process variables, estimates the current value of the difficultto-measure variable. Since processes are usually time-varying, the precision of the estimation based on the process model which is built on old data is decreasing over time. To avoid estimator accuracy degradation, model parameters should be continuously updated in order to track process behavior. There are a couple of methods available for updating model parameters depending on the type of process model. In this paper, PLSR process model is chosen as the basis of the difficult-to-measure process variable estimator while its parameters are updated in several ways - by the moving window method, recursive NIPALS algorithm, recursive kernel algorithm and Just-in-Time learning algorithm. Properties of these adaptive methods are explored on a simulated example. Additionally, the methods are analyzed in terms of computational load and memory requirements.
暂无评论