IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v42y2011i10p1789-1799.html
   My bibliography  Save this article

A new real-time suboptimum filtering and prediction scheme for general nonlinear discrete dynamic systems with Gaussian or non-Gaussian noise

Author

Listed:
  • Kerim Demirbaş

Abstract

A new suboptimum state filtering and prediction scheme is proposed for nonlinear discrete dynamic systems with Gaussian or non-Gaussian disturbance and observation noises. This scheme is an online estimation scheme for real-time applications. Furthermore, this scheme is very suitable for state estimation under either constraints imposed on estimates or missing observations. State and observation models can be any nonlinear functions of the states, disturbance and observation noises as long as noise samples are independent, and the density functions of noise samples and conditional density functions of the observations given the states are available. State models are used to calculate transition probabilities from gates to gates. If these transition probabilities are known or can be estimated, state models are not needed for estimation. The proposed scheme (PR) is based upon state quantisation and multiple hypothesis testing. Monte Carlo simulations have shown that the performance of the PR, sampling importance resampling (SIR) particle filter and extended Kalman (EK) filter are all model-dependent, and that the performance of the PR is better than both the SIR particle filter and EK filter for some nonlinear models, simulation results of three of which are given in this article.

Suggested Citation

  • Kerim Demirbaş, 2011. "A new real-time suboptimum filtering and prediction scheme for general nonlinear discrete dynamic systems with Gaussian or non-Gaussian noise," International Journal of Systems Science, Taylor & Francis Journals, vol. 42(10), pages 1789-1799.
  • Handle: RePEc:taf:tsysxx:v:42:y:2011:i:10:p:1789-1799
    DOI: 10.1080/00207721003653682
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721003653682
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721003653682?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tsysxx:v:42:y:2011:i:10:p:1789-1799. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.