923 research outputs found

    Decomposition-based recursive least squares identification methods for multivariate pseudo-linear systems using the multi-innovation

    Get PDF
    © 2018 Informa UK Limited, trading as Taylor & Francis Group. This paper studies the parameter estimation algorithms of multivariate pseudo-linear autoregressive systems. A decomposition-based recursive generalised least squares algorithm is deduced for estimating the system parameters by decomposing the multivariate pseudo-linear autoregressive system into two subsystems. In order to further improve the parameter accuracy, a decomposition based multi-innovation recursive generalised least squares algorithm is developed by means of the multi-innovation theory. The simulation results confirm that these two algorithms are effective

    Robust Singular Smoothers For Tracking Using Low-Fidelity Data

    Full text link
    Tracking underwater autonomous platforms is often difficult because of noisy, biased, and discretized input data. Classic filters and smoothers based on standard assumptions of Gaussian white noise break down when presented with any of these challenges. Robust models (such as the Huber loss) and constraints (e.g. maximum velocity) are used to attenuate these issues. Here, we consider robust smoothing with singular covariance, which covers bias and correlated noise, as well as many specific model types, such as those used in navigation. In particular, we show how to combine singular covariance models with robust losses and state-space constraints in a unified framework that can handle very low-fidelity data. A noisy, biased, and discretized navigation dataset from a submerged, low-cost inertial measurement unit (IMU) package, with ultra short baseline (USBL) data for ground truth, provides an opportunity to stress-test the proposed framework with promising results. We show how robust modeling elements improve our ability to analyze the data, and present batch processing results for 10 minutes of data with three different frequencies of available USBL position fixes (gaps of 30 seconds, 1 minute, and 2 minutes). The results suggest that the framework can be extended to real-time tracking using robust windowed estimation.Comment: 9 pages, 9 figures, to be included in Robotics: Science and Systems 201

    Recursive search-based identification algorithms for the exponential autoregressive time series model with coloured noise

    Get PDF
    This study focuses on the recursive parameter estimation problems for the non-linear exponential autoregressive model with moving average noise (the ExpARMA model for short). By means of the gradient search, an extended stochastic gradient (ESG) algorithm is derived. Considering the difficulty of determining the step-size in the ESG algorithm, a numerical approach is proposed to obtain the optimal step-size. In order to improve the parameter estimation accuracy, the authors employ the multi-innovation identification theory to develop a multi-innovation ESG (MI-ESG) algorithm for the ExpARMA model. Introducing a forgetting factor into the MI-ESG algorithm, the parameter estimation accuracy can be further improved. With an appropriate innovation length and forgetting factor, the variant of the MI-ESG algorithm is effective to identify all the unknown parameters of the ExpARMA model. A simulation example is provided to test the proposed algorithms

    Neuro-fuzzy identification of an internal combustion engine

    Get PDF
    Dynamic modeling and identification of an internal combustion engine (ICE) model is presented in this paper. Initially, an analytical model of an internal combustion engine simulated within SIMULINK environment is excited by pseudorandom binary sequence (PRBS) input. This random signals input is chosen to excite the dynamic behavior of the system over a large range of frequencies. The input and output data obtained from the simulation of the analytical model is used for the identification of the system. Next, a parametric modeling of the internal combustion engine using recursive least squares (RLS) technique within an auto-regressive external input (ARX) model structure and a nonparametric modeling using neuro-fuzzy modeling (ANFIS) approach are introduced. Both parametric and nonparametric models verified using one-step-ahead (OSA) prediction, mean squares error (MSE) between actual and predicted output and correlation tests. Although both methods are capable to represent the dynamic of the system very well, it is demonstrated that ANFIS gives better prediction results than RLS in terms of mean squares error achieved between the actual and predicted signals

    Microprocessor based signal processing techniques for system identification and adaptive control of DC-DC converters

    Get PDF
    PhD ThesisMany industrial and consumer devices rely on switch mode power converters (SMPCs) to provide a reliable, well regulated, DC power supply. A poorly performing power supply can potentially compromise the characteristic behaviour, efficiency, and operating range of the device. To ensure accurate regulation of the SMPC, optimal control of the power converter output is required. However, SMPC uncertainties such as component variations and load changes will affect the performance of the controller. To compensate for these time varying problems, there is increasing interest in employing real-time adaptive control techniques in SMPC applications. It is important to note that many adaptive controllers constantly tune and adjust their parameters based upon on-line system identification. In the area of system identification and adaptive control, Recursive Least Square (RLS) method provide promising results in terms of fast convergence rate, small prediction error, accurate parametric estimation, and simple adaptive structure. Despite being popular, RLS methods often have limited application in low cost systems, such as SMPCs, due to the computationally heavy calculations demanding significant hardware resources which, in turn, may require a high specification microprocessor to successfully implement. For this reason, this thesis presents research into lower complexity adaptive signal processing and filtering techniques for on-line system identification and control of SMPCs systems. The thesis presents the novel application of a Dichotomous Coordinate Descent (DCD) algorithm for the system identification of a dc-dc buck converter. Two unique applications of the DCD algorithm are proposed; system identification and self-compensation of a dc-dc SMPC. Firstly, specific attention is given to the parameter estimation of dc-dc buck SMPC. It is computationally efficient, and uses an infinite impulse response (IIR) adaptive filter as a plant model. Importantly, the proposed method is able to identify the parameters quickly and accurately; thus offering an efficient hardware solution which is well suited to real-time applications. Secondly, new alternative adaptive schemes that do not depend entirely on estimating the plant parameters is embedded with DCD algorithm. The proposed technique is based on a simple adaptive filter method and uses a one-tap finite impulse response (FIR) prediction error filter (PEF). Experimental and simulation results clearly show the DCD technique can be optimised to achieve comparable performance to classic RLS algorithms. However, it is computationally superior; thus making it an ideal candidate technique for low cost microprocessor based applications.Iraq Ministry of Higher Educatio

    All-adaptive blind matched filtering for the equalization and identification of multipath channels: a practical approach

    Get PDF
    Blind matched filter receiver is advantageous over the state-of-the-art blind schemes due the simplicity in its implementation. To estimate the multipath communication channels, it uses neither any matrix decomposition methods nor statistics of the received data higher than the second order ones. On the other hand, the realization of the conventional blind matched filter receiver requires the noise variance to be estimated and the equalizer parameters to be calculated in state-space with relatively costly matrix operations. In this paper, a novel architecture is proposed to simplify a potential hardware implementation of the blind matched filter receiver. Our novel approach transforms the blind matched filter receiver into an all-adaptive format which replaces all the matrix operations. Furthermore, the novel design does not need for any extra step to estimate the noise variance. In this paper we also report on a comparative channel equalization and channel identification scenario, looking into the performances of the conventional and our novel all-adaptive blind matched filter receiver through simulations
    corecore