Subspace algorithms for the stochastic identification problem,
نویسندگان
چکیده
A new subspace algorithm consistently identifies stochastic state space models directly from given output data, using only semi-infinite block Hankel matrices. Ala~raet-In this paper, we derive a new subspace algorithm to consistently identify stochastic state space models from given output data without forming the covariance matrix and using only semi-infinite block Hankel matrices. The algorithm is based on the concept of principal angles and directions. We describe how they can be calculated with QR and Quotient Singular Value Decomposition. We also provide an interpretation of the principal directions as states of a non-steady state Kalman filter bank.
منابع مشابه
Nonlinear System Identification Using Hammerstein-Wiener Neural Network and subspace algorithms
Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsyst...
متن کاملSubspace system identification
We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملExperimental Evidence Showing That Stochastic Subspace Identification Methods May Fail*
It is known that certain popular stochastic subspace identification methods may fail for theoretical reasons related to positive realness. In fact, these algorithms are implicitly based on the assumption that the positive and algebraic degrees of a certain estimated covariance sequence coincide. In this paper, we describe how to generate data with the property that this condition is not satisfi...
متن کاملStochastic theory of continuous-time state-space identification
This paper presents theory, algorithms, and validation results for system identification of continuous-time statespace models from finite input–output sequences. The algorithms developed are methods of subspace model identification and stochastic realization adapted to the continuous-time context. The resulting model can be decomposed into an input–output model and a stochastic innovations mode...
متن کاملA stochastic model for project selection and scheduling problem
Resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. In this study, budget, investment costs and earnings are considered to be stochastic. The objectives are maximizing net present values of selected projects and minimizing v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 29 شماره
صفحات -
تاریخ انتشار 1993