In this paper a recursive instrumental variable (IV) based subspace identification algorithm is proposed. The basic idea of the algorithm is to utilize the close relationship with sensor array signal processing. Utili...
详细信息
In this paper a recursive instrumental variable (IV) based subspace identification algorithm is proposed. The basic idea of the algorithm is to utilize the close relationship with sensor array signal processing. Utilizing this relationship, an IV based subspace tracking algorithm originally developed for direction of arrival tracking is applied to track the subspace spanned by the observability matrix. The main features of the proposed algorithm are, a) a relatively low computational complexity, and b) the ability to handle colored disturbances that are mutually correlated.
This paper presents a new recursive Newton type algorithm devoted to frequency relaying. The algorithm is designed from the nonrecursive Newton type algorithm and recursive least error squares algorithm. The frequency...
详细信息
This paper presents a new recursive Newton type algorithm devoted to frequency relaying. The algorithm is designed from the nonrecursive Newton type algorithm and recursive least error squares algorithm. The frequency is estimated from the uniformly sampled voltage signal. The algorithm testing based on computer simulated and experimentally obtained data record processing confirmed the good features of the algorithm developed. Due to its computational efficiency, the algorithm is suitable for various real-time power system measurement applications.
Automation of forging processes is important for both safety and efficiency in today's advanced manufacturing operations. This work supports the development of an Intelligent Open Die Forging System which will int...
详细信息
Automation of forging processes is important for both safety and efficiency in today's advanced manufacturing operations. This work supports the development of an Intelligent Open Die Forging System which will integrate state-of-the-arc modelling techniques, automatic die selection and sequencing, full system dynamic simulation, automatic machine programming and coordination, and sensor-based process control to enable the production of more general and complex workpiece geometries than are achievable using current forging methods. Effective automation of this open die forging system requires the coordination and control of the major system components: press, robot, and furnace. In particular, forces exerted on the robot through its manipulation of the workpiece during forging must be minimized to avoid damage to the manipulator mechanism. In this paper, the application of neural networks for compliance control of the forging robot to minimize these forces is investigated. Effectiveness ol the neural network-based compliance control module is evaluated through a full dynamic system simulation, which will later form a central part of the complete Intelligent Forging System. Dynamic simulation of the robot is achieved using an efficient O(N) recursive algorithm, while material flow of the workpiece is modeled with a finite element approach. Simulation and timing results for the complete processing system for a specific open die forging example are presented.
Since the novel work of Berkes and Philipp((3)) much effort has been focused on establishing almost sure invariance principles of the form [GRAPHICS] where {x(i), i=1, 2, 3,...} is a sequence of random vectors and {X(...
详细信息
Since the novel work of Berkes and Philipp((3)) much effort has been focused on establishing almost sure invariance principles of the form [GRAPHICS] where {x(i), i=1, 2, 3,...} is a sequence of random vectors and {X(t), t greater than or equal to 0} is a Brownian motion. In this note, we show that if {A(k), k=1, 2, 3,...} and {b(k), k=1, 2, 3,...} are processes satisfying almost-sure bounds analogous to Eq. (1), (where {X(t), t greater than or equal to 0} could be a more general Gauss-Markov process) then {h(k), k= 1, 2, 3,...}, the solution of the stochastic approximation or adaptive filtering algorithm h(k+1)=h(k)+1/k(b(k)-A(k)h(k)) for k=1,23,... (2) also satisfies an almost sure invariance principle of the same type.
Many stochastic approximation procedures result in a stochastic algorithm of the form (1) h(k+1) = h(k) + 1/k (b(k) - A(k)h(k)), for all k = 1, 2, 3,.... Here, {b(k), k = 1, 2, 3,...} is a R(d)-valued process, {A(k), ...
详细信息
Many stochastic approximation procedures result in a stochastic algorithm of the form (1) h(k+1) = h(k) + 1/k (b(k) - A(k)h(k)), for all k = 1, 2, 3,.... Here, {b(k), k = 1, 2, 3,...} is a R(d)-valued process, {A(k), k = 1, 2, 3,...} is a symmetric, positive semidefinite Re-dxd-valued process, and {h(k), k = 1, 2, 3,...} is a sequence of stochastic estimates which hopefully converges to (2) h corresponds to [(N - infinity)lim 1/N (k = 1)Sigma(N) EA(k)](-1).{(N --> infinity)lim 1/N (k = 1)Sigma(N) Eb(k)} (assuming everything here Is well defined). In this correspondence, we give an elementary proof which relates the almost sure convergence of {h(k), k = 1, 2, 3,...} to strong laws of large numbers for {b(k), k = 1, 2, 3,...} and {A(k), k = 1, 2, 3,...}.
Envelope-constrained (EC) filtering is to design a finite impulse response filter such that the output of the filter is guaranteed to lie within a prescribed output pulse mask with respect to a given input pulse. The ...
详细信息
Envelope-constrained (EC) filtering is to design a finite impulse response filter such that the output of the filter is guaranteed to lie within a prescribed output pulse mask with respect to a given input pulse. The standard unconstrained least mean squares (LMS) or recursive least squares (RLS) algorithms are not applicable to this kind of adaptive filtering problem coupled with inequality constraints. A new type of recursive algorithms were proposed recently for designing an adaptive EC filter, and the corresponding convergence properties were established. In this paper, it is shown that faster convergence can be achieved by incorporating a simplified line search into the developed recursive algorithms. The modified recursive algorithms are very efficient, and very simple to implement.
We show that there is no primitive recursive algorithm over the natural numbers and lists of natural numbers that computes the minimum of two numbers in time O(min), in call-by-value evaluation order. This is in contr...
详细信息
We show that there is no primitive recursive algorithm over the natural numbers and lists of natural numbers that computes the minimum of two numbers in time O(min), in call-by-value evaluation order. This is in contrast to the call-by-name case.
This paper presents two recursive algorithms for parametric identification in the presence of both, noise and model uncertainties. The estimates provided by these algorithms are not invalidated by the observed input-o...
详细信息
This paper presents two recursive algorithms for parametric identification in the presence of both, noise and model uncertainties. The estimates provided by these algorithms are not invalidated by the observed input-output data and the assumed system and uncertainty structures.
In this note, a robust identification method of non linear systems using the Hammerstein model is presented. The main property of the proposed approach is that parameters of the linear and nonlinear parts are estimate...
详细信息
In this note, a robust identification method of non linear systems using the Hammerstein model is presented. The main property of the proposed approach is that parameters of the linear and nonlinear parts are estimated in a recursive way while the global convergence is guaranted. The proposed method consists first to transform the non linear representation into an input-output model linear in parameters, after, a regular transformation based on the pseudo-inverse technique allows us to estimate in the least squares sense parameters vector of the original realization. For the case of correlated noise, to model measurement disturbances, we propose a simple technique based on the pseudo-linear regression method and we investigate all parameters dependencies to obtain a consistent solution. Sufficient conditions for global convergence are derived. Two numerical examples with different correlation structures and different Signal to Noise Ratio values are provided.
A lossless divide-and-conquer (D&C) principle, implemented via an orthogonality projection, is described and illustrated with a recursive solution of the Traveling Salesman Problem (TSP), which is executable on a ...
详细信息
A lossless divide-and-conquer (D&C) principle, implemented via an orthogonality projection, is described and illustrated with a recursive solution of the Traveling Salesman Problem (TSP), which is executable on a massively parallel and distributed computer. The lossless D&C principle guides us to look near the desirable boundary and to seek for a characteristic vector V (e.g. displacement vector in TSP) such that V approximate to A + B where two resultant vectors A and B (located one in each sub-domains to be divided) should be orthogonal to each other having no cross product terms, i.e. (A, B) = (B, A) = 0. In the case of parallel computing this goal amounts to minimum communication cost among processors. Then the global optimization of the whole domain: Min. \\V\\(2) = Min. \\A\\(2) + Min. \\B\\(2) can be losslessly divided into two sub-domains that each can seek its own optimized solution separately (by two separate sets of processors without inter-communication during processing). Such a theorem of orthogonal division error (ODE) for lossless D&C is proved, and the orthogonal projection is constructed for solving a large-scale TSP explicitly.
暂无评论