541 research outputs found

    Gradient-based iterative parameter estimation for bilinear-in-parameter systems using the model decomposition technique

    Get PDF
    The parameter estimation issues of a block-oriented non-linear system that is bilinear in the parameters are studied, i.e. the bilinear-in-parameter system. Using the model decomposition technique, the bilinear-in-parameter model is decomposed into two fictitious submodels: one containing the unknown parameters in the non-linear block and the other containing the unknown parameters in the linear dynamic one and the noise model. Then a gradient-based iterative algorithm is proposed to estimate all the unknown parameters by formulating and minimising two criterion functions. The stochastic gradient algorithms are provided for comparison. The simulation results indicate that the proposed iterative algorithm can give higher parameter estimation accuracy than the stochastic gradient algorithms

    Parameter estimation algorithm for multivariable controlled autoregressive autoregressive moving average systems

    Get PDF
    This paper investigates parameter estimation problems for multivariable controlled autoregressive autoregressive moving average (M-CARARMA) systems. In order to improve the performance of the standard multivariable generalized extended stochastic gradient (M-GESG) algorithm, we derive a partially coupled generalized extended stochastic gradient algorithm by using the auxiliary model. In particular, we divide the identification model into several subsystems based on the hierarchical identification principle and estimate the parameters using the coupled relationship between these subsystems. The simulation results show that the new algorithm can give more accurate parameter estimates of the M-CARARMA system than the M-GESG algorithm

    Least squares-based iterative identification methods for linear-in-parameters systems using the decomposition technique

    Get PDF
    By extending the least squares-based iterative (LSI) method, this paper presents a decomposition-based LSI (D-LSI) algorithm for identifying linear-in-parameters systems and an interval-varying D-LSI algorithm for handling the identification problems of missing-data systems. The basic idea is to apply the hierarchical identification principle to decompose the original system into two fictitious sub-systems and then to derive new iterative algorithms to estimate the parameters of each sub-system. Compared with the LSI algorithm and the interval-varying LSI algorithm, the decomposition-based iterative algorithms have less computational load. The numerical simulation results demonstrate that the proposed algorithms work quite well

    Employing data fusion & diversity in the applications of adaptive signal processing

    Get PDF
    The paradigm of adaptive signal processing is a simple yet powerful method for the class of system identification problems. The classical approaches consider standard one-dimensional signals whereby the model can be formulated by flat-view matrix/vector framework. Nevertheless, the rapidly increasing availability of large-scale multisensor/multinode measurement technology has render no longer sufficient the traditional way of representing the data. To this end, the author, who from this point onward shall be referred to as `we', `us', and `our' to signify the author myself and other supporting contributors i.e. my supervisor, my colleagues and other overseas academics specializing in the specific pieces of research endeavor throughout this thesis, has applied the adaptive filtering framework to problems that employ the techniques of data diversity and fusion which includes quaternions, tensors and graphs. At the first glance, all these structures share one common important feature: invertible isomorphism. In other words, they are algebraically one-to-one related in real vector space. Furthermore, it is our continual course of research that affords a segue of all these three data types. Firstly, we proposed novel quaternion-valued adaptive algorithms named the n-moment widely linear quaternion least mean squares (WL-QLMS) and c-moment WL-LMS. Both are as fast as the recursive-least-squares method but more numerically robust thanks to the lack of matrix inversion. Secondly, the adaptive filtering method is applied to a more complex task: the online tensor dictionary learning named online multilinear dictionary learning (OMDL). The OMDL is partly inspired by the derivation of the c-moment WL-LMS due to its parsimonious formulae. In addition, the sequential higher-order compressed sensing (HO-CS) is also developed to couple with the OMDL to maximally utilize the learned dictionary for the best possible compression. Lastly, we consider graph random processes which actually are multivariate random processes with spatiotemporal (or vertex-time) relationship. Similar to tensor dictionary, one of the main challenges in graph signal processing is sparsity constraint in the graph topology, a challenging issue for online methods. We introduced a novel splitting gradient projection into this adaptive graph filtering to successfully achieve sparse topology. Extensive experiments were conducted to support the analysis of all the algorithms proposed in this thesis, as well as pointing out potentials, limitations and as-yet-unaddressed issues in these research endeavor.Open Acces

    Partially coupled gradient estimation algorithm for multivariable equation-error autoregressive moving average systems using the data filtering technique

    Get PDF
    System identification provides many convenient and useful methods for engineering modelling. This study targets the parameter identification problems for multivariable equation-error autoregressive moving average systems. To reduce the influence of the coloured noises on the parameter estimation, the data filtering technique is adopted to filter the input and output data, and to transform the original system into a filtered system with white noises. Then the filtered system is decomposed into several subsystems and a filtering-based partially-coupled generalised extended stochastic gradient algorithm is developed via the coupling concept. In contrast to the multivariable generalised extended stochastic gradient algorithm, the proposed algorithm can give more accurate parameter estimates. Finally, the effectiveness of the proposed algorithm is well demonstrated by simulation examples

    State filtering and parameter estimation for two input two output systems with time delay

    Get PDF
    This paper focuses on presenting a new identification algorithm to estimate the parameters and state variables for two-input two-output dynamic systems with time delay based on canonical state space models. First, the related input-output equation is determined and transformed into an identification oriented model, which does not involve in the unmeasurable states, and then a residual based least squares identification algorithm is presented for the estimations. After the parameters being estimated, the system states are subsequently estimated by using the estimated parameters. Through theoretical analysis, the convergence of the algorithm is derived to provide assurance for applicability. Finally, a selected simulation example is given for a meaningful case study to show the effectiveness of the proposed algorithm

    State filtering-based least squares parameter estimation for bilinear systems using the hierarchical identification principle

    Get PDF
    This study presents a combined parameter and state estimation algorithm for a bilinear system described by its observer canonical state-space model based on the hierarchical identification principle. The Kalman filter is known as the best state filter for linear systems, but not applicable for bilinear systems. Thus, a bilinear state observer (BSO) is designed to give the state estimates using the extremum principle. Then a BSO-based recursive least squares (BSO-RLS) algorithm is developed. For comparison with the BSO-RLS algorithm, by dividing the system into three fictitious subsystems on the basis of the decomposition–coordination principle, a BSO-based hierarchical least squares algorithm is proposed to reduce the computation burden. Moreover, a BSO-based forgetting factor recursive least squares algorithm is presented to improve the parameter tracking capability. Finally, a numerical example illustrates the effectiveness of the proposed algorithms

    Development and identification of hierarchical nonlinear mixed effects models for the analysis of dynamic systems: identification and application of hierarchical nonlinear mixed effects models for the determination of steady-state and dynamic torque responses of an SI engine

    Get PDF
    Multi-level or hierarchical models present various features for dealing with data grouped at several levels. The majority of applications of hierarchical models use clustered data that is static in nature and collected over a long period of time. The purpose of this study is investigating hierarchical models for application with highly dynamic systems. Steady-state data are conventionally employed for engine torque mapping purposes. The data takes much time to collect and the dynamics of the system are routinely ignored. This valuable information could be used for better control of the system.In this study, an innovative transient spark-sweep approach is developed for collecting dynamic torque data more efficiently. The means of data collection implies a structure for which a multi-level model is best suited. A multi-model augmented D-optimal design is created, and the experimental data collected. Spark excitation is applied at speed/load points using Amplitude Modulated Pseudo Random Signal (AMPRS), and the torque response over the operating space is thus obtained. Conditional first-order linearization is used within the identification process for determining the hierarchical model parameters. The level-1 Nonlinear Auto Regressive eXogenous (NARX) models are separately determined using an Iterative Generalized Least Square (IGLS) method and the results are employed for initialisation of the covariance matrix and the model level-2 parameters. A novel gradient optimiser was established to facilitate the dynamic hierarchical model identification. Additionally, the uncertainty associated with model selection was mitigated using a multi-model approach. The model identified is evaluated and compared with experimental dynamic and steady-state data. It shows behaviour, both dynamic and steady state, providing prediction over a wider extrapolated spark range than conventional approaches. The new approach is eight time faster than current state-of-the-art approaches.</div
    • …
    corecore