IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v15y2019i7p1550147719862217.html
   My bibliography  Save this article

Gauss process state-space model optimization algorithm with expectation maximization

Author

Listed:
  • Hongqiang Liu
  • Haiyan Yang
  • Tao Zhang
  • Bo Pan

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.

Suggested Citation

  • Hongqiang Liu & Haiyan Yang & Tao Zhang & Bo Pan, 2019. "Gauss process state-space model optimization algorithm with expectation maximization," International Journal of Distributed Sensor Networks, , vol. 15(7), pages 15501477198, July.
  • Handle: RePEc:sae:intdis:v:15:y:2019:i:7:p:1550147719862217
    DOI: 10.1177/1550147719862217
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147719862217
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147719862217?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:15:y:2019:i:7:p:1550147719862217. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.