Abstract

A Gauss process state-space model trained in a laboratory cannot accurately simulate a nonlinear system in a non-laboratory environment. To solve this problem, a novel Gauss process state-space model optimization algorithm is proposed by combining the expectation–maximization algorithm with the Gauss process Rauch–Tung–Striebel smoother algorithm, that is, the EM-GP-RTSS algorithm. First, a theoretical formulation of the Gauss process state-space model is proposed, which is not found in previous references. Second, a Gauss process state-space model optimization framework with the expectation–maximization algorithm is proposed. In the expectation–maximization algorithm, the unknown system state is considered as the lost data, and the maximization of measurement likelihood function is transformed into that of a conditional expectation function. Then, the Gauss process–assumed density filter algorithm and the Gauss process Rauch–Tung–Striebel smoother algorithm are proposed with the Gauss process state-space model defined in this article, in order to calculate the smoothed distribution in the conditional expectation function. Finally, the Monte Carlo numerical integral method is used to obtain the approximate expression of the conditional expectation function. The simulation results demonstrate that the Gauss process state-space model optimized by the EM-GP-RTSS can simulate the system in the non-laboratory environment better than the Gauss process state-space model trained in the laboratory, and can reach or exceed the estimation accuracy of the traditional state-space model.

Highlights

  • In many engineering problems, there are a large number of complex nonlinear dynamic systems needed to estimate state with a time series of the sensor measurement

  • Based on the maximum likelihood estimator/estimate (MLE) criterion, this article proposes a novel Gauss process state-space model (GPSSM) optimization algorithm called as the EM-GP-RTSS, combining the EM algorithm with the Gauss process Rauch–Tung–Striebel smoother (GP-RTSS) algorithm, in order to improve the accuracy of GPSSMs simulating the nonlinear dynamic system in a non-laboratory environment

  • In section ‘‘Optimization algorithm for GPSSM,’’ we describe the development of the GPSSM optimization algorithm in detail

Read more

Summary

Introduction

There are a large number of complex nonlinear dynamic systems needed to estimate state with a time series of the sensor measurement. GPLVMs are extended to the dynamic system to obtain GPBF-LEARN, which is a framework for learning GP-BayesFilters from weakly labeled training data only.[4] With specially tailored Particle Markov Chain Monte Carlo (MC) samplers, a fully Bayesian approach to inference and learning (i.e. state estimation and system identification) for GPSSMs is proposed by marginalizing state transition functions.[5] this method preserves a non-parametric representation of a system model, it requires that its measurement model should be known. Based on the maximum likelihood estimator/estimate (MLE) criterion, this article proposes a novel GPSSM optimization algorithm called as the EM-GP-RTSS, combining the EM algorithm with the Gauss process Rauch–Tung–Striebel smoother (GP-RTSS) algorithm, in order to improve the accuracy of GPSSMs simulating the nonlinear dynamic system in a non-laboratory environment. IÃÀ1kà ð5Þ where kà is the kernel vector between aà and A, denoted as (k(aÃ, a1), k(aÃ, a2), . . . , k(aÃ, aN ))T

Background on GP
XL Xm ð À
Experimental results
Conclusion and future works
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.